Pages that link to "Item:Q4637831"
From MaRDI portal
The following pages link to SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831):
Displaying 20 items.
- Optimization as an Analysis Tool for Human Complex Problem Solving (Q3105784) (← links)
- Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388) (← links)
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program (Q4637833) (← links)
- On the Performance of NLP Solvers Within Global MINLP Solvers (Q4685828) (← links)
- Algorithm 996 (Q4960955) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Team Orienteering with Time-Varying Profit (Q5084650) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- FiberSCIP—A Shared Memory Parallelization of SCIP (Q5131706) (← links)
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization (Q6063782) (← links)
- Exact reliability optimization for series‐parallel graphs using convex envelopes (Q6066247) (← links)
- A Huff-like location model with quality adjustment and/or closing of existing facilities (Q6555174) (← links)
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem (Q6561239) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
- An Automated Approach to Causal Inference in Discrete Settings (Q6631678) (← links)
