Hamiltonian location problems

DOI10.1016/0377-2217(83)90182-0MaRDI QIDQ1173005zbMATH OpenOpenAlexFDO

Authors G. Laporte, Yves Nobert, Paul Pelletier

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

zbMATH Keywords

heuristicsexact algorithmslogisticslocation-routingtravelling salesman problemconstraint relaxation procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Cites work

• scientific article; zbMATH DE number 3724247 (Why is no real title available?)
• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A Cutting Planes Algorithm for the m-Salesmen Problem
• A comparative study of heuristics for a two-level routing-location problem
• An exact algorithm for minimizing routing and operating costs in depot location
• Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
• Hamiltonian location problems
• Heuristic Methods for Location-Allocation Problems
• Lagerstandortoptimierung und Fuhrparkeinsatzplanung in der Konsumgüter-Industrie
• Matching, Euler tours and the Chinese postman
• Solution of a Large-Scale Traveling-Salesman Problem
• Using cutting planes to solve the symmetric Travelling Salesman problem

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
• 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
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons
• New path elimination constraints for multi-depot routing problems
• A hybrid genetic algorithm for the Hamiltonian p‐median problem
• The Hamiltonian p-median problem
• A particle swarm optimization algorithm with path relinking for the location routing problem
• Primal-dual schema and Lagrangian relaxation for the \(k\)-location-routing problem
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
• Hamiltonian location problems
• Distribution network design on the battlefield
• A branch-and-price algorithm for solving the Hamiltonian \(p\)-median 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)