Extending a CIP Framework to Solve MIQCPs

DOI10.1007/978-1-4614-1927-3_15zbMath1242.90120OpenAlexW1805238283MaRDI QIDQ2897306

Stefan Heinz, Timo Berthold, Stefan Vigerske

Publication date: 10 July 2012

Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_15

zbMATH Keywords

nonconvexbranch-and-cutconvex relaxationdomain propagationprimal heuristicmixed integer quadratically constrained programmingconstraint integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (26)

CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Mathematical programming techniques in water network optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Valid Inequalities for Separable Concave Constraints with Indicator Variables ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Consensus reaching with the externality effect of social network for three-way group decisions ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ On \(\alpha\)-roughly weighted games ⋮ Consensus efficiency in group decision making: a comprehensive comparative study and its optimal design ⋮ FiberSCIP—A Shared Memory Parallelization of SCIP ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Computing feasible points for binary MINLPs with MPECs ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Optimizing water tanks in water distribution systems by combining network reduction, mathematical optimization and hydraulic simulation ⋮ Valid inequalities for the topology optimization problem in gas network design ⋮ Modeling, inference and optimization of regulatory networks based on time series data ⋮ A decomposition approach for optimal gas network extension with a finite set of demand scenarios ⋮ Valid inequalities for separable concave constraints with indicator variables ⋮ RENS. The optimal rounding ⋮ SCIP

Uses Software

• CPLEX
• LINDO
• Mosek
• Bonmin
• Ipopt
• MINLPLib
• LINDOGlobal
• FilMINT

This page was built for publication: Extending a CIP Framework to Solve MIQCPs