Pages that link to "Item:Q734351"
From MaRDI portal
The following pages link to SCIP: solving constraint integer programs (Q734351):
Displaying 50 items.
- PolySCIP (Q2819226) (← links)
- Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion (Q2819233) (← links)
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite (Q2819234) (← links)
- The Software Portal swMATH: A State of the Art Report and Next Steps (Q2819248) (← links)
- How to compute the Stanley depth of a module (Q2826690) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155) (← links)
- Validation of nominations in gas network optimization: models, methods, and solutions (Q2943808) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Convex Relaxations for Gas Expansion Planning (Q2960359) (← links)
- Partial Outer Convexification for Traffic Light Optimization in Road Networks (Q2964443) (← links)
- A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE (Q2970178) (← links)
- Polyhedral approaches to learning Bayesian networks (Q2979652) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming (Q3386779) (← links)
- On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm (Q3706842) (← links)
- Normaliz 2013–2016 (Q4556568) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- More Virtuous Smoothing (Q4634104) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- From feasibility to improvement to proof: three phases of solving mixed-integer programs (Q4637827) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program (Q4637833) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Energy-Efficient Design of a Water Supply System for Skyscrapers by Mixed-Integer Nonlinear Programming (Q4685793) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- A Mixed-Integer PDE-Constrained Optimization Formulation for Electromagnetic Cloaking (Q5022487) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Оптимизация загрузки упорядоченной совокупности летательных аппаратов (Q5112293) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- Mathematical Programming Algorithms for Spatial Cloaking (Q5137955) (← links)
- Toward Computing the Margin of Victory in Single Transferable Vote Elections (Q5139621) (← links)
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (Q5151528) (← links)
- Optimization Methods: An Applications-Oriented Primer (Q5154449) (← links)
