IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v106y1998i2-3p659-675.html
   My bibliography  Save this article

An efficient tabu search approach for the 0-1 multidimensional knapsack problem

Author

Listed:
  • Hanafi, Said
  • Freville, Arnaud

Abstract

No abstract is available for this item.

Suggested Citation

  • Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
  • Handle: RePEc:eee:ejores:v:106:y:1998:i:2-3:p:659-675
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00296-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James H. Lorie & Leonard J. Savage, 1955. "Three Problems in Rationing Capital," The Journal of Business, University of Chicago Press, vol. 28, pages 229-229.
    2. Freville, A. & Plateau, G., 1986. "Heuristics and reduction methods for multiple constraints 0-1 linear programming problems," European Journal of Operational Research, Elsevier, vol. 24(2), pages 206-215, February.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. Egon Balas & Clarence H. Martin, 1980. "Pivot and Complement--A Heuristic for 0-1 Programming," Management Science, INFORMS, vol. 26(1), pages 86-96, January.
    5. P. C. Gilmore & R. E. Gomory, 1966. "The Theory and Computation of Knapsack Functions," Operations Research, INFORMS, vol. 14(6), pages 1045-1074, December.
    6. Clifford C. Petersen, 1967. "Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects," Management Science, INFORMS, vol. 13(9), pages 736-750, May.
    7. Charles E. Gearing & William W. Swart & Turgut Var, 1973. "Determining the Optimal Investment Policy for the Tourism Sector of a Developing Country," Management Science, INFORMS, vol. 20(4-Part-I), pages 487-497, December.
    8. Richard Bellman, 1957. "On a Dynamic Programming Approach to the Caterer Problem--I," Management Science, INFORMS, vol. 3(3), pages 270-278, April.
    9. Shizuo Senju & Yoshiaki Toyoda, 1968. "An Approach to Linear Programming with 0-1 Variables," Management Science, INFORMS, vol. 15(4), pages 196-207, December.
    10. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    11. Jae Sik Lee & Monique Guignard, 1988. "Note---An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems---A Parametric Approach," Management Science, INFORMS, vol. 34(3), pages 402-410, March.
    12. Fred Glover, 1995. "Tabu Thresholding: Improved Search by Nonmonotonic Trajectories," INFORMS Journal on Computing, INFORMS, vol. 7(4), pages 426-442, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    2. 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.
    3. Guillermo Cabrera-Guerrero & Carolina Lagos & Carolina Castañeda & Franklin Johnson & Fernando Paredes & Enrique Cabrera, 2017. "Parameter Tuning for Local-Search-Based Matheuristic Methods," Complexity, Hindawi, vol. 2017, pages 1-15, December.
    4. João Claro & Jorge Sousa, 2010. "A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem," Computational Optimization and Applications, Springer, vol. 46(3), pages 427-450, July.
    5. 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.
    6. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
    7. Blum, Christian & Ochoa, Gabriela, 2021. "A comparative analysis of two matheuristics by means of merged local optima networks," European Journal of Operational Research, Elsevier, vol. 290(1), pages 36-56.
    8. Balev, Stefan & Yanev, Nicola & Freville, Arnaud & Andonov, Rumen, 2008. "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 63-76, April.
    9. Al-Shihabi, Sameh, 2021. "A Novel Core-Based Optimization Framework for Binary Integer Programs- the Multidemand Multidimesional Knapsack Problem as a Test Problem," Operations Research Perspectives, Elsevier, vol. 8(C).
    10. Paola Cappanera & Marco Trubian, 2005. "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 82-98, February.
    11. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    12. Bahram Alidaee & Vijay P. Ramalingam & Haibo Wang & Bryan Kethley, 2018. "Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 269(1), pages 3-19, October.
    13. Uno, Takeshi & Katagiri, Hideki, 2008. "Single- and multi-objective defensive location problems on a network," European Journal of Operational Research, Elsevier, vol. 188(1), pages 76-84, July.
    14. 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.
    15. Fortin, Dominique & Tsevendorj, Ider, 2004. "Global optimization and multi knapsack: A percolation algorithm," European Journal of Operational Research, Elsevier, vol. 154(1), pages 46-56, April.
    16. 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.
    17. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
    18. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
    19. 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.

    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.
    1. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    2. Lokketangen, Arne & Glover, Fred, 1998. "Solving zero-one mixed integer programming problems using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 624-658, April.
    3. Balev, Stefan & Yanev, Nicola & Freville, Arnaud & Andonov, Rumen, 2008. "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 63-76, April.
    4. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
    5. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    6. Wilbaut, Christophe & Todosijevic, Raca & Hanafi, Saïd & Fréville, Arnaud, 2023. "Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 304(3), pages 901-911.
    7. Oliver Bastert & Benjamin Hummel & Sven de Vries, 2010. "A Generalized Wedelin Heuristic for Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 93-107, February.
    8. Woodruff, David L., 1998. "Proposals for chunking and tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 585-598, April.
    9. Kunikazu Yoda & András Prékopa, 2016. "Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 715-731, May.
    10. Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
    11. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    12. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2019. "Interdiction Games and Monotonicity, with Application to Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 390-410, April.
    13. Lin, Feng-Tse & Yao, Jing-Shing, 2001. "Using fuzzy numbers in knapsack problems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 158-176, November.
    14. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    15. 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.
    16. Kulturel-Konak, Sadan, 2012. "A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays," European Journal of Operational Research, Elsevier, vol. 223(3), pages 614-625.
    17. Rex K. Kincaid & Keith E. Laba & Sharon L. Padula, 1997. "Quelling Cabin Noise in Turboprop Aircraft via Active Control," Journal of Combinatorial Optimization, Springer, vol. 1(3), pages 229-250, October.
    18. Hanafi, Saïd & Wang, Yang & Glover, Fred & Yang, Wei & Hennig, Rick, 2023. "Tabu search exploiting local optimality in binary optimization," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1037-1055.
    19. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
    20. Roni, Mohammad S. & Eksioglu, Sandra D. & Jin, Mingzhou & Mamun, Saleh, 2016. "A hybrid inventory policy with split delivery under regular and surge demand," International Journal of Production Economics, Elsevier, vol. 172(C), pages 126-136.

    More about this item

    Statistics

    Access and download statistics

    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:106:y:1998:i:2-3:p:659-675. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.