Pages that link to "Item:Q5378639"
From MaRDI portal
The following pages link to Solution of a Large-Scale Traveling-Salesman Problem (Q5378639):
Displaying 14 items.
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- 0-1 mathematical programming models for flexible process planning (Q6112702) (← links)
- Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
- Adaptive solution prediction for combinatorial optimization (Q6112875) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Some contributions of Ailsa H. Land to the study of the traveling salesman problem (Q6169992) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
- On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm (Q6179695) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
- Solving large-scale routing optimization problems with networks and only networks (Q6204267) (← links)
