A “reduce and solve” approach for the multiple-choice multidimensional knapsack problem
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2014.05.025
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
- Abdelkader Sbihi, 2007. "A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 13(4), pages 337-351, May.
- Yannick Vimont & Sylvain Boussier & Michel Vasquez, 2008. "Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 165-178, February.
- Pisinger, David, 2001. "Budgeting with bounded multiple-choice constraints," European Journal of Operational Research, Elsevier, vol. 129(3), pages 471-480, March.
- Jakob Puchinger & Günther R. Raidl & Ulrich Pferschy, 2010. "The Multidimensional Knapsack Problem: Structure and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 250-265, May.
- Wilbaut, Christophe & Hanafi, Said, 2009. "New convergent heuristics for 0-1 mixed integer programming," European Journal of Operational Research, Elsevier, vol. 195(1), pages 62-74, May.
- Nawal Cherfi & Mhand Hifi, 2009. "Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 5(1), pages 89-109.
- Vasquez, Michel & Vimont, Yannick, 2005. "Improved results on the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 70-81, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Diaz, Juan Esteban & Handl, Julia & Xu, Dong-Ling, 2018. "Integrating meta-heuristics, simulation and exact techniques for production planning of a failure-prone manufacturing system," European Journal of Operational Research, Elsevier, vol. 266(3), pages 976-989.
- Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel, 2018. "A multi-criteria approach to approximate solution of multiple-choice knapsack problem," Computational Optimization and Applications, Springer, vol. 70(3), pages 889-910, July.
- Diallo, Claver & Venkatadri, Uday & Khatab, Abdelhakim & Liu, Zhuojun, 2018. "Optimal selective maintenance decisions for large serial k-out-of-n: G systems under imperfect maintenance," Reliability Engineering and System Safety, Elsevier, vol. 175(C), pages 234-245.
- Gao, Chao & Lu, Guanzhou & Yao, Xin & Li, Jinlong, 2017. "An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 260(1), pages 1-11.
- Renata Mansini & Roberto Zanotti, 2020. "A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1061-1079, October.
- Caserta, Marco & Voß, Stefan, 2019. "The robust multiple-choice multidimensional knapsack problem," Omega, Elsevier, vol. 86(C), pages 16-27.
- Lamanna, Leonardo & Mansini, Renata & Zanotti, Roberto, 2022. "A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 53-65.
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.- Renata Mansini & M. Grazia Speranza, 2012. "CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 399-415, August.
- Gao, Chao & Lu, Guanzhou & Yao, Xin & Li, Jinlong, 2017. "An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 260(1), pages 1-11.
- Setzer, Thomas & Blanc, Sebastian M., 2020. "Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems," European Journal of Operational Research, Elsevier, vol. 282(1), pages 58-70.
- Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
- Yuji Nakagawa & Ross J. W. James & César Rego & Chanaka Edirisinghe, 2014. "Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models," Management Science, INFORMS, vol. 60(3), pages 695-707, March.
- Jaeyoung Yang & Yong-Hyuk Kim & Yourim Yoon, 2022. "A Memetic Algorithm with a Novel Repair Heuristic for the Multiple-Choice Multidimensional Knapsack Problem," Mathematics, MDPI, vol. 10(4), pages 1-15, February.
- Saïd Hanafi & Christophe Wilbaut, 2011. "Improved convergent heuristics for the 0-1 multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 183(1), pages 125-142, March.
- Wilbaut, Christophe & Salhi, Saïd & Hanafi, Saïd, 2009. "An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 199(2), pages 339-348, December.
- Yanhong Feng & Hongmei Wang & Zhaoquan Cai & Mingliang Li & Xi Li, 2023. "Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems," Mathematics, MDPI, vol. 11(8), pages 1-28, April.
- Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel, 2018. "A multi-criteria approach to approximate solution of multiple-choice knapsack problem," Computational Optimization and Applications, Springer, vol. 70(3), pages 889-910, July.
- Caserta, Marco & Voß, Stefan, 2019. "The robust multiple-choice multidimensional knapsack problem," Omega, Elsevier, vol. 86(C), pages 16-27.
- Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong, 2019. "Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 35-48.
- Renata Mansini & Roberto Zanotti, 2020. "A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1061-1079, October.
- Sbihi, Abdelkader, 2010.
"A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem,"
European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
- Abdelkader Sbihi, 2009. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," Post-Print hal-00644088, HAL.
- Jakob Puchinger & Günther R. Raidl & Ulrich Pferschy, 2010. "The Multidimensional Knapsack Problem: Structure and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 250-265, May.
- Yannick Vimont & Sylvain Boussier & Michel Vasquez, 2008. "Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 165-178, February.
- Sylvain Barde, 2015. "Back to the Future: Economic Self-Organisation and Maximum Entropy Prediction," Computational Economics, Springer;Society for Computational Economics, vol. 45(2), pages 337-358, February.
- Sylvain Barde, 2011.
"Ignorance is bliss: rationality, information and equilibrium,"
Studies in Economics
1103, School of Economics, University of Kent.
- Sylvain Barde, 2011. "Ignorance is bliss: rationality, information and equilibrium," Working Papers hal-01069478, HAL.
- Sylvain Barde, 2011. "Ignorance is bliss: rationality, information and equilibrium," SciencePo Working papers Main hal-01069478, HAL.
- Sylvain Barde, 2011. "Ignorance is bliss: rationality, information and equilibrium," Documents de Travail de l'OFCE 2011-04, Observatoire Francais des Conjonctures Economiques (OFCE).
- Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
- Lowry, Michael B., 2010. "Using optimization to program projects in the era of communicative rationality," Transport Policy, Elsevier, vol. 17(2), pages 94-101, March.
More about this item
Keywords
Knapsack; Fixing heuristics; Linear relaxation; Hybridization;All these keywords.
Statistics
Access and download statisticsCorrections
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:239:y:2014:i:2:p:313-322. 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.