Name
Affiliation
Papers
NICOLAS JOZEFOWIEZ
Université de Toulouse; UPS, INSA, INP, ISAE; LAAS; F-31077 Toulouse, France
34
Collaborators
Citations 
PageRank 
43
348
21.58
Referers 
Referees 
References 
679
397
298
Search Limit
100679
Title
Citations
PageRank
Year
Meta partial benders decomposition for the logistics service network design problem00.342022
Exact Methods for Mono-Objective and Bi-Objective Multi-Vehicle Covering Tour Problems10.372020
A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem00.342020
Optimizing ground station networks for free space optical communications: Maximizing the data transfer.20.412019
Ground stations networks for Free-Space Optical communications: maximizing the data transfer.00.342018
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective00.342018
A dynamic programming operator for tour location problems applied to the covering tour problem.30.422017
A Hierarchical Approach For The Selection Of Optical Ground Stations Maximizing The Data Transfer From Low-Earth Observation Satellites00.342017
Approximation of the parallel machine scheduling problem with additional unit resources.00.342016
Inventory Routing with Explicit Energy Consumption - A Mass-Flow Formulation and First Experimentation.10.362016
A mass-flow MILP formulation for energy-efficient supplying in assembly lines.00.342015
A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite.140.592015
Models for Multimodal Freight Transportation Integrating Consolidation and Transportation Phases00.342015
Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems00.342015
A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem20.382015
Satellite Data Download Management with Uncertainty about the Generated Volumes.40.562014
A branch-and-price algorithm for the multivehicle covering tour problem.10.362014
Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective.30.392013
Biased Random Key Genetic Algorithm for Multi-user Earth Observation Scheduling.10.352013
Biased Random Key Genetic Algorithm with Hybrid Decoding for Multi-objective Optimization.30.412013
A heuristic approach based on shortest path problems for integrated flight, aircraft, and passenger rescheduling under disruptions.30.382013
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem130.592012
Multi-objective optimization for selecting and scheduling observations by agile earth observing satellites80.562012
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants70.502011
A branch-and-price algorithm for the windy rural postman problem.00.342011
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives00.342010
An evolutionary algorithm for the vehicle routing problem with route balancing331.012009
Multi-objective vehicle routing problems1113.622008
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits250.942008
On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem40.422008
The bi-objective covering tour problem271.322007
Target aiming Pareto search and its application to the vehicle routing problem with route balancing221.072007
Enhancements of NSGA II and its application to the vehicle routing problem with route balancing231.032005
Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem371.812002