Pages that link to "Item:Q1332940"
From MaRDI portal
The following pages link to Approximation algorithms for the capacitated plant allocation problem (Q1332940):
Displaying 8 items.
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259) (← links)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
- Approximation Algorithms for Generalized Plant Location (Q2849962) (← links)
- Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions (Q5422020) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)