Pages that link to "Item:Q3929508"
From MaRDI portal
The following pages link to Heuristics for the fixed cost median problem (Q3929508):
Displaying 41 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- Lagrangian relaxations for multiple network alignment (Q1741341) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Minimizing energies with hierarchical costs (Q1931618) (← links)
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
- Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
- Erratum to: ``Internet shopping with price-sensitive discounts'' (Q2257102) (← links)
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
- Study and development of the DTD generation system for XML documents (Q2432981) (← links)
- The approximation gap for the metric facility location problem is not yet closed (Q2467481) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Dynamic Sum-Radii Clustering (Q2980896) (← links)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910) (← links)
- A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION (Q3173932) (← links)
- Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta (Q4022744) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- (Q4638107) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5009486) (← links)
- (Q5075771) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Capacitated location-allocation problems on a line (Q5959397) (← links)
- Improved lower bound for differentially private facility location (Q6602319) (← links)