The following pages link to Daniel Santos (Q1728471):
Displaying 7 items.
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Designing master surgery schedules with downstream unit integration via stochastic programming (Q2670515) (← links)
- Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem (Q4584873) (← links)
- Comparison of classical and modern methods for measuring and correcting for acquiescence (Q5215423) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
