Semet Frdric

Frdric Semet

Information about the author Frdric Semet will soon be added to the site.
Found 30 papers in total
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
2016
We consider the two‐level uncapacitated facility location problem with...
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
2015
We develop a variant of the variable neighborhood search (VNS) metaheuristic called...
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
2012
This paper describes a generic branch‐and‐cut algorithm applicable to...
The undirected m‐Capacitated Peripatetic Salesman Problem
The undirected m‐Capacitated Peripatetic Salesman Problem
2012
In the m ‐Capacitated Peripatetic Salesman Problem ( m ‐CPSP) the aim is...
Risk approaches for delivering disaster relief supplies
Risk approaches for delivering disaster relief supplies
2011
We consider the problem of designing the logistic system to assure adequate...
Heuristics for the m–Peripatetic Salesman Problem
Heuristics for the m–Peripatetic Salesman Problem
2009
The m –Peripatetic Salesman Problem ( m –PSP) is defined on a undirected...
The undirected m-peripatetic salesman problem: polyhedral results and new algorithms
The undirected m-peripatetic salesman problem: polyhedral results and new algorithms
2007
In the m-peripatetic salesman problem (m-PSP), the aim is to determine m edge disjoint...
Target aiming Pareto search and its application to the vehicle routing problem with route balancing
Target aiming Pareto search and its application to the vehicle routing problem with route balancing
2007
In this paper, we present a solution method for a bi-objective vehicle routing...
Problems of real time fleet management
Problems of real time fleet management
2006
Thanks to the evolution of information and communication technologies, a...
The bi-objective covering tour problem
The bi-objective covering tour problem
2007
The paper discusses the definition and solution of a bi-objective routing problem,...
The black and white traveling salesman problem
The black and white traveling salesman problem
2006
The black and white traveling salesman problem (BWTSP) is defined on a graph G whose...
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
2005
In the m -Peripatetic Salesman Problem ( m -PSP) the aim is to determine m edge...
A bilevel programming approach to the travelling salesman problem
A bilevel programming approach to the travelling salesman problem
2004
We show that the travelling salesman problem is polynomially reducible to a bilevel...
Heuristics and lower bounds for the bin packing problem with conflicts
Heuristics and lower bounds for the bin packing problem with conflicts
2004
In the bin packing problem with conflicts, the aim is to pack items into the minimum...
Ambulance location and relocation models
Ambulance location and relocation models
2003
This article traces the evolution of ambulance location and relocation models proposed...
Heuristics for the black and white traveling salesman problem
Heuristics for the black and white traveling salesman problem
2003
The black and white traveling salesman problem (BWTSP) is defined on a graph G whose...
Fast heuristics for large scale covering-location problems
Fast heuristics for large scale covering-location problems
2002
We propose fast heuristics for large-scale covering-location problems in which the set...
A branch-and-cut algorithm for the undirected selective traveling salesman problem
A branch-and-cut algorithm for the undirected selective traveling salesman problem
1998
The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits...
Classical and modern heuristics for the vehicle routing problem
Classical and modern heuristics for the vehicle routing problem
2000
This article is a survey of heuristics for the Vehicle Routing Problem. It is divided...
Heuristics for the multi-vehicle covering tour problem
Heuristics for the multi-vehicle covering tour problem
2000
The multi-vehicle covering tour problem is defined on a graph G = ( V ∪ W, E ),...
An optimality cut for mixed integer linear programs
An optimality cut for mixed integer linear programs
1999
We derive the penalty cut, a simple optimality cut of general applicability in pure or...
The covering tour problem
The covering tour problem
1997
The Covering Tour Problem (CTP) is defined on a graph G = ( V ∪ W, E ),...
Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem
Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem
1999
This note proposes a transformation of the Generalized Traveling Salesman Problem on...
A tabu search heuristic for the undirected selective travelling salesman problem
A tabu search heuristic for the undirected selective travelling salesman problem
1998
The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G =...
Papers per page: