The Hamiltonian p-median problem: polyhedral results and branch-and-cut algorithms

DOI10.1016/J.EJOR.2024.02.032MaRDI QIDQ6565387FDOQ6565387

Authors: Michele Barbato, Luis Gouveia 

Publication date: 2 July 2024

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationpolyhedral studybranch-and-cut algorithmvalid inequalityHamiltonian \(p\)-median problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Title not available (Why is that?)
• The Hamiltonian \(p\)-median problem
• A new variant of a vehicle routing problem: Lower and upper bounds
• New models for and numerical tests of the Hamiltonian \(p\)-median problem
• Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
• A comparison of several models for the Hamiltonian \(p\)-median problem
• The Hamiltonian p-median problem
• Multi-depot multiple TSP: a polyhedral study and computational results
• Perfect triangle-free 2-matchings
• Integer Programming
• A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
• Hard to solve instances of the Euclidean traveling salesman problem
• Local search inequalities
• Submodular minimization under congruency constraints
• New path elimination constraints for multi-depot routing problems

This page was built for publication: The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565387)