IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v118y2003i1p17-3310.1023-a1021845304798.html
   My bibliography  Save this article

Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem

Author

Listed:
  • Meinolf Sellmann
  • Torsten Fahle

Abstract

Whereas CP methods are strong with respect to the detection of local infeasibilities, OR approaches have powerful optimization abilities that ground on tight global bounds on the objective. An integration of propagation ideas from CP and Lagrangian relaxation techniques from OR combines the merits of both approaches. We introduce a general way of how linear optimization constraints can strengthen their propagation abilities via Lagrangian relaxation. The method is evaluated on a set of benchmark problems stemming from a multimedia application. The experiments show the superiority of the combined method compared with a pure OR approach and an algorithm based on two independent optimization constraints. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Meinolf Sellmann & Torsten Fahle, 2003. "Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem," Annals of Operations Research, Springer, vol. 118(1), pages 17-33, February.
    • Handle: RePEc:spr:annopr:v:118:y:2003:i:1:p:17-33:10.1023/a:1021845304798
    DOI: 10.1023/A:1021845304798
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1021845304798
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1021845304798?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.

    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:118:y:2003:i:1:p:17-33:10.1023/a:1021845304798. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.