Frédéric Semet
Orcid: 0000-0002-1334-5417
According to our database1,
Frédéric Semet
authored at least 65 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
1
4
3
2
4
2
2
3
2
2
2
2
3
1
3
2
1
3
2
2
1
1
1
4
1
1
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., January, 2024
Expert Syst. Appl., 2024
Eur. J. Oper. Res., 2024
Decision-Focused Predictions via Pessimistic Bilevel Optimization: A Computational Study.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024
2023
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023
2022
Eur. J. Oper. Res., 2022
Comput. Ind. Eng., 2022
Proceedings of the Twelfth International Workshop on Agents in Traffic and Transportation co-located with the the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022), 2022
2021
AI Commun., 2021
Mixed integer programming formulations for the generalized traveling salesman problem with time windows.
4OR, 2021
2020
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing.
Transp. Sci., 2020
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows.
Oper. Res. Lett., 2020
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows.
Eur. J. Oper. Res., 2020
Eur. J. Oper. Res., 2020
Proceedings of the Eleventh International Workshop on Agents in Traffic and Transportation co-located with the 24th European Conference on Artificial Intelligence (ECAI 2020), 2020
2019
Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery.
Transp. Sci., 2019
Comput. Oper. Res., 2019
2017
A unified matheuristic for solving multi-constrained traveling salesman problems with profits.
EURO J. Comput. Optim., 2017
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints.
Comput. Oper. Res., 2017
2016
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints.
Transp. Sci., 2016
A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints.
Eur. J. Oper. Res., 2016
A 2-stage method for a field service routing problem with stochastic travel and service times.
Comput. Oper. Res., 2016
2015
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment.
Networks, 2015
Eur. J. Oper. Res., 2015
Models for Multimodal Freight Transportation Integrating Consolidation and Transportation Phases.
Proceedings of the ICORES 2015, 2015
2014
Proceedings of the Vehicle Routing, 2014
2012
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem.
INFORMS J. Comput., 2012
2011
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants.
Comput. Oper. Res., 2011
2010
Comput. Oper. Res., 2010
2009
RAIRO Oper. Res., 2009
Eur. J. Oper. Res., 2009
Formulations and relaxations for a multi-echelon capacitated location-distribution problem.
Comput. Oper. Res., 2009
Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
2008
2007
The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms.
Oper. Res., 2007
Target aiming Pareto search and its application to the vehicle routing problem with route balancing.
J. Heuristics, 2007
2006
J. Oper. Res. Soc., 2006
2005
Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing.
Proceedings of the Artificial Evolution, 2005
2004
Oper. Res. Lett., 2004
Comput. Oper. Res., 2004
2003
Comput. Oper. Res., 2003
2002
Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem.
Proceedings of the Parallel Problem Solving from Nature, 2002
Proceedings of the Vehicle Routing Problem., 2002
2001
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation.
Parallel Comput., 2001
2000
1999
1998
Networks, 1998
J. Oper. Res. Soc., 1998
Eur. J. Oper. Res., 1998
Eur. J. Oper. Res., 1998
1997
1995
A two-phase algorithm for the partial accessibility constrained vehicle routing problem.
Ann. Oper. Res., 1995
1993
Ann. Oper. Res., 1993