The following pages link to (Q4346087):
Displaying 47 items.
- SoPlex (Q16250) (← links)
- The ring tree facility location problem (Q324831) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- The \(4\times 4\) minors of a \(5\times n\) matrix are a tropical basis (Q550661) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Integer linear programming models for topology optimization in sheet metal design (Q953299) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- LP-oriented upper bounds for the weighted stability number of a graph (Q1040359) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors (Q1698778) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- On the solution variability reduction of stochastic dual dynamic programming applied to energy planning (Q1751701) (← links)
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants (Q1761973) (← links)
- Stability in discrete tomography: some positive results (Q1775620) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- Modeling, inference and optimization of regulatory networks based on time series data (Q2275594) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- Solving quadratic programs to high precision using scaled iterative refinement (Q2293654) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
- Computing tropical resultants (Q2438901) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Attribute-Based Signatures for Circuits from Bilinear Map (Q2798779) (← links)
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite (Q2819234) (← links)
- Iterative Refinement for Linear Programming (Q2830949) (← links)
- Partial Outer Convexification for Traffic Light Optimization in Road Networks (Q2964443) (← links)
- Application of a discrete tomography algorithm to computerized tomography (Q3439211) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Solving Basis Pursuit (Q5270711) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection (Q5387636) (← links)
- Using multiple reference vectors and objective scaling in the feasibility pump (Q6491331) (← links)
