Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
type: Item
instance of: scholarly article
title: Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
zbMATH Open document ID: 1430.90371
author: Tolga Bektaş
author: Luis Gouveia
author: Daniel Santos
published in: European Journal of Operational Research
publication date: 2019-02-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7029250
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: Hamiltonian \(p\)-median
zbMATH Keywords: multi-cut inequalities
zbMATH Keywords: multi-depot routing
zbMATH Keywords: branch-and-cut algorithm
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.12.041
OpenAlex ID: W2907589369
cites work: A branch-and-cut algorithm for vehicle routing problems
cites work: Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: Multi-depot multiple TSP: a polyhedral study and computational results
cites work: The Hamiltonian p-median problem
cites work: Cliques, holes and the vertex coloring polytope
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: The Hamiltonian \(p\)-median problem
cites work: A comparison of several models for the hamiltonian p‐median problem
cites work: Hamiltonian location problems
cites work: A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q5422825
DOI: 10.1016/J.EJOR.2018.12.041
description: scientific article; zbMATH DE number 7029250