Hamiltonian location problems
DOI10.1016/0377-2217(83)90182-0zbMATH Open0502.90021OpenAlexW2025926043MaRDI QIDQ1173005FDOQ1173005
G. Laporte, Paul Pelletier, Yves Nobert
Publication date: 1983
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(83)90182-0
heuristicsexact algorithmslogisticslocation-routingtravelling salesman problemconstraint relaxation procedure
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Cites Work
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- Matching, Euler tours and the Chinese postman
- Solution of a Large-Scale Traveling-Salesman Problem
- An exact algorithm for minimizing routing and operating costs in depot location
- Heuristic Methods for Location-Allocation Problems
- Title not available (Why is that?)
- A comparative study of heuristics for a two-level routing-location problem
- Hamiltonian location problems
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Title not available (Why is that?)
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Lagerstandortoptimierung und Fuhrparkeinsatzplanung in der Konsumgüter-Industrie
- Title not available (Why is that?)
Cited In (26)
- Approximating minimum-cost graph problems with spanning tree edges
- A taxonomical analysis, current methods and objectives on location-routing problems
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
- Facility location models for distribution system design
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Location-routing: issues, models and methods
- A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
- Vehicle routing considerations in distribution system design
- Combined location-routing problems: A synthesis and future research directions
- Distribution network design: New problems and related models
- A compact model and tight bounds for a combined location-routing problem
- Designing radio-mobile access networks based on synchronous digital hierarchy rings
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Approximation algorithms for group prize-collecting and location-routing problems
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- New path elimination constraints for multi-depot routing problems
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- A hybrid genetic algorithm for the Hamiltonian p‐median problem
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- A particle swarm optimization algorithm with path relinking for the location routing problem
- The Hamiltonian p-median problem
- Hamiltonian location problems
- Distribution network design on the battlefield
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem
This page was built for publication: Hamiltonian location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173005)
