|
Search the dblp DataBase
Frédéric Semet:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi
Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing. [Citation Graph (0, 0)][DBLP] Artificial Evolution, 2005, pp:131-142 [Conf]
- Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi
Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP] PPSN, 2002, pp:271-280 [Conf]
- Mélanie Bourgeois, Gilbert Laporte, Frédéric Semet
Heuristics for the black and white traveling salesman problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 2003, v:30, n:1, pp:75-85 [Journal]
- Luce Brotcorne, Gilbert Laporte, Frédéric Semet
Fast heuristics for large scale covering-location problems. [Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:6, pp:651-665 [Journal]
- Michel Gendreau, Gilbert Laporte, Frédéric Semet
Heuristics and lower bounds for the bin packing problem with conflicts. [Citation Graph (0, 0)][DBLP] Computers & OR, 2004, v:31, n:3, pp:347-358 [Journal]
- Mondher Hachicha, M. John Hodgson, Gilbert Laporte, Frédéric Semet
Heuristics for the multi-vehicle covering tour problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 2000, v:27, n:1, pp:29-42 [Journal]
- Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer
Preface. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:145, n:1, pp:1-2 [Journal]
- Michel Gendreau, Gilbert Laporte, Frédéric Semet
A branch-and-cut algorithm for the undirected selective traveling salesman problem. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:263-273 [Journal]
- Patrice Marcotte, Gilles Savard, Frédéric Semet
A bilevel programming approach to the travelling salesman problem. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:3, pp:240-248 [Journal]
- Michel Gendreau, Gilbert Laporte, Frédéric Semet
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. [Citation Graph (0, 0)][DBLP] Parallel Computing, 2001, v:27, n:12, pp:1641-1653 [Journal]
- Éric Duchenne, Gilbert Laporte, Frédéric Semet
Branch-and-cut algorithms for the undirected m. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:3, pp:700-712 [Journal]
- Luce Brotcorne, Gilbert Laporte, Frédéric Semet
Ambulance location and relocation models. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:147, n:3, pp:451-463 [Journal]
- Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi
Target aiming Pareto search and its application to the vehicle routing problem with route balancing. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2007, v:13, n:5, pp:455-469 [Journal]
The bi-objective covering tour problem. [Citation Graph (, )][DBLP]
Formulations and relaxations for a multi-echelon capacitated location-distribution problem. [Citation Graph (, )][DBLP]
A tabu search with an oscillation strategy for the discriminant analysis problem. [Citation Graph (, )][DBLP]
Search in 0.039secs, Finished in 0.039secs
|