Strong-branching inequalities for convex mixed integer nonlinear programs

DOI10.1007/S10589-014-9690-8MaRDI QIDQ480939zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On branching rules for convex mixed-integer nonlinear optimization
• A disjunctive cut strengthening technique for convex MINLP
• Branching and bounds tighteningtechniques for non-convex MINLP
• Disjunctive Cuts for Nonconvex MINLP
• Review of nonlinear mixed-integer and disjunctive programming techniques

Cites work

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

Cited in

(3)

• Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
• Stronger formulations of mixed integer linear programs: an example
• Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts

Describes a project that uses

Uses Software

• CMU-IBM
• MacMINLP
• FilMINT
• MINLPLib
• LogMIP
• Concorde
• filterSQP
• MINTO
• SCIP

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

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