The following pages link to Christophe Duhamel (Q295884):
Displayed 22 items.
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
- Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations (Q513117) (← links)
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408) (← links)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
- Aggregation approach for the minimum binary cost tension problem (Q1015014) (← links)
- Methods for solving road network problems with disruptions (Q1742219) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- A column generation approach for the strong network orientation problem (Q2413153) (← links)
- <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach (Q3057130) (← links)
- Multicommodity flow problems with a bounded number of paths: A flow deviation approach (Q3418124) (← links)
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem (Q3627705) (← links)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows (Q4367064) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- Models and heuristics for a minimum arborescence problem (Q5433191) (← links)
- Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- The strong network orientation problem (Q6082268) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- A min-max regret approach for the Steiner Tree Problem with Interval Costs (Q6357901) (← links)