An algorithm-independent measure of progress for linear constraint propagation
From MaRDI portal
Publication:2112621
DOI10.1007/s10601-022-09338-9OpenAlexW3170981534MaRDI QIDQ2112621
Sebastian Pokutta, Boro Sofranac, Ambros M. Gleixner
Publication date: 11 January 2023
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.07573
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- SCIP: solving constraint integer programs
- Progress in presolving for mixed integer programming
- Consistency in networks of relations
- Improving linear constraint propagation by changing constraint representation
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- The Complexity of Integer Bound Propagation
- Feasibility-Based Bounds Tightening via Fixed Points
- An Automatic Method of Solving Discrete Programming Problems
- Presolve Reductions in Mixed Integer Programming
- Generation of Finite Difference Formulas on Arbitrarily Spaced Grids
- Design, implementation, and evaluation of the constraint language cc(FD)
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Progress in Academic Computational Integer Programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: An algorithm-independent measure of progress for linear constraint propagation
