Pages that link to "Item:Q421709"
From MaRDI portal
The following pages link to Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709):
Displaying 13 items.
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
- Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
