A branch-and-cut method for 0-1 mixed convex programming

1999/12/01 by Robert A. Stubbs, Sanjay Mehrotra · 12 citations
Mathematics · Computer Science · #Advanced Optimization Algorithms Research #Optimization and Variational Analysis #Optimization and Search Problems

paper · doi:10.1007/s101070050103

Cited by

• Data-driven two-stage conic optimization with zero-one uncertainties
• Verification of Sequential Convex Programming for Parametric Non-convex Optimization
• On the Convexification of a Class of Mixed-Integer Conic Sets
• Ideal formulations for constrained convex optimization problems with indicator variables
• Two-sided linear chance constraints and extensions
• A Simple Effective Heuristic for Embedded Mixed-Integer Quadratic\n Programming
• A Unified and Scalable Method for Optimization over Graphs of Convex Sets
• Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems
• A Tight SDP Relaxation for MIQCQP Problems in Power Systems Based on Disjunctive Programming
• Branch-and-Price for a Class of Nonconvex Mixed-Integer Nonlinear Programs
• Exact Hull Reformulation for Quadratically Constrained Generalized Disjunctive Programs
• A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design