scientific article; zbMATH DE number 1041084

Publication date: 29 July 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

stability linear programming integer programming numerical examples parallel computation sparse matrix cutting plane method dual algorithm object oriented simplex algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Parallel numerical computation (65Y05)

Related Items

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

Uses Software