SoPlex
From MaRDI portal
Software:16250
swMATH4063MaRDI QIDQ16250FDOQ16250
Author name not available (Why is that?)
Cited In (86)
- Application of a discrete tomography algorithm to computerized tomography
- Improving the accuracy of linear programming solvers with iterative refinement
- Branching on Multi-aggregated Variables
- CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Cloud Branching
- Linear programming using limited-precision oracles
- Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Discrete Geometry for Computer Imagery
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
- Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
- Traversing Symmetric Polyhedral Fans
- Improving strong branching by domain propagation
- Solving quadratic programs to high precision using scaled iterative refinement
- Partial Outer Convexification for Traffic Light Optimization in Road Networks
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
- Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- A branch-and-price algorithm for switch-box routing
- A computational study of primal heuristics inside an MI(NL)P solver
- Generalized coefficient strengthening cuts for mixed integer programming
- MIPLIB 2003
- Progress in presolving for mixed integer programming
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Integer linear programming models for topology optimization in sheet metal design
- PICO: An object-oriented framework for parallel branch and bound
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The \(4\times 4\) minors of a \(5\times n\) matrix are a tropical basis
- Stability in discrete tomography: some positive results
- Numerical and analytical results for the transportation problem of Monge-Kantorovich
- On the solution variability reduction of stochastic dual dynamic programming applied to energy planning
- Benchmarking interior point Lp/Qp solvers
- LP-oriented upper bounds for the weighted stability number of a graph
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Could we use a million cores to solve an integer program?
- Decomposition algorithms for stochastic programming on a computational grid
- Integration of an LP Solver into Interval Constraint Propagation
- Title not available (Why is that?)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Exact solutions and bounds for general art gallery problems
- Certifying feasibility and objective value of linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Basis Pursuit
- Title not available (Why is that?)
- Worst-Case-Expectation Approach to Optimization Under Uncertainty
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- The ring tree facility location problem
- Measuring the impact of primal heuristics
- The final NETLIB-LP results
- RENS. The optimal rounding
- Exact and fast algorithms for mixed-integer nonlinear programming
- Optimized load planning for motorail transportation
- Introduction to ABACUS -- a branch-and-cut system
- Towards a practical parallelisation of the simplex method
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Iterative refinement for linear programming
- Decomposition, reformulation, and diving in university course timetabling
- SCIP: solving constraint integer programs
- Practical and efficient algorithms for the geometric hitting set problem
- FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
- Certifying algorithms
- Three ideas for a feasibility pump for nonconvex MINLP
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Computing tropical resultants
- Towards globally optimal operation of water supply networks
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
- Modeling, inference and optimization of regulatory networks based on time series data
- A rigorous global filtering algorithm for quadratic constraints
- Hyper-sparsity in the revised simplex method and how to exploit it
- Title not available (Why is that?)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants
- Title not available (Why is that?)
- Customizing the solution process of COIN-OR's linear solvers with python
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Parallelizing the dual revised simplex method
- Towards an Accurate Solution of Wireless Network Design Problems
- Computing Tropical Curves via Homotopy Continuation
- Three enhancements for optimization-based bound tightening
- Shift-and-propagate
This page was built for software: SoPlex