A hybrid branch-and-bound approach for exact rational mixed-integer programming
From MaRDI portal
(Redirected from Publication:744213)
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
Cites work
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- A new condition number for linear programming
- An exact rational mixed-integer programming solver
- Benchmarking optimization software with performance profiles.
- Combinatorial auctions: a survey
- Computation of condition numbers for linear programming problems using Peña’s method
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Condition measures and properties of the central trajectory of a linear program
- Conflict analysis in mixed integer programming
- Exact solutions to linear programming problems
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Linear programming, complexity theory and elementary functional analysis
- Noncommercial software for mixed-integer linear programming
- Numerically safe Gomory mixed-integer cuts
- On the complexity of linear programming under finite precision arithmetic
- QSopt_ex
- SCIP: solving constraint integer programs
- Safe bounds in linear and mixed-integer linear programming
- Solving linear programs with finite precision. I: Condition numbers and random programs
- Solving linear programs with finite precision. II: Algorithms
- Some perturbation theory for linear programming
- The final NETLIB-LP results
- The traveling salesman problem. A computational study.
- Unifying Condition Numbers for Linear Programming
Cited in
(26)- A new bounding technique in branch-and-bound algorithms for mixed integer programming
- scientific article; zbMATH DE number 1942454 (Why is no real title available?)
- 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
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Exact mixed-integer programming
- 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
- Towards an accurate solution of wireless network design problems
- Certified Core-Guided MaxSAT Solving
- 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
Describes a project that uses
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)
