Pages that link to "Item:Q662296"

The following pages link to LP-based approximation algorithms for capacitated facility location (Q662296):

Displaying 21 items.

• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• The stochastic capacitated branch restructuring problem (Q512982) (← links)
• The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
• Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
• An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties (Q2037976) (← links)
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• A note on LP-based approximation algorithms for capacitated facility location problem (Q2172603) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
• A game theoretic model for the optimal location of integrated air defense system missile batteries (Q2830945) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location. (Q2969625) (← links)
• Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (Q3115938) (← links)
• The Capacitated p-facility Location Problem on the Real Line (Q3146129) (← links)
• A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions (Q4995059) (← links)
• Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• Integer Programming and Combinatorial Optimization (Q5712454) (← links)