Pages that link to "Item:Q1434074"
From MaRDI portal
The following pages link to Safe bounds in linear and mixed-integer linear programming (Q1434074):
Displaying 44 items.
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Maximal inner boxes in parametric \textit{AE}-solution sets with linear shape (Q670819) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- An efficient and safe framework for solving optimization problems (Q861905) (← links)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- On strong optimality of interval linear programming (Q1676494) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- A rigorous global filtering algorithm for quadratic constraints (Q1774519) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- The small octagons of maximal width (Q1953053) (← links)
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability (Q2026298) (← links)
- Enhancing robustness verification for deep neural networks via symbolic propagation (Q2050096) (← links)
- Exploiting verified neural networks via floating point numerical error (Q2145326) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems (Q2423791) (← links)
- Exact solutions to linear programming problems (Q2467437) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (Q2802247) (← links)
- Iterative refinement for linear programming (Q2830949) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Transfer Function Synthesis without Quantifier Elimination (Q5892491) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- Analyzing deep neural networks with symbolic propagation: towards higher precision and faster verification (Q6536294) (← links)
- Interval constraint programming for globally solving catalog-based categorical optimization (Q6541384) (← links)
