Safe bounds in linear and mixed-integer linear programming
From MaRDI portal
Recommendations
Cited in
(46)- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Verifying integer programming results
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- A reliable affine relaxation method for global optimization
- Testing cut generators for mixed-integer linear programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Numerically safe lower bounds for the capacitated vehicle routing problem
- A comparison of complete global optimization solvers
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Exact solutions to linear programming problems
- (Global) optimization: historical notes and recent developments
- A rigorous global filtering algorithm for quadratic constraints
- Validated constraints solving --- practicalities, pitfalls, and new developments
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- An exact rational mixed-integer programming solver
- A computational status update for exact rational mixed integer programming
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- On the safety of Gomory cut generators
- Interval constraint programming for globally solving catalog-based categorical optimization
- Safe and tight linear estimators for global optimization
- Fast construction of constant bound functions for sparse polynomials
- Enhancing robustness verification for deep neural networks via symbolic propagation
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Maximal inner boxes in parametric \textit{AE}-solution sets with linear shape
- A general framework for convexity analysis in deterministic global optimization
- Analyzing deep neural networks with symbolic propagation: towards higher precision and faster verification
- Iterative refinement for linear programming
- An efficient and safe framework for solving optimization problems
- On strong optimality of interval linear programming
- Transfer function synthesis without quantifier elimination
- Domain reduction techniques for global NLP and MINLP optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- On verified numerical computations in convex programming
- The small octagons of maximal width
- Enhancing numerical constraint propagation using multiple inclusion representations
- Towards an accurate solution of wireless network design problems
- Error bounds for mixed integer linear optimization problems
- Certifying feasibility and objective value of linear programs
- Rigorous filtering using linear relaxations
- Exact mixed-integer programming
- Exploiting verified neural networks via floating point numerical error
- A computational status update for exact rational mixed integer programming
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
This page was built for publication: Safe bounds in linear and mixed-integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434074)
