Pages that link to "Item:Q3009754"
From MaRDI portal
The following pages link to An Exact Rational Mixed-Integer Programming Solver (Q3009754):
Displaying 17 items.
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method (Q336618) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Restricted risk measures and robust optimization (Q2629722) (← links)
- Iterative Refinement for Linear Programming (Q2830949) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (Q4972544) (← 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)
- Total dual dyadicness and dyadic generating sets (Q6589746) (← links)
- Extending the fundamental theorem of linear programming for strict inequalities (Q6666552) (← links)
