Modelling discrete optimisation problems in constraint logic programming

DOI10.1023/A:1018981813157zbMath0910.90235OpenAlexW2020731817MaRDI QIDQ1265908

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

discrete optimizationconstraint logic programming

Mathematics Subject Classification ID

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

Related Items (1)

Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search

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