An exact rational mixed-integer programming solver
From MaRDI portal
Recommendations
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- 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
- Benchmarking optimization software with performance profiles.
- Combinatorial auctions: a survey
- Conflict analysis in mixed integer programming
- Exact solutions to linear programming problems
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- Numerically safe Gomory mixed-integer cuts
- Safe bounds in linear and mixed-integer linear programming
- SCIP: solving constraint integer programs
- The final NETLIB-LP results
- The traveling salesman problem. A computational study.
Cited in
(27)- Safe bounds in linear and mixed-integer linear programming
- New benchmark instances for the capacitated vehicle routing problem
- Could we use a million cores to solve an integer program?
- Total dual dyadicness and dyadic generating sets
- Revisiting a cutting-plane method for perfect matchings
- Local cuts for mixed-integer programming
- Verifying integer programming results
- Restricted risk measures and robust optimization
- Iterative refinement for linear programming
- Towards an accurate solution of wireless network design problems
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Numerically safe lower bounds for the capacitated vehicle routing problem
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- 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
- A computational status update for exact rational mixed integer programming
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Total dual dyadicness and dyadic generating sets
- Exact mixed-integer programming
- Extending the fundamental theorem of linear programming for strict inequalities
- Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
- Last fifty years of integer linear programming: a focus on recent practical advances
- Expediting exact linear programming solvers via integer preserving factorization
- Satisfiability modulo theories for verifying MILP certificates
- On the safety of Gomory cut generators
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
Describes a project that uses
Uses Software
This page was built for publication: An exact rational mixed-integer programming solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009754)
