Pages that link to "Item:Q5712454"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712454):
Displayed 10 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)
- 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)
- 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)