Probabilistic a priori routing-location problems

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199412)41:7<973::AID-NAV3220410709>3.0.CO;2-H" /><973::AID-NAV3220410709>3.0.CO;2-H 10.1002/1520-6750(199412)41:7<973::AID-NAV3220410709>3.0.CO;2-HzbMath0830.90086OpenAlexW2000181075MaRDI QIDQ4319224

Igor Averbakh, David Simchi-Levi, Oded Berman

Publication date: 30 January 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199412)41:7<973::aid-nav3220410709>3.0.co;2-h

zbMATH Keywords

networkdepot locationbasic sequence determinationlower bound calculationsprobabilistic routing-location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (14)

Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ Distribution network design on the battlefield ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Location-routing: issues, models and methods ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ Multi-depot traveling salesmen location problems on networks with special structure ⋮ The probabilistic minimum dominating set problem ⋮ On the probabilistic min spanning tree problem ⋮ Location‐routing problem: a classification of recent research ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ Vertex-Uncertainty in Graph-Problems ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

Cites Work

• Unnamed Item

This page was built for publication: Probabilistic a priori routing-location problems