SoPlex
From MaRDI portal
Cited in
(only showing first 100 items - show all)- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- Application of a discrete tomography algorithm to computerized tomography
- A computational study of primal heuristics inside an MI(NL)P solver
- Generalized coefficient strengthening cuts for mixed integer programming
- A branch-and-price algorithm for switch-box routing
- Progress in presolving for mixed integer programming
- MIPLIB 2003
- 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
- Improving the accuracy of linear programming solvers with iterative refinement
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
- PICO: An object-oriented framework for parallel branch and bound
- The \(4\times 4\) minors of a \(5\times n\) matrix are a tropical basis
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- 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
- LP-oriented upper bounds for the weighted stability number of a graph
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Could we use a million cores to solve an integer program?
- Benchmarking interior point Lp/Qp solvers
- Decomposition algorithms for stochastic programming on a computational grid
- Branching on multi-aggregated variables
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Certifying feasibility and objective value of linear programs
- 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
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Partial outer convexification for traffic light optimization in road networks
- BPMPD
- cdd
- Givaro
- gmp
- IML - Integer Matrix Library
- SCIP
- iB4e
- ASYNPLEX
- ABACUS
- MIPLIB
- UG
- lpSolve
- PVM
- KORBX
- Zimpl
- Netlib
- HTCondor MW
- Benchmarks for Optimization Software
- COIN-OR
- MINTO
- Gfan
- Concorde
- FEASPUMP
- QSopt_ex
- SMPS reader
- CLP
- COPL_QP
- QSopt-Exact
- XPRESS
- Miniball
- FiberSCIP
- ParaSCIP
- Valse-XT
- MarPlex
- MIPLIB2003
- DEVEX
- Dsor
- MOPS
- DINS
- GCG
- SIMPAR
- TropLi
- BEAVER
- NETLIB LP Test Set
- Hull
- IbexOpt
- EGlib
- COR@L
- PySCIPOpt
- libquadmath
- AmplNLWriter
- Tcmalloc
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- pPCx
- SCIP-Jack
- respol
- DynamicPrevariety
- Octane
- L1TestPack
- PARSMI
- SYNPLEX
- LPCCbnc
- LPbook
- ParISS
- QPRefinement
- The ring tree facility location problem
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Cloud branching
This page was built for software: SoPlex
