Approximation Algorithms for Problems Combining Facility Location and Network Design
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086924
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
Cited in
(30)- Approximation algorithms for prize-collecting capacitated network design problems
- Approximating airports and railways
- Construction Line Algorithms for the Connection Location-Allocation Problem
- Local search based approximation algorithms for two-stage stochastic location problems
- scientific article; zbMATH DE number 1932373 (Why is no real title available?)
- An efficient approximation algorithm for the extension facility location problem on torus internetwork topology
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Designing optimal global supply chains at Dow AgroSciences
- Algorithms and extended formulations for one and two facility network design
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Exact approaches for designing multifacility buy-at-bulk networks
- scientific article; zbMATH DE number 2086924 (Why is no real title available?)
- Approximation algorithms for the airport and railway problem
- General network design: a unified view of combined location and network design problems
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- scientific article; zbMATH DE number 2159272 (Why is no real title available?)
- Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems
- Improved algorithms for joint optimization of facility locations and network connections
- scientific article; zbMATH DE number 1509501 (Why is no real title available?)
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- Technical note: The competitive facility location problem in a duopoly: advances beyond trees
- A review of extensive facility location in networks
- On worst-case aggregation analysis for network location problems
- Bifactor approximation for location routing with vehicle and facility capacities
- Approximation algorithms for the airport and railway problem
- Connected facility location via random facility sampling and core detouring
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
This page was built for publication: Approximation Algorithms for Problems Combining Facility Location and Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391962)
