Polymatroid-based capacitated packing of branchings.
Tatsuya MatsuokaZoltán SzigetiPublished in: Discret. Appl. Math. (2019)
Keyphrases
- lot sizing
- multi item
- routing problem
- joint replenishment
- single source
- packing problem
- multi commodity
- facility location
- network design problem
- np hard
- vehicle routing problem
- multi source
- multi period
- facility location problem
- capacity constraints
- production inventory
- branch and bound
- network flow problem
- heuristic solution
- network design
- approximation algorithms
- search algorithm
- max min
- fixed charge
- wireless sensor networks