Pages that link to "Item:Q5712454"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712454):
Displaying 18 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Capacitated domination problem (Q534769) (← links)
- An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
- Facility location with red-blue demands (Q1785285) (← links)
- An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties (Q2037976) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← 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)
- Capacitated Domination Problem (Q5387762) (← links)
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)