default search action
Nicolas Jozefowiez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Patrick Healy
, Nicolas Jozefowiez
A branch-and-cut algorithm for the connected max-k-cut problem. Eur. J. Oper. Res. 312(1): 117-124 (2024) - 2022
- [j23]Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu
An ε-constraint column generation-and-enumeration algorithm for Bi-Objective Vehicle Routing Problems. Comput. Oper. Res. 138: 105570 (2022) - [j22]Simon Belieres
Meta partial benders decomposition for the logistics service network design problem. Eur. J. Oper. Res. 300(2): 473-489 (2022) - 2021
- [c16]Louis Rivière
Multi-product, Multi-supplier Order Assignment and Routing for an e-Commerce Application in the Retail Sector. ICORES 2021: 438-445 - 2020
- [j21]Estèle Glize, Roberto Roberti
Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems. Eur. J. Oper. Res. 283(3): 812-824 (2020) - [j20]Simon Belieres
A Benders decomposition-based approach for logistics service network design. Eur. J. Oper. Res. 286(2): 523-537 (2020) - [j19]Yun He
A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem. Transp. Sci. 54(2): 355-374 (2020) - [i2]Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet
Meta Partial Benders Decomposition for the Logistics Service Network Design Problem. CoRR abs/2009.14628 (2020)
2010 – 2019
- 2019
- [j18]Mikael Capelle, Marie-José Huguet
Optimizing ground station networks for free space optical communications: Maximizing the data transfer. Networks 73(2): 234-253 (2019) - 2018
- [j17]Christian Artigues, Nicolas Jozefowiez, Boadu Mensah Sarpong:
Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective. EURO J. Comput. Optim. 6(2): 117-142 (2018) - [j16]Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, Xavier Olive:
Ground stations networks for Free-Space Optical communications: maximizing the data transfer. Electron. Notes Discret. Math. 64: 255-264 (2018) - [c15]Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu
An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems. ISCO 2018: 208-218 - 2017
- [j15]Leticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu
A dynamic programming operator for tour location problems applied to the covering tour problem. J. Heuristics 23(1): 53-80 (2017) - [c14]Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, Xavier Olive:
A hierarchical approach for the selection of optical ground stations maximizing the data transfer from low-earth observation satellites. ICC 2017: 1-6 - 2016
- [j14]Emmanuel Hebrard
Approximation of the parallel machine scheduling problem with additional unit resources. Discret. Appl. Math. 215: 126-135 (2016) - [c13]Yun He, Cyril Briand, Nicolas Jozefowiez:
Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation. ICORES (Selected Papers) 2016: 96-116 - [c12]Yun He, Cyril Briand
A Mass-flow based MILP Formulation for the Inventory Routing with Explicit Energy Consumption. ICORES 2016: 242-251 - [c11]Carlos L. Quintero-Araujo
Planning Freight Delivery Routes in Mountainous Regions. MS 2016: 123-132 - 2015
- [j13]Panwadee Tangpattanakul, Nicolas Jozefowiez, Pierre Lopez:
A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite. Eur. J. Oper. Res. 245(2): 542-554 (2015) - [j12]Boadu Mensah Sarpong, Christian Artigues, Nicolas Jozefowiez:
Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems. RAIRO Oper. Res. 49(3): 527-554 (2015) - [c10]Leonardo Malta, Nicolas Jozefowiez, Frédéric Semet:
Models for Multimodal Freight Transportation Integrating Consolidation and Transportation Phases. ICORES 2015: 338-345 - [c9]Leticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu
A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem. LION 2015: 170-185 - [i1]Maria Muguerza, Cyril Briand
A mass-flow MILP formulation for energy-efficient supplying in assembly lines. CoRR abs/1511.06236 (2015) - 2014
- [j11]Nicolas Jozefowiez:
A branch-and-price algorithm for the multivehicle covering tour problem. Networks 64(3): 160-168 (2014) - [c8]Cédric Pralet, Gérard Verfaillie, Adrien Maillard, Emmanuel Hebrard, Nicolas Jozefowiez, Marie-José Huguet, Thierry Desmousceaux, Pierre Blanc-Paques, Jean Jaubert:
Satellite Data Download Management with Uncertainty about the Generated Volumes. ICAPS 2014 - 2013
- [j10]Nicolas Jozefowiez, Catherine Mancel, Félix Mora-Camino:
A heuristic approach based on shortest path problems for integrated flight, aircraft, and passenger rescheduling under disruptions. J. Oper. Res. Soc. 64(3): 384-395 (2013) - [c7]Boadu Mensah Sarpong, Christian Artigues, Nicolas Jozefowiez:
Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective. ATMOS 2013: 137-149 - [c6]Panwadee Tangpattanakul, Nicolas Jozefowiez, Pierre Lopez:
Biased Random Key Genetic Algorithm for Multi-user Earth Observation Scheduling. WCO@FedCSIS 2013: 143-160 - [c5]Panwadee Tangpattanakul, Nicolas Jozefowiez, Pierre Lopez:
Biased Random Key Genetic Algorithm with Hybrid Decoding for Multi-objective Optimization. FedCSIS 2013: 393-400 - 2012
- [j9]Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem. INFORMS J. Comput. 24(4): 554-564 (2012) - [c4]Panwadee Tangpattanakul, Nicolas Jozefowiez, Pierre Lopez:
Multi-objective Optimization for Selecting and Scheduling Observations by Agile Earth Observing Satellites. PPSN (2) 2012: 112-121 - 2011
- [j8]Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants. Comput. Oper. Res. 38(11): 1534-1542 (2011) - [j7]Hasan Murat Afsar, Nicolas Jozefowiez, Pierre Lopez:
A branch-and-price algorithm for the windy rural postman problem. RAIRO Oper. Res. 45(4): 353-364 (2011) - 2010
- [j6]Christian Artigues, Nicolas Jozefowiez, Mohamed Ali Aloulou:
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives. Electron. Notes Discret. Math. 36: 1233-1240 (2010)
2000 – 2009
- 2009
- [j5]Nicolas Jozefowiez, Frédéric Semet
An evolutionary algorithm for the vehicle routing problem with route balancing. Eur. J. Oper. Res. 195(3): 761-769 (2009) - 2008
- [j4]Nicolas Jozefowiez, Frédéric Semet
Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2): 293-309 (2008) - [j3]Nicolas Jozefowiez, Fred W. Glover, Manuel Laguna:
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits. J. Math. Model. Algorithms 7(2): 177-195 (2008) - [c3]Arnaud Liefooghe
On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem. Hybrid Metaheuristics 2008: 117-130 - 2007
- [j2]Nicolas Jozefowiez, Frédéric Semet
The bi-objective covering tour problem. Comput. Oper. Res. 34(7): 1929-1942 (2007) - [j1]Nicolas Jozefowiez, Frédéric Semet
Target aiming Pareto search and its application to the vehicle routing problem with route balancing. J. Heuristics 13(5): 455-469 (2007) - 2005
- [c2]Nicolas Jozefowiez, Frédéric Semet
Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing. Artificial Evolution 2005: 131-142 - 2002
- [c1]Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi:
Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem. PPSN 2002: 271-280
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: