Pages that link to "Item:Q3391962"
From MaRDI portal
The following pages link to Approximation Algorithms for Problems Combining Facility Location and Network Design (Q3391962):
Displayed 16 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- Designing optimal global supply chains at Dow AgroSciences (Q2393476) (← links)
- A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems (Q2971170) (← links)
- Approximating Airports and Railways (Q3304099) (← links)
- Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees (Q4971394) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- Approximation algorithms for prize-collecting capacitated network design problems (Q6111480) (← links)