Integration of an LP solver into interval constraint propagation

DOI10.1007/978-3-642-22616-8_27zbMATH Open1342.68307OpenAlexW128420466MaRDI QIDQ5199161FDOQ5199161

Authors: Ernst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid 

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_27

Recommendations

• A practical approach to satisfiability modulo linear integer arithmetic
• Towards a closer integration of finite domain propagation and simplex-based algorithms
• scientific article; zbMATH DE number 1163305
• An example of integrating constraint programming and mathematical programming
• A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (1)

• Certifying feasibility and objective value of linear programs

Uses Software

• SoPlex
• OpenSMT
• MathSAT

This page was built for publication: Integration of an LP solver into interval constraint propagation

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