A LOGIC LANGUAGE FOR COMBINATORIAL OPTIMIZATION.
Saved in:
| Title: | A LOGIC LANGUAGE FOR COMBINATORIAL OPTIMIZATION. |
|---|---|
| Authors: | Van Hentenryck, Pascal1 |
| Source: | Annals of Operations Research. 1989, Vol. 21 Issue 1-4, p247-273. 27p. 8 Diagrams, 2 Charts. |
| Subjects: | Combinatorial optimization, Logic programming languages, Constraint programming, Programming languages, Operations research |
| Abstract: | CHIP (Constraint Handling In Prolog) is a new logic programming language combining the declarative aspect of logic programming for stating search problems with the efficiency of constraint handling techniques for solving them. CHIP has been applied to many real-life problems in Operations Research and hardware design with an efficiency comparable to specific programs written in procedural languages. The main advantage of CHIP is the short development time of the programs and their great modifiability and extensibility. In this paper, we discuss the application of the finite domain part of CHIP to the solving of discrete combinatorial problems occurring in Operations Research. The basic mechanisms underlying CHIP are explained through simple examples. Solutions in CHIP of several real-life problems (e.g., cutting stock, warehouses location problems) are presented and compared with usual approaches, showing the versatility and the interest of the approach. [ABSTRACT FROM AUTHOR] |
| Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 18935626 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A LOGIC LANGUAGE FOR COMBINATORIAL OPTIMIZATION. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Van+Hentenryck%2C+Pascal%22">Van Hentenryck, Pascal</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. 1989, Vol. 21 Issue 1-4, p247-273. 27p. 8 Diagrams, 2 Charts. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Combinatorial+optimization%22">Combinatorial optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming+languages%22">Logic programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Constraint+programming%22">Constraint programming</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research%22">Operations research</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: CHIP (Constraint Handling In Prolog) is a new logic programming language combining the declarative aspect of logic programming for stating search problems with the efficiency of constraint handling techniques for solving them. CHIP has been applied to many real-life problems in Operations Research and hardware design with an efficiency comparable to specific programs written in procedural languages. The main advantage of CHIP is the short development time of the programs and their great modifiability and extensibility. In this paper, we discuss the application of the finite domain part of CHIP to the solving of discrete combinatorial problems occurring in Operations Research. The basic mechanisms underlying CHIP are explained through simple examples. Solutions in CHIP of several real-life problems (e.g., cutting stock, warehouses location problems) are presented and compared with usual approaches, showing the versatility and the interest of the approach. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=18935626 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/BF02022102 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 27 StartPage: 247 Subjects: – SubjectFull: Combinatorial optimization Type: general – SubjectFull: Logic programming languages Type: general – SubjectFull: Constraint programming Type: general – SubjectFull: Programming languages Type: general – SubjectFull: Operations research Type: general Titles: – TitleFull: A LOGIC LANGUAGE FOR COMBINATORIAL OPTIMIZATION. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Van Hentenryck, Pascal IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: 1989 Type: published Y: 1989 Identifiers: – Type: issn-print Value: 02545330 Numbering: – Type: volume Value: 21 – Type: issue Value: 1-4 Titles: – TitleFull: Annals of Operations Research Type: main |
| ResultId | 1 |
