IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v149y2007i1p103-11610.1007-s10479-006-0111-y.html
   My bibliography  Save this article

En hommage à Joseph-Louis Lagrange et à Pierre Huard

Author

Listed:
  • Monique Guignard

Abstract

No abstract is available for this item.

Suggested Citation

  • Monique Guignard, 2007. "En hommage à Joseph-Louis Lagrange et à Pierre Huard," Annals of Operations Research, Springer, vol. 149(1), pages 103-116, February.
    • Handle: RePEc:spr:annopr:v:149:y:2007:i:1:p:103-116:10.1007/s10479-006-0111-y
    DOI: 10.1007/s10479-006-0111-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0111-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0111-y?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. M.L. Flegel & C. Kanzow, 2005. "Abadie-Type Constraint Qualification for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 124(3), pages 595-614, March.
    2. 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.
    3. Edward H. Bowman, 1956. "Production Scheduling by the Transportation Method of Linear Programming," Operations Research, INFORMS, vol. 4(1), pages 100-103, February.
    4. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    5. Caron, Richard J. & Greenberg, Harvey J. & Holder, Allen G., 2002. "Analytic centers and repelling inequalities," European Journal of Operational Research, Elsevier, vol. 143(2), pages 268-290, December.
    6. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    7. Renato de Matta & Monique Guignard, 1994. "Dynamic Production Scheduling for a Process Industry," Operations Research, INFORMS, vol. 42(3), pages 492-503, June.
    8. Guignard, Monique, 1998. "Efficient cuts in Lagrangean `Relax-and-cut' schemes," European Journal of Operational Research, Elsevier, vol. 105(1), pages 216-223, February.
    9. Fred Shepardson & Roy E. Marsten, 1980. "A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem," Management Science, INFORMS, vol. 26(3), pages 274-281, March.
    10. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    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. José Manuel Velarde & Susana García & Mauricio López & Alfredo Bueno-Solano, 2019. "Implementation of a Mathematical Model to Improve Sustainability in the Handling of Transport Costs in a Distribution Network," Sustainability, MDPI, vol. 12(1), pages 1-10, December.

    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. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    2. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    3. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    4. Hinojosa, Y. & Puerto, J. & Fernandez, F. R., 2000. "A multiperiod two-echelon multicommodity capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 271-291, June.
    5. Rajagopalan, S. & Yu, Hung-Liang, 2001. "Capacity planning with congestion effects," European Journal of Operational Research, Elsevier, vol. 134(2), pages 365-377, October.
    6. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    7. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
    8. Lian Qi & Zuo-Jun Max Shen & Lawrence V. Snyder, 2010. "The Effect of Supply Disruptions on Supply Chain Design Decisions," Transportation Science, INFORMS, vol. 44(2), pages 274-289, May.
    9. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    10. Ishwar Murthy, 1993. "Solving the multiperiod assignment problem with start‐up costs using dual ascent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 325-344, April.
    11. Saez, Jesus, 2000. "Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes," European Journal of Operational Research, Elsevier, vol. 121(3), pages 609-626, March.
    12. Rapine, Christophe & Penz, Bernard & Gicquel, Céline & Akbalik, Ayse, 2018. "Capacity acquisition for the single-item lot sizing problem under energy constraints," Omega, Elsevier, vol. 81(C), pages 112-122.
    13. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    14. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    15. Hanif Sherali & J. Smith, 2012. "Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 173-189, April.
    16. Dilip Chhajed & Timothy J. Lowe, 1998. "Solving a selected class of location problems by exploiting problem structure: A decomposition approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 791-815, December.
    17. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    18. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
    19. Cruz, F. R. B. & Smith, J. MacGregor & Mateus, G. R., 1999. "Algorithms for a multi-level network optimization problem," European Journal of Operational Research, Elsevier, vol. 118(1), pages 164-180, October.
    20. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, June.

    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:spr:annopr:v:149:y:2007:i:1:p:103-116:10.1007/s10479-006-0111-y. 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.