IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this article

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

  • Hanafi, Said
  • Freville, Arnaud
Registered author(s):

    No abstract is available for this item.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    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 look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 106 (1998)
    Issue (Month): 2-3 (April)
    Pages: 659-675

    as
    in new window

    Handle: RePEc:eee:ejores:v:106:y:1998:i:2-3:p:659-675
    Contact details of provider: Web page: http://www.elsevier.com/locate/eor

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. Shizuo Senju & Yoshiaki Toyoda, 1968. "An Approach to Linear Programming with 0-1 Variables," Management Science, INFORMS, vol. 15(4), pages B196-B207, December.
    2. 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.
    3. 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.
    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. 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.
    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. Richard Bellman, 1957. "On a Dynamic Programming Approach to the Caterer Problem--I," Management Science, INFORMS, vol. 3(3), pages 270-278, April.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.