Advanced Search
MyIDEAS: Login

Lagrangean relaxation

Contents:

Author Info

  • Monique Guignard

    ()

Registered author(s):

    Abstract

    No abstract is available for this item.

    Download Info

    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://hdl.handle.net/10.1007/BF02579036
    Download Restriction: Access to full text is restricted to subscribers.

    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.

    Bibliographic Info

    Article provided by Springer in its journal Top.

    Volume (Year): 11 (2003)
    Issue (Month): 2 (December)
    Pages: 151-200

    as in new window
    Handle: RePEc:spr:topjnl:v:11:y:2003:i:2:p:151-200

    Contact details of provider:
    Web page: http://www.springerlink.com/link.asp?id=120409

    Order Information:
    Web: http://link.springer.de/orders.htm

    Related research

    Keywords: Integer programming; Lagrangean relaxation; column generation; 90C11; 90-02;

    Find related papers by JEL classification:

    References

    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. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    2. Jacques Desrosiers & Michel Sauvé & François Soumis, 1988. "Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows," Management Science, INFORMS, vol. 34(8), pages 1005-1022, August.
    3. Jornsten, Kurt & Nasberg, Mikael, 1986. "A new Lagrangian relaxation approach to the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 27(3), pages 313-323, December.
    4. Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    5. Guignard, Monique & Ryu, Choonho & Spielberg, Kurt, 1998. "Model tightening for integrated timber harvest and transportation planning," European Journal of Operational Research, Elsevier, vol. 111(3), pages 448-460, December.
    6. Guignard, Monique, 1998. "Efficient cuts in Lagrangean `Relax-and-cut' schemes," European Journal of Operational Research, Elsevier, vol. 105(1), pages 216-223, February.
    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 in new window

    Cited by:
    1. Sáez-Aguado, Jesús & Trandafir, Paula Camelia, 2012. "Some heuristic methods for solving p-median problems with a coverage constraint," European Journal of Operational Research, Elsevier, vol. 220(2), pages 320-327.
    2. Escudero, Laureano F. & Landete, Mercedes & Rodríguez-Chía, Antonio M., 2011. "Stochastic set packing problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 232-240, June.
    3. Mohammad Nezhad, Ali & Manzour, Hasan & Salhi, Said, 2013. "Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 713-723.
    4. Alfredo Marín, 2010. "Discrete location for bundled demand points," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 18(1), pages 242-256, July.
    5. Laureano Escudero, 2009. "On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 17(1), pages 5-29, July.
    6. Maria Albareda-Sambola & Elena Fernández & Yolanda Hinojosa & Justo Puerto, 2010. "The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 18(1), pages 43-61, July.

    Lists

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

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:11:y:2003:i:2:p:151-200. 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: (Guenther Eichhorn) or (Christopher F Baum).

    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.