Exact and heuristic algorithms for the Hamiltonian p-median problem

DOI10.1016/J.EJOR.2016.02.012MaRDI QIDQ323162zbMATH OpenOpenAlexFDO

Authors Güneş Erdogăn, G. Laporte, Antonio M. Rodríguez-Chía

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

zbMATH Keywords

branch-and-cutHamiltonianmetaheuristic\(p\)-median

Mathematics Subject Classification ID

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)

Recommendations

• A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
• New models for and numerical tests of the Hamiltonian \(p\)-median problem
• The Hamiltonian p-median problem
• scientific article; zbMATH DE number 2162233
• A comparison of several models for the Hamiltonian \(p\)-median problem

Cites work

• A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
• A comparison of several models for the Hamiltonian \(p\)-median problem
• A new formulation of 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
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
• Hamiltonian location problems
• Network Design Using Cut Inequalities
• New models for and numerical tests of the Hamiltonian \(p\)-median problem
• Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
• TSPLIB—A Traveling Salesman Problem Library
• The Hamiltonian \(p\)-median problem
• The Hamiltonian p-median problem

Cited in

(15)

• scientific article; zbMATH DE number 2162233 (Why is no real title available?)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
• The Hamiltonian p-median problem
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons
• A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
• A comparison of several models for the Hamiltonian \(p\)-median problem
• New models for and numerical tests of the Hamiltonian \(p\)-median problem
• Ant colony optimization techniques for the Hamiltonian p-median problem
• 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 new heuristic approach for the P-median problem
• A hybrid genetic algorithm for the Hamiltonian p‐median problem
• The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms
• A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems
• A dynamic programming heuristic for the \(P\)-median problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem

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