Multicommodity facility location

MaRDI QIDQ5501277zbMATH OpenFDO

Authors R. Ravi, Amitabh Sinha

Publication date 3 August 2015

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximation algorithms for multicommodity facility location problems
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• Non-metric Multicommodity and Multilevel Facility Location
• scientific article; zbMATH DE number 1559542
• Multicommodity facility location under group Steiner access cost

Cited in

(8)

• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• Multicommodity facility location under group Steiner access cost
• Approximation algorithms for multicommodity facility location problems
• Non-metric Multicommodity and Multilevel Facility Location
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• Algorithms - ESA 2003
• Fault-tolerant priority facility location problem
• Approximation algorithms for the priority facility location problem with penalties

This page was built for publication: Multicommodity facility location

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