A compact formulation of the ring loading problem with integer demand splitting
The ring loading problem with integer demand splitting is that of routing kappa traffic requirements on an undirected ring network. We present a compact polyhedral description of the set of feasible solutions to the problem, whose number of variables and constraints is O(kappa). (C) 2009 Elsevier B.V. All rights reserved.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 2009-03
- Language
- English
- Article Type
- Article
- Citation
OPERATIONS RESEARCH LETTERS, v.37, pp.111 - 113
- ISSN
- 0167-6377
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 2 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.