Node based compact formulations for the Hamiltonian p‐median problem
From MaRDI portal
Publication:6180025
DOI10.1002/net.22163OpenAlexW4380077280MaRDI QIDQ6180025
Unnamed Author, Luís Gouveia, Michele Barbato, Pierre Pesneau
Publication date: 18 January 2024
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22163
combinatorial optimizationinteger linear programmingvalid inequalitiespolyhedral theorylocation routingHamiltonian \(p\)-median problem
Cites Work
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- Multi-depot multiple TSP: a polyhedral study and computational results
- The Hamiltonian p-median problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The Hamiltonian \(p\)-median problem
- A new variant of a vehicle routing problem: Lower and upper bounds
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
- New Models for and Numerical Tests of the Hamiltonian p-Median Problem
- A New Formulation for the Travelling Salesman Problem
- Perfect triangle-free 2-matchings
- TSPLIB—A Traveling Salesman Problem Library
- A comparison of several models for the hamiltonian p‐median problem
This page was built for publication: Node based compact formulations for the Hamiltonian p‐median problem
