Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
DOI10.1016/j.ejor.2018.12.041zbMath1430.90371OpenAlexW2907589369MaRDI QIDQ1728472
Daniel Santos, Luís Gouveia, Tolga Bektaş
Publication date: 25 February 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.041
branch-and-cut algorithmcombinatorial optimizationHamiltonian \(p\)-medianmulti-cut inequalitiesmulti-depot routing
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Cites Work
- Unnamed Item
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- Multi-depot multiple TSP: a polyhedral study and computational results
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- The Hamiltonian p-median problem
- Cliques, holes and the vertex coloring polytope
- Hamiltonian location problems
- A branch-and-cut algorithm for vehicle routing problems
- The Hamiltonian \(p\)-median problem
- A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A comparison of several models for the hamiltonian p‐median problem
- Solution of a Large-Scale Traveling-Salesman Problem
This page was built for publication: Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
