Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
From MaRDI portal
Publication:323162
DOI10.1016/j.ejor.2016.02.012zbMath1346.90701OpenAlexW2262003201MaRDI QIDQ323162
Güneş Erdoğan, Antonio M. Rodríguez-Chía, Gilbert Laporte
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.012
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Compact formulations for multi-depot routing problems: theoretical and computational comparisons, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, Node based compact formulations for the Hamiltonian p‐median problem, A hybrid genetic algorithm for the Hamiltonian p‐median problem, Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm, A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems
Uses Software
Cites Work
- The Hamiltonian p-median problem
- Hamiltonian location problems
- The Hamiltonian \(p\)-median problem
- A new variant of a vehicle routing problem: Lower and upper bounds
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Algorithms for the design of network topologies with balanced disjoint rings
- New Models for and Numerical Tests of the Hamiltonian p-Median Problem
- TSPLIB—A Traveling Salesman Problem Library
- Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
- A comparison of several models for the hamiltonian p‐median problem
- Network Design Using Cut Inequalities
- A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- Unnamed Item
