default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Semet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j55]Aitor López Sánchez
, Marin Lujak, Frédéric Semet, Holger Billhardt:
How to achieve fair and efficient cooperative vehicle routing? AI Commun. 37(2): 223-245 (2024)- [j54]Christian Clavijo López, Yves Crama, Thierry Pironet, Frédéric Semet:
Multi-period distribution networks with purchase commitment contracts. Eur. J. Oper. Res. 312(2): 556-572 (2024) - [j53]Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, M. Grazia Speranza:
Vehicle routing problems with multiple commodities: A survey. Eur. J. Oper. Res. 317(1): 1-15 (2024) - [j52]Aitor López Sánchez, Marin Lujak, Frédéric Semet, Holger Billhardt:
Dynamic, fair, and efficient routing for cooperative autonomous vehicle fleets. Expert Syst. Appl. 251: 123964 (2024) - [c7]Víctor Bucarey, Sophia Calderón, Gonzalo Muñoz, Frédéric Semet:
Decision-Focused Predictions via Pessimistic Bilevel Optimization: A Computational Study. CPAIOR (1) 2024: 127-135 - 2023
- [c6]Aitor López Sánchez, Marin Lujak, Frédéric Semet, Holger Billhardt:
Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW). SMC 2023: 1530-1536 - 2022
- [j51]Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, M. Grazia Speranza:
A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Ind. Eng. 163: 107793 (2022) - [j50]Sebastián Dávila-Gálvez, Martine Labbé, Vladimir Marianov, Fernando Ordóñez, Frédéric Semet:
Product line optimization with multiples sites. Comput. Oper. Res. 148: 105978 (2022) - [j49]Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet:
Meta partial benders decomposition for the logistics service network design problem. Eur. J. Oper. Res. 300(2): 473-489 (2022) - [c5]Aitor López Sánchez, Marin Lujak, Frédéric Semet, Holger Billhardt:
On Balancing Fairness and Efficiency in Routing of Cooperative Vehicle Fleets. ATT@IJCAI 2022: 62-76 - 2021
- [j48]Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Cyriaque Rousselot, Frédéric Semet:
Mixed integer programming formulations for the generalized traveling salesman problem with time windows. 4OR 19(4): 571-592 (2021) - [j47]Marin Lujak, Elizabeth Sklar, Frédéric Semet:
Agriculture fleet vehicle routing: A decentralised and dynamic problem. AI Commun. 34(1): 55-71 (2021) - 2020
- [j46]Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet, Tom Van Woensel:
A Benders decomposition-based approach for logistics service network design. Eur. J. Oper. Res. 286(2): 523-537 (2020) - [j45]Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet:
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. Eur. J. Oper. Res. 286(3): 849-866 (2020) - [j44]Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet:
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows. Oper. Res. Lett. 48(2): 167-169 (2020) - [j43]Nabil Absi, Diego Cattaruzza, Dominique Feillet, Maxime Ogier, Frédéric Semet:
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing. Transp. Sci. 54(2): 313-329 (2020) - [c4]Marin Lujak, Elizabeth Sklar, Frédéric Semet:
On Multi-Agent Coordination of Agri-Robot Fleets. ATT@ECAI 2020: 16-23 - [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
- [j42]Wenjuan Gu, Diego Cattaruzza, Maxime Ogier, Frédéric Semet:
Adaptive large neighborhood search for the commodity constrained split delivery VRP. Comput. Oper. Res. 112 (2019) - [j41]Maria I. Restrepo, Frédéric Semet, Thomas Pocreau:
Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery. Transp. Sci. 53(4): 1150-1174 (2019) - 2017
- [j40]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints. Comput. Oper. Res. 86: 86-93 (2017) - [j39]Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet:
A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO J. Comput. Optim. 5(3): 393-422 (2017) - 2016
- [j38]S. Binart, Pierre Dejax, Michel Gendreau, Frédéric Semet:
A 2-stage method for a field service routing problem with stochastic travel and service times. Comput. Oper. Res. 65: 64-75 (2016) - [j37]Shahin Gelareh, Rahimeh Neamatian Monemi, Frédéric Semet, Gilles Goncalves:
A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints. Eur. J. Oper. Res. 249(3): 1144-1152 (2016) - [j36]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints. Transp. Sci. 50(4): 1286-1299 (2016) - 2015
- [j35]Rahma Lahyani, Mahdi Khemakhem, Frédéric Semet:
Rich vehicle routing problems: From a taxonomy to a definition. Eur. J. Oper. Res. 241(1): 1-14 (2015) - [j34]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. Networks 66(3): 214-234 (2015) - [c3]Leonardo Malta, Nicolas Jozefowiez, Frédéric Semet:
Models for Multimodal Freight Transportation Integrating Consolidation and Transportation Phases. ICORES 2015: 338-345 - 2014
- [p2]Frédéric Semet, Paolo Toth, Daniele Vigo:
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem. Vehicle Routing 2014: 37-57 - 2012
- [j33]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
The undirected m-Capacitated Peripatetic Salesman Problem. Eur. J. Oper. Res. 223(3): 637-643 (2012) - [j32]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) - 2011
- [j31]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) - [j30]Pamela C. Nolz, Frédéric Semet, Karl F. Doerner:
Risk approaches for delivering disaster relief supplies. OR Spectr. 33(3): 543-569 (2011) - 2010
- [j29]Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev:
A tabu search with an oscillation strategy for the discriminant analysis problem. Comput. Oper. Res. 37(10): 1688-1696 (2010) - [j28]Dominique Feillet, Gilbert Laporte, Frédéric Semet:
Preface. Networks 55(1): 1 (2010)
2000 – 2009
- 2009
- [j27]Bernard Gendron, Frédéric Semet:
Formulations and relaxations for a multi-echelon capacitated location-distribution problem. Comput. Oper. Res. 36(5): 1335-1355 (2009) - [j26]Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi:
An evolutionary algorithm for the vehicle routing problem with route balancing. Eur. J. Oper. Res. 195(3): 761-769 (2009) - [j25]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
Heuristiques pour le Problème du Vendeur m-Péripatétique. RAIRO Oper. Res. 43(1): 13-26 (2009) - [i1]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j24]Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi:
Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2): 293-309 (2008) - 2007
- [j23]Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi:
The bi-objective covering tour problem. Comput. Oper. Res. 34(7): 1929-1942 (2007) - [j22]Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi:
Target aiming Pareto search and its application to the vehicle routing problem with route balancing. J. Heuristics 13(5): 455-469 (2007) - [j21]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms. Oper. Res. 55(5): 949-965 (2007) - 2006
- [j20]Gianpaolo Ghiani, Gilbert Laporte, Frédéric Semet:
The Black and White Traveling Salesman Problem. Oper. Res. 54(2): 366-378 (2006) - [j19]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
The maximal expected coverage relocation problem for emergency vehicles. J. Oper. Res. Soc. 57(1): 22-28 (2006) - 2005
- [j18]Éric Duchêne, Gilbert Laporte, Frédéric Semet:
Branch-and-cut algorithms for the undirected m. Eur. J. Oper. Res. 162(3): 700-712 (2005) - [c2]Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi:
Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing. Artificial Evolution 2005: 131-142 - 2004
- [j17]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res. 31(3): 347-358 (2004) - [j16]Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer:
Preface. Discret. Appl. Math. 145(1): 1-2 (2004) - [j15]Patrice Marcotte, Gilles Savard, Frédéric Semet:
A bilevel programming approach to the travelling salesman problem. Oper. Res. Lett. 32(3): 240-248 (2004) - 2003
- [j14]Mélanie Bourgeois, Gilbert Laporte, Frédéric Semet:
Heuristics for the black and white traveling salesman problem. Comput. Oper. Res. 30(1): 75-85 (2003) - [j13]Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
Ambulance location and relocation models. Eur. J. Oper. Res. 147(3): 451-463 (2003) - 2002
- [j12]Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
Fast heuristics for large scale covering-location problems. Comput. Oper. Res. 29(6): 651-665 (2002) - [j11]Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet:
A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5): 512-522 (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 - [p1]Gilbert Laporte, Frédéric Semet:
Classical Heuristics for the Capacitated VRP. The Vehicle Routing Problem 2002: 109-128 - 2001
- [j10]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. 27(12): 1641-1653 (2001) - 2000
- [j9]Mondher Hachicha, M. John Hodgson, Gilbert Laporte, Frédéric Semet:
Heuristics for the multi-vehicle covering tour problem. Comput. Oper. Res. 27(1): 29-42 (2000)
1990 – 1999
- 1999
- [j8]Gilbert Laporte, Frédéric Semet:
An optimality cut for mixed integer linear programs. Eur. J. Oper. Res. 119(3): 671-677 (1999) - 1998
- [j7]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106(2-3): 539-545 (1998) - [j6]Brigitte Jaumard, Frédéric Semet, Tsevi Vovor:
A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107(1): 1-18 (1998) - [j5]Gilbert Laporte, Frédéric Semet, V. V. Dadeshidze, L. J. Olsson:
A tiling and routing heuristic for the screening of cytological samples. J. Oper. Res. Soc. 49(12): 1233-1238 (1998) - [j4]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4): 263-273 (1998) - 1997
- [j3]Michel Gendreau, Gilbert Laporte, Frédéric Semet:
The Covering Tour Problem. Oper. Res. 45(4): 568-576 (1997) - 1995
- [j2]Frédéric Semet:
A two-phase algorithm for the partial accessibility constrained vehicle routing problem. Ann. Oper. Res. 61(1): 45-65 (1995) - 1993
- [j1]Frédéric Semet, Éric D. Taillard:
Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41(4): 469-488 (1993)
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-11-05 20:57 CET 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:
