A hybrid branch-and-bound approach for exact rational mixed-integer programming
From MaRDI portal
Publication:744213
DOI10.1007/S12532-013-0055-6zbMATH Open1305.90310OpenAlexW2079258636MaRDI QIDQ744213FDOQ744213
Authors: William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter 
Publication date: 6 October 2014
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-013-0055-6
Recommendations
- An exact rational mixed-integer programming solver
- A computational status update for exact rational mixed integer programming
- A computational status update for exact rational mixed integer programming
- Safe bounds in linear and mixed-integer linear programming
- Exact solutions to linear programming problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- QSopt_ex
- The traveling salesman problem. A computational study.
- SCIP: solving constraint integer programs
- Benchmarking optimization software with performance profiles.
- Some perturbation theory for linear programming
- Conflict analysis in mixed integer programming
- Combinatorial auctions: a survey
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Numerically safe Gomory mixed-integer cuts
- Noncommercial software for mixed-integer linear programming
- The final NETLIB-LP results
- Safe bounds in linear and mixed-integer linear programming
- An exact rational mixed-integer programming solver
- Condition measures and properties of the central trajectory of a linear program
- Title not available (Why is that?)
- On the complexity of linear programming under finite precision arithmetic
- Linear programming, complexity theory and elementary functional analysis
- Exact solutions to linear programming problems
- Solving linear programs with finite precision. II: Algorithms
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Unifying Condition Numbers for Linear Programming
- A new condition number for linear programming
- Solving linear programs with finite precision. I: Condition numbers and random programs
- Computation of condition numbers for linear programming problems using Peña’s method
Cited In (26)
- A new bounding technique in branch-and-bound algorithms for mixed integer programming
- Title not available (Why is that?)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
- Theoretical challenges towards cutting-plane selection
- Cutting planes for families implying Frankl's conjecture
- New complexity results for Łukasiewicz logic
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- A computational status update for exact rational mixed integer programming
- Exact mixed-integer programming
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- A computational status update for exact rational mixed integer programming
- Automating weight function generation in graph pebbling
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Safe bounds in linear and mixed-integer linear programming
- Certified Core-Guided MaxSAT Solving
- Towards an accurate solution of wireless network design problems
- The covering radius and a discrete surface area for non-hollow simplices
- Backdoors to tractable answer set programming
- Verifying integer programming results
- A review of computation of mathematically rigorous bounds on optima of linear programs
- QMaxSATpb: a certified MaxSAT solver
- An exact rational mixed-integer programming solver
- Characterizing 3-Sets in Union-Closed Families
- Certified dominance and symmetry breaking for combinatorial optimisation
- Numerically safe lower bounds for the capacitated vehicle routing problem
Uses Software
This page was built for publication: A hybrid branch-and-bound approach for exact rational mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744213)
