A comparison of several models for the hamiltonian p‐median problem

DOI10.1002/net.21550zbMath1390.90585OpenAlexW2072442357MaRDI QIDQ4642484

Adam Wojciechowski, Luís Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Stefan Gollowitzer

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21550

zbMATH Keywords

graphstravelling salesman problemcycle covermathematical programming models

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem ⋮ 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 ⋮ 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 ⋮ Multiple depot ring star problem: a polyhedral study and an exact algorithm

This page was built for publication: A comparison of several models for the hamiltonian p‐median problem