Stronger Inference through Implied Literals from Conflicts and Knapsack Covers

DOI10.1007/978-3-642-38171-3_1MaRDI QIDQ4922900zbMATH OpenOpenAlexFDO

Authors Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz

Publication date 4 June 2013

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38171-3_1

Mathematics Subject Classification ID

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

Recommendations

• Generalized conflict-clause strengthening for satisfiability solvers
• Learning from conflicts in propositional satisfiability
• Simple lifted cover inequalities and hard knapsack problems
• Lifting cover inequalities for the precedence-constrained knapsack problem
• What we can learn from conflicts in propositional satisfiability
• Approximately propagation complete and conflict propagating constraint encodings
• ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM

Cited in

(2)

• Domain reduction techniques for global NLP and MINLP optimization
• Last fifty years of integer linear programming: a focus on recent practical advances

Describes a project that uses

Uses Software

• CPLEX
• MIPLIB
• SCIP
• CryptoMiniSat

This page was built for publication: Stronger Inference through Implied Literals from Conflicts and Knapsack Covers

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