Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Esther M. ArkinRefael HassinShlomi RubinsteinMaxim SviridenkoPublished in: SWAT (2002)
Keyphrases
- transportation problem
- fixed charge
- packing problem
- integer programming
- bin packing
- np hard
- network design problem
- cutting stock
- lagrangian relaxation
- production planning
- column generation
- linear programming
- cutting plane
- approximation algorithms
- vector space
- feature vectors
- dc programming
- optimal solution
- objective function
- network flow
- lot sizing