Pages that link to "Item:Q2467437"
From MaRDI portal
The following pages link to Exact solutions to linear programming problems (Q2467437):
Displaying 33 items.
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- Certifying algorithms (Q465678) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Rigidity of spherical codes (Q658415) (← 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)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
- Using massively parallel computations for absolutely precise solution of the linear programming problems (Q2261711) (← links)
- Improved WLP and GWP lower bounds based on exact integer programming (Q2266886) (← links)
- Algorithms for finding generalized minimum aberration designs (Q2349095) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations (Q2802247) (← links)
- Iterative Refinement for Linear Programming (Q2830949) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision (Q3462312) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints (Q5001675) (← links)
- A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models (Q5090325) (← 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)
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture (Q5883707) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry (Q5963080) (← links)
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level (Q6163957) (← links)
