Extending a CIP framework to solve MIQCPs

DOI10.1007/978-1-4614-1927-3_15MaRDI QIDQ2897306zbMATH OpenOpenAlexFDO

Authors Timo Berthold, Stefan Heinz, 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

nonconvexconvex relaxationbranch-and-cutdomain propagationprimal heuristicmixed integer quadratically constrained programmingconstraint integer programming

Mathematics Subject Classification ID

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

Recommendations

• Analyzing the computational impact of MIQCP solver components
• The MILP road to MIQCP
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Global solution of non-convex quadratically constrained quadratic programs
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

Cited in

(29)

• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
• Valid inequalities for separable concave constraints with indicator variables
• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
• Valid inequalities for separable concave constraints with indicator variables
• GLOMIQO: global mixed-integer quadratic optimizer
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
• Consensus efficiency in group decision making: a comprehensive comparative study and its optimal design
• Modeling, inference and optimization of regulatory networks based on time series data
• Consensus reaching with the externality effect of social network for three-way group decisions
• A framework for globally optimizing mixed-integer signomial programs
• On \(\alpha\)-roughly weighted games
• A MIQCP formulation for B-spline constraints
• Mixed integer nonlinear programming tools: an updated practical overview
• A computational study of primal heuristics inside an MI(NL)P solver
• SCIP
• Analyzing the computational impact of MIQCP solver components
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Mathematical programming techniques in water network optimization
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• RENS. The optimal rounding
• Computing feasible points for binary MINLPs with MPECs
• 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
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness

Describes a project that uses

Uses Software

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

This page was built for publication: Extending a CIP framework to solve MIQCPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897306)