Traveling Salesman Facility Location Problems
From MaRDI portal
Publication:4732287
DOI10.1287/trsc.23.3.184zbMath0682.90039OpenAlexW2027167948MaRDI QIDQ4732287
Publication date: 1989
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.23.3.184
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)
Related Items (16)
A hybrid clonal selection algorithm for the location routing problem with stochastic demands ⋮ Distribution network design on the battlefield ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Location-routing: issues, models and methods ⋮ The transfer point location problem ⋮ Probabilistic combinatorial optimization problems on graphs: A new domain in operational research ⋮ The probabilistic minimum dominating set problem ⋮ On the probabilistic min spanning tree problem ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ Vertex-Uncertainty in Graph-Problems ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
This page was built for publication: Traveling Salesman Facility Location Problems
