The following pages link to Frédéric Semet (Q321124):
Displaying 42 items.
- (Q235268) (redirect page) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints (Q321126) (← links)
- A 2-stage method for a field service routing problem with stochastic travel and service times (Q342116) (← links)
- Risk approaches for delivering disaster relief supplies (Q647529) (← links)
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
- The bi-objective covering tour problem (Q868132) (← links)
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem (Q960381) (← links)
- A tabu search with an oscillation strategy for the discriminant analysis problem (Q976027) (← links)
- A generalized linear programming model for nurse scheduling (Q1296052) (← links)
- Estimation and determination of shortest path length in a road network with obstacles (Q1388932) (← links)
- A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints (Q1652382) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- Heuristics for the multi-vehicle covering tour problem (Q1818567) (← links)
- Heuristics for the black and white traveling salesman problem (Q1869887) (← links)
- Ambulance location and relocation models. (Q1872997) (← links)
- A two-phase algorithm for the partial accessibility constrained vehicle routing problem (Q1908293) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
- Meta partial Benders decomposition for the logistics service network design problem (Q2116853) (← links)
- A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- A three-phase matheuristic for the packaging and shipping problem (Q2307048) (← links)
- Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717) (← links)
- An evolutionary algorithm for the vehicle routing problem with route balancing (Q2378416) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- Product line optimization with multiples sites (Q2676378) (← links)
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
- (Q3061960) (← links)
- A tiling and routing heuristic for the screening of cytological samples (Q3157800) (← links)
- The maximal expected coverage relocation problem for emergency vehicles (Q3369247) (← links)
- The Black and White Traveling Salesman Problem (Q3391982) (← links)
- The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms (Q3392127) (← links)
- Multilayer variable neighborhood search for two‐level uncapacitated facility location problems with single assignment (Q4642439) (← links)
- A guide to vehicle routing heuristics (Q4656651) (← links)
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
- Multi-period distribution networks with purchase commitment contracts (Q6090158) (← links)
