Strong-branching inequalities for convex mixed integer nonlinear programs

DOI10.1007/S10589-014-9690-8zbMath1310.90079OpenAlexW1973473254MaRDI QIDQ480939

Yong-Cai Geng, Sumit K. Garg

Publication date: 12 December 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/60748

zbMATH Keywords

mixed-integer nonlinear programmingmixing inequalitiesdisjunctive inequalitiesstrong-branching

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts

Uses Software

• Unnamed Item
• MINTO
• filterSQP
• Concorde
• LogMIP
• MINLPLib
• FilMINT
• MacMINLP
• CMU-IBM

Cites Work

• Unnamed Item
• On the separation of disjunctive cuts
• Strengthening cuts for mixed integer programs
• Disjunctive programming: Properties of the convex hull of feasible points
• MINTO, a Mixed INTeger Optimizer
• A modified lift-and-project procedure
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Branching rules revisited
• A branch-and-cut method for 0-1 mixed convex programming
• Conflict graphs in solving integer programming problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Conflict analysis in mixed integer programming
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Large-Scale Network Topological Optimization
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• A Computational Study of Search Strategies for Mixed Integer Programming
• Mixed-integer nonlinear optimization
• Mixing mixed-integer inequalities
• Benchmarking optimization software with performance profiles.

This page was built for publication: Strong-branching inequalities for convex mixed integer nonlinear programs