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

1999/12/01 by Robert A. Stubbs, Sanjay Mehrotra · 311 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Combinatorics #Computer science #Construct (python library) #Convex analysis #Convex optimization #Geometry #Mathematical optimization #Mathematics #Optimization and Search Problems #Optimization and Variational Analysis #Programming language #Regular polygon

paper · doi:10.1007/s101070050103

published in Mathematical Programming 86(3), 515-532 (Springer Science+Business Media)

openalex publication_date 1999/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/26

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 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
• A General System for Heuristic Solution of Convex Problems over Nonconvex Sets
• Semidefinite approximation for mixed binary quadratically constrained quadratic programs
• Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization
• Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection
• Nonlinear Integer Programming
• Optimizing convex functions over nonconvex sets
• Computer Aided Design of Solvent Blends for Hybrid Cooling and Antisolvent Crystallization of Active Pharmaceutical Ingredients. [europepmc]