IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v139y2005i1p353-37310.1007-s10479-005-3454-x.html
   My bibliography  Save this article

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual

Author

Listed:
  • Babacar Thiongane
  • Anass Nagih
  • Gérard Plateau

Abstract

This paper deals with a new algorithm for a 0-1 bidimensional knapsack Lagrangean dual which relaxes one of the two constraints. Classical iterative algorithms generate a sequence of multipliers which converges to an optimal one. In this way, these methods generate a sequence of 0-1 one-dimensional knapsack instances. Generally, the procedure for solving each instance is considered as a black box. We propose to design a new iterative scheme in which the computation of the step size takes into account the algorithmic efficiency of each instance. Our adapted step size iterative algorithm is compared favorably with several other algorithms for the 0-1 biknapsack Lagrangean dual over difficult instances for CPLEX 7.0. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
    • Handle: RePEc:spr:annopr:v:139:y:2005:i:1:p:353-373:10.1007/s10479-005-3454-x
    DOI: 10.1007/s10479-005-3454-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-3454-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-3454-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Gary M. Roodman, 1974. "Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(4), pages 595-607, December.
    2. Loukakis, E. & Muhlemann, A. P., 1984. "Parameterisation algorithms for the integer linear programs in binary variables," European Journal of Operational Research, Elsevier, vol. 17(1), pages 104-115, July.
    3. A. M. Geoffrion & R. Nauss, 1977. "Exceptional Paper--Parametric and Postoptimality Analysis in Integer Linear Programming," Management Science, INFORMS, vol. 23(5), pages 453-466, January.
    4. Jenkins, Larry, 1987. "Parametric-objective integer programming using knapsack facets and Gomory cutting planes," European Journal of Operational Research, Elsevier, vol. 31(1), pages 102-109, July.
    5. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    6. Freville, Arnaud & Plateau, Gerard, 1993. "An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 68(3), pages 413-421, August.
    7. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
    8. Crema, Alejandro, 2000. "An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function," European Journal of Operational Research, Elsevier, vol. 125(1), pages 18-24, August.
    9. Linus Schrage & Laurence Wolsey, 1985. "Sensitivity Analysis for Branch and Bound Integer Programming," Operations Research, INFORMS, vol. 33(5), pages 1008-1023, October.
    10. Christopher J. Piper & Andris A. Zoltners, 1976. "Some Easy Postoptimality Analysis for Zero-One Programming," Management Science, INFORMS, vol. 22(7), pages 759-765, March.
    11. Crema, Alejandro, 2002. "The multiparametric 0-1-integer linear programming problem: A unified approach," European Journal of Operational Research, Elsevier, vol. 139(3), pages 511-520, June.
    Full references (including those not matched with items on IDEAS)

    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. Tcha, Dong-wan & Myung, Young-soo & Chung, Ki-ho, 1995. "Parametric uncapacitated facility location," European Journal of Operational Research, Elsevier, vol. 86(3), pages 469-479, November.
    2. Crema, Alejandro, 2002. "The multiparametric 0-1-integer linear programming problem: A unified approach," European Journal of Operational Research, Elsevier, vol. 139(3), pages 511-520, June.
    3. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    4. Crema, Alejandro, 2000. "An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function," European Journal of Operational Research, Elsevier, vol. 125(1), pages 18-24, August.
    5. Crema, Alejandro, 1999. "An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 569-579, May.
    6. Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
    7. repec:dgr:rugsom:00a22 is not listed on IDEAS
    8. Wang, Hsiao-Fan & Horng, Jyh-Shing, 1996. "Structural approach to parametric analysis of an IP on the case of the right-hand side," European Journal of Operational Research, Elsevier, vol. 92(1), pages 148-156, July.
    9. Crema, Alejandro, 2002. "An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program," European Journal of Operational Research, Elsevier, vol. 138(3), pages 484-494, May.
    10. Ramaswamy, R. & Chakravarti, N. & Ghosh, D., 2000. "Complexity of determining exact tolerances for min-max combinatorial optimization problems," Research Report 00A22, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    11. 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.
    12. Raymond R. Hill & Charles H. Reilly, 2000. "The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance," Management Science, INFORMS, vol. 46(2), pages 302-317, February.
    13. Crema, Alejandro, 1997. "A contraction algorithm for the multiparametric integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 130-139, August.
    14. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
    15. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    16. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
    17. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    18. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    19. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    20. M Hifi & M Michrafy, 2006. "A reactive local search-based algorithm for the disjunctively constrained knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 718-726, June.
    21. 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.

    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:spr:annopr:v:139:y:2005:i:1:p:353-373:10.1007/s10479-005-3454-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.