Frédéric Semet

Orcid: 0000-0002-1334-5417

According to our database1, Frédéric Semet authored at least 62 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multi-period distribution networks with purchase commitment contracts.
Eur. J. Oper. Res., January, 2024

2023
Decision-focused predictions via pessimistic bilevel optimization: a computational study.
CoRR, 2023

Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW).
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023

2022
Meta partial benders decomposition for the logistics service network design problem.
Eur. J. Oper. Res., 2022

Product line optimization with multiples sites.
Comput. Oper. Res., 2022

A sequential approach for a multi-commodity two-echelon distribution problem.
Comput. Ind. Eng., 2022

On Balancing Fairness and Efficiency in Routing of Cooperative Vehicle Fleets.
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
Agriculture fleet vehicle routing: A decentralised and dynamic problem.
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

A Benders decomposition-based approach for logistics service network design.
Eur. J. Oper. Res., 2020

On Multi-Agent Coordination of Agri-Robot Fleets.
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

Adaptive large neighborhood search for the commodity constrained split delivery VRP.
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

Rich vehicle routing problems: From a taxonomy to a definition.
Eur. J. Oper. Res., 2015

Models for Multimodal Freight Transportation Integrating Consolidation and Transportation Phases.
Proceedings of the ICORES 2015, 2015

2014
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem.
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

The undirected m-Capacitated Peripatetic Salesman Problem.
Eur. J. Oper. Res., 2012

2011
Risk approaches for delivering disaster relief supplies.
OR Spectr., 2011

A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants.
Comput. Oper. Res., 2011

2010
Preface.
Networks, 2010

A tabu search with an oscillation strategy for the discriminant analysis problem.
Comput. Oper. Res., 2010

2009
Heuristiques pour le Problème du Vendeur <i>m</i>-Péripatétique.
RAIRO Oper. Res., 2009

An evolutionary algorithm for the vehicle routing problem with route balancing.
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
Multi-objective vehicle routing problems.
Eur. J. Oper. Res., 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

The bi-objective covering tour problem.
Comput. Oper. Res., 2007

2006
The maximal expected coverage relocation problem for emergency vehicles.
J. Oper. Res. Soc., 2006

The Black and White Traveling Salesman Problem.
Oper. Res., 2006

2005
Branch-and-cut algorithms for the undirected m.
Eur. J. Oper. Res., 2005

Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing.
Proceedings of the Artificial Evolution, 2005

2004
A bilevel programming approach to the travelling salesman problem.
Oper. Res. Lett., 2004

Preface.
Discret. Appl. Math., 2004

Heuristics and lower bounds for the bin packing problem with conflicts.
Comput. Oper. Res., 2004

2003
Ambulance location and relocation models.
Eur. J. Oper. Res., 2003

Heuristics for the black and white traveling salesman problem.
Comput. Oper. Res., 2003

2002
A guide to vehicle routing heuristics.
J. Oper. Res. Soc., 2002

Fast heuristics for large scale covering-location problems.
Comput. Oper. Res., 2002

Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem.
Proceedings of the Parallel Problem Solving from Nature, 2002

Classical Heuristics for the Capacitated VRP.
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
Heuristics for the multi-vehicle covering tour problem.
Comput. Oper. Res., 2000

1999
An optimality cut for mixed integer linear programs.
Eur. J. Oper. Res., 1999

1998
A branch-and-cut algorithm for the undirected selective traveling salesman problem.
Networks, 1998

A tiling and routing heuristic for the screening of cytological samples.
J. Oper. Res. Soc., 1998

A generalized linear programming model for nurse scheduling.
Eur. J. Oper. Res., 1998

A tabu search heuristic for the undirected selective travelling salesman problem.
Eur. J. Oper. Res., 1998

1997
The Covering Tour Problem.
Oper. Res., 1997

1995
A two-phase algorithm for the partial accessibility constrained vehicle routing problem.
Ann. Oper. Res., 1995

1993
Solving real-life vehicle routing problems efficiently using tabu search.
Ann. Oper. Res., 1993


  Loading...