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 50 items.
- A risk-averse stochastic program for integrated system design and preventive maintenance planning (Q666964) (← links)
- A system to evaluate gas network capacities: concepts and implementation (Q723970) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Juniper: an open-source nonlinear branch-and-bound solver in Julia (Q1626763) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Graphical models for optimal power flow (Q1701228) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Linear models for stockpiling in open-pit mine production scheduling problems (Q1753425) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- Analyzing the computational impact of MIQCP solver components (Q1940956) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (Q2046391) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- A choice-based optimization approach for contracting in supply chains (Q2083952) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- Optimization hierarchy for fair statistical decision problems (Q2112802) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
- Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Large-scale problems with quasi-block matrices (Q2290827) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization (Q2689856) (← 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)
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs (Q2899087) (← links)
