Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract).
David ZahrádkaAnton AndreychukMiroslav KulichKonstantin S. YakovlevPublished in: SOCS (2022)
Keyphrases
- extended abstract
- lower and upper bounds
- multi item
- multi agent
- valid inequalities
- lower bound
- upper bound
- inventory systems
- lot sizing
- lagrangian relaxation
- production cost
- multi agent systems
- reinforcement learning
- combinatorial auctions
- lost sales
- stochastic inventory
- search algorithm
- lead time
- branch and bound algorithm
- mathematical model
- np hard