IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v104y2001i1p141-16110.1023-a1013195004424.html
   My bibliography  Save this article

A Declarative Modeling Framework that Integrates Solution Methods

Author

Listed:
  • J.N. Hooker
  • Hak-Jin Kim
  • G. Ottosson

Abstract

Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any “checker” and any special-purpose “solver”. In particular this integrates constraint programming and optimization methods, because the checker can consist of constraint propagation methods, and the solver can be a linear or nonlinear programming routine. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • J.N. Hooker & Hak-Jin Kim & G. Ottosson, 2001. "A Declarative Modeling Framework that Integrates Solution Methods," Annals of Operations Research, Springer, vol. 104(1), pages 141-161, April.
    • Handle: RePEc:spr:annopr:v:104:y:2001:i:1:p:141-161:10.1023/a:1013195004424
    DOI: 10.1023/A:1013195004424
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.

    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:104:y:2001:i:1:p:141-161:10.1023/a:1013195004424. 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.