The Hamiltonian \(p\)-median problem
From MaRDI portal
Publication:1578475
zbMath0960.90054MaRDI QIDQ1578475
Publication date: 14 September 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120934
Related Items (7)
Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem ⋮ A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem ⋮ 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 ⋮ Algorithms for the design of network topologies with balanced disjoint rings ⋮ A new variant of a vehicle routing problem: Lower and upper bounds
This page was built for publication: The Hamiltonian \(p\)-median problem
