Modelling discrete optimisation problems in constraint logic programming

DOI10.1023/A:1018981813157MaRDI QIDQ1265908zbMATH OpenOpenAlexFDO

Authors Peter Barth, Alexander Bockmayr

Publication date 8 November 1998

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018981813157

zbMATH Keywords

constraint logic programmingdiscrete optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Logic programming (68N17)

Recommendations

• Industrial linear optimization problems solved by constraint logic programming
• scientific article; zbMATH DE number 1926617
• scientific article; zbMATH DE number 1045433
• Publication:4492740

Cited in

(5)

• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
• scientific article; zbMATH DE number 1420797 (Why is no real title available?)
• scientific article; zbMATH DE number 2127418 (Why is no real title available?)
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
• scientific article; zbMATH DE number 1059312 (Why is no real title available?)

This page was built for publication: Modelling discrete optimisation problems in constraint logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265908)