Traveling Salesman Facility Location Problems

DOI10.1287/TRSC.23.3.184MaRDI QIDQ4732287zbMATH OpenOpenAlexFDO

Authors Dimitris Bertsimas

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

zbMATH Keywords

networksfacility locationtraveling salesmanworst-case boundpolynomial time heuristics

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05)

Recommendations

• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• The Capacitated Traveling Salesman Location Problem
• Further results on the probabilistic traveling salesman problem
• The Traveling Salesman Location Problem on Stochastic Networks
• Heuristics and bounds for the travelling salesman location problem on the plane

Cited in

(22)

• A taxonomical analysis, current methods and objectives on location-routing problems
• Vertex-Uncertainty in Graph-Problems
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands
• A survey on combinatorial optimization in dynamic environments
• Location-routing: issues, models and methods
• The transfer point location problem
• Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse
• Probabilistic graph-coloring in bipartite and split graphs
• Heuristics and bounds for the travelling salesman location problem on the plane
• The facility and transfer points location problem
• Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• scientific article; zbMATH DE number 4097100 (Why is no real title available?)
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
• Distribution network design on the battlefield
• The probabilistic minimum dominating set problem
• On the probabilistic minimum coloring and minimum k-coloring
• On the probabilistic min spanning tree problem
• The probabilistic uncapacitated open vehicle routing location problem
• One-facility location with rectilinear tour distances
• Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers

This page was built for publication: Traveling Salesman Facility Location Problems

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