The following pages link to Sune Lauth Gadegaard (Q1615949):
Displaying 7 items.
- A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- (Q2664006) (redirect page) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
