• Medientyp: E-Artikel
  • Titel: Search and strategies in OPL
  • Beteiligte: Van Hentenryck, Pascal; Perron, Laurent; Puget, Jean-François
  • Erschienen: Association for Computing Machinery (ACM), 2000
  • Erschienen in: ACM Transactions on Computational Logic, 1 (2000) 2, Seite 285-320
  • Sprache: Englisch
  • DOI: 10.1145/359496.359529
  • ISSN: 1557-945X; 1529-3785
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: OPL is a modeling language for mathematical programming and combinatorial optimization. It is the first language to combine high-level algebraic and set notations from mathematical modeling languages with a rich constraint language and the ability to specify search procedures and strategies that are the essence of constraint programming. This paper describes the facilities available in OPL to specify search procedures. It describes the abstractions of OPL to specify both the search tree (search) and how to explore it (strategies). The paper also illustrates how to use these high-level constructs to implement traditional search procedures in constraint programming and scheduling.
  • Zugangsstatus: Freier Zugang