An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
- Zeghal, F.M. & Minoux, M., 2006. "Modeling and solving a Crew Assignment Problem in air transportation," European Journal of Operational Research, Elsevier, vol. 175(1), pages 187-209, November.
- Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
- El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
- Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
- Dipesh J. Patel & Rajan Batta & Rakesh Nagi, 2005. "Clustering Sensors in Wireless Ad Hoc Networks Operating in a Threat Environment," Operations Research, INFORMS, vol. 53(3), pages 432-442, June.
- Les Proll & Barbara Smith, 1998. "Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 265-275, August.
- Hansen, Pierre & Jaumard, Brigitte & de Aragao, Marcus Poggi, 1998. "Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 671-683, August.
- Marcelo Prais & Celso C. Ribeiro, 2000. "Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 164-176, August.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:41:y:1989:i:2:p:232-239. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.