Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Esther M. ArkinRefael HassinShlomi RubinsteinMaxim SviridenkoPublished in: Algorithmica (2004)
Keyphrases
- packing problem
- fixed charge
- integer programming
- transportation problem
- bin packing
- facility location
- taylor series
- single source
- np hard
- routing problem
- network design
- network design problem
- lot sizing
- transportation networks
- vehicle routing problem
- vector space
- feature vectors
- mixed integer linear program
- dc programming
- cutting stock
- multi source
- multi item
- network flow problem