The following pages link to Jens Lysgaard (Q1043245):
Displaying 17 items.
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
- A two-phase shortest path algorithm for networks with node coordinates (Q1390292) (← links)
- Multistars, partial multistars and the capacitated vehicle routing problem (Q1396812) (← links)
- Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- Column generation approaches to ship scheduling with flexible cargo sizes (Q2379534) (← links)
- Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- Optimal vehicle routing with lower and upper bounds on route durations (Q4642459) (← links)
- Integer Programming and Combinatorial Optimization (Q5712447) (← links)
- A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
- The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
