Pages that link to "Item:Q1751233"
From MaRDI portal
The following pages link to On the complexity of the separation problem for rounded capacity inequalities (Q1751233):
Displaying 5 items.
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
