A compact formulation of the ring loading problem with integer demand splitting

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 388
  • Download : 0
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
DOI
10.1016/j.orl.2009.01.003
URI
http://hdl.handle.net/10203/93463
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 webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0