GRASP for set packing problems
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.
References listed on IDEAS
- Peter J. Zwaneveld & Leo G. Kroon & H. Edwin Romeijn & Marc Salomon & Stéphane Dauzère-Pérès & Stan P. M. Van Hoesel & Harrie W. Ambergen, 1996. "Routing Trains Through Railway Stations: Model Formulation and Algorithms," Transportation Science, INFORMS, vol. 30(3), pages 181-194, August.
- Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
- 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.
- Rossi, Fabrizio & Smriglio, Stefano, 2001. "A set packing model for the ground holding problem in congested networks," European Journal of Operational Research, Elsevier, vol. 131(2), pages 400-416, June.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009.
"Non-linear anonymous pricing combinatorial auctions,"
European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 598, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Non-linear anonymous pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 625, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jörnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Discussion Papers 2005/6, Norwegian School of Economics, Department of Business and Management Science.
- Qinghua Wu & Jin-Kao Hao & Fred Glover, 2012. "Multi-neighborhood tabu search for the maximum weight clique problem," Annals of Operations Research, Springer, vol. 196(1), pages 611-634, July.
- A Drexl & K Jørnsten, 2007.
"Reflections about pseudo-dual prices in combinatorial auctions,"
Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1652-1659, December.
- Drexl, Andreas & Jörnsten, Kurt, 2005. "Reflections about pseudo-dual prices in combinatorial auctions," Discussion Papers 2005/1, Norwegian School of Economics, Department of Business and Management Science.
- Drexl, Andreas & Jörnsten, Kurt, 2005. "Reflections about pseudo-dual prices in combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 590, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Pellegrini, Paola & Rodriguez, Joaquin, 2013. "Single European Sky and Single European Railway Area: A system level analysis of air and rail transportation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 57(C), pages 64-86.
- Richard Lusby & Jesper Larsen & David Ryan & Matthias Ehrgott, 2011. "Routing Trains Through Railway Junctions: A New Set-Packing Approach," Transportation Science, INFORMS, vol. 45(2), pages 228-245, May.
- Delorme, Xavier & Gandibleux, Xavier & Rodriguez, Joaquín, 2009. "Stability evaluation of a railway timetable at station level," European Journal of Operational Research, Elsevier, vol. 195(3), pages 780-790, June.
- R Alvarez-Valdes & F Parreño & J M Tamarit, 2005. "A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 414-425, April.
- de Souza, Mauricio C. & de Carvalho, Carlos R.V. & Brizon, Wellington B., 2008. "Packing items to feed assembly lines," European Journal of Operational Research, Elsevier, vol. 184(2), pages 480-489, January.
- Zhang, Jiamin, 2015. "Analysis on line capacity usage for China high speed railway with optimization approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 336-349.
- Andres, Carlos & Miralles, Cristobal & Pastor, Rafael, 2008. "Balancing and scheduling tasks in assembly lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1212-1223, June.
- Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
- Alidaee, Bahram & Kochenberger, Gary & Lewis, Karen & Lewis, Mark & Wang, Haibo, 2008. "A new approach for modeling and solving set packing problems," European Journal of Operational Research, Elsevier, vol. 186(2), pages 504-512, April.
- Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
- Wang, Yang & Lü, Zhipeng & Glover, Fred & Hao, Jin-Kao, 2012. "Path relinking for unconstrained binary quadratic programming," European Journal of Operational Research, Elsevier, vol. 223(3), pages 595-604.
- F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
- Bi, Mingkai & He, Shiwei & Xu, Wangtu (Ato), 2019. "Express delivery with high-speed railway: Definitely feasible or just a publicity stunt," Transportation Research Part A: Policy and Practice, Elsevier, vol. 120(C), pages 165-187.
- Delorme, Xavier & Gandibleux, Xavier & Degoutin, Fabien, 2010. "Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 206-217, July.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
- Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
- Wang, Dian & D’Ariano, Andrea & Zhao, Jun & Zhong, Qingwei & Peng, Qiyuan, 2022. "Integrated rolling stock deadhead routing and timetabling in urban rail transit lines," European Journal of Operational Research, Elsevier, vol. 298(2), pages 526-559.
- Barry B. Barrios & Quim Castellà & Angel A. Juan & Manuel Mateo, 2015. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
- Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
- Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
- Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
- F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
- Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
- Jingliu Xu & Zhimei Wang & Shangjun Yao & Jiarong Xue, 2022. "Train Operations Organization in High-Speed Railway Station Considering Variable Configuration," Sustainability, MDPI, vol. 14(4), pages 1-17, February.
- Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
- Bard, Jonathan F. & Mohan, Dinesh Natarajan, 2008. "Reallocating arrival slots during a ground delay program," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 113-134, February.
- Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006.
"A hybrid scatter search/electromagnetism meta-heuristic for project scheduling,"
European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
- Dieter Debels & Bert de Reyck & Roel Leus & Mario Vanhoucke, 2003. "A hybrid scatter search / electromagnetism meta-heuristic for project scheduling," Vlerick Leuven Gent Management School Working Paper Series 2003-25, Vlerick Leuven Gent Management School.
- D. Debels & B. De Reyck & R. Leus & M. Vanhoucke, 2004. "A Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/237, Ghent University, Faculty of Economics and Business Administration.
- Arno Sprecher, 2000. "Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements," Management Science, INFORMS, vol. 46(5), pages 710-723, May.
- Dennis Huisman & Leo G. Kroon & Ramon M. Lentink & Michiel J. C. M. Vromans, 2005.
"Operations Research in passenger railway transportation,"
Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 59(4), pages 467-497, November.
- Huisman, D. & Kroon, L.G. & Lentink, R.M. & Vromans, M.J.C.M., 2005. "Operations Research in Passenger Railway Transportation," ERIM Report Series Research in Management ERS-2005-023-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Huisman, D. & Kroon, L.G. & Lentink, R.M. & Vromans, M.J.C.M., 2005. "Operations research in passenger railway transportation," Econometric Institute Research Papers EI 2005-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Sprecher, Arno, 1999. "Network decomposition techniques for resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 505, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Richard Lusby & Jesper Larsen & David Ryan & Matthias Ehrgott, 2011. "Routing Trains Through Railway Junctions: A New Set-Packing Approach," Transportation Science, INFORMS, vol. 45(2), pages 228-245, May.
- Lars Magnus Hvattum & Arne Løkketangen & Gilbert Laporte, 2009. "Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 268-285, May.
- Wang, Dian & D’Ariano, Andrea & Zhao, Jun & Zhan, Shuguang & Peng, Qiyuan, 2024. "Joint rolling stock rotation planning and depot deadhead scheduling in complicated urban rail transit lines," European Journal of Operational Research, Elsevier, vol. 314(2), pages 665-684.
- Marco Antonio Boschetti & Vittorio Maniezzo, 2024. "Contemporary approaches in matheuristics an updated survey," Annals of Operations Research, Springer, vol. 343(2), pages 663-700, December.
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:153:y:2004:i:3:p:564-580. 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.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.