SoPlex

swMATH4063MaRDI QIDQ16250FDOQ16250

Author name not available (Why is that?)

Cited In (85)

• 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
• 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
• 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?)
• 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
• Integration of an LP solver into interval constraint propagation
• Towards an accurate solution of wireless network design problems
• The dual simplex method, techniques for a fast and stable implementation
• qpOASES: a parametric active-set algorithm for~quadratic programming
• Numerical methods for mixed-integer optimal control problems
• Contributions to the minimum linear arrangement problem.
• Computing tropical resultants
• Solving basis pursuit: heuristic optimality check and solver comparison
• 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
• Worst-case-expectation approach to optimization under uncertainty
• 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
• \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
• Computing Tropical Curves via Homotopy Continuation
• Three enhancements for optimization-based bound tightening
• Shift-and-propagate
• Application of a discrete tomography algorithm to computerized tomography
• Improving the accuracy of linear programming solvers with iterative refinement
• CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Branching on multi-aggregated variables
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
• Partial outer convexification for traffic light optimization in road networks
• Cloud branching
• Enhancing MIP branching decisions by using the sample variance of pseudo costs
• 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
• Solving multiscale linear programs using the simplex method in quadruple precision
• Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
• Improving strong branching by domain propagation
• Solving quadratic programs to high precision using scaled iterative refinement
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Traversing symmetric polyhedral fans
• From feasibility to improvement to proof: three phases of solving mixed-integer programs

This page was built for software: SoPlex