Computational study of a family of mixed-integer quadratic programming problems

DOI10.1007/3-540-59408-6_43zbMath1498.90140OpenAlexW2106555029MaRDI QIDQ5101407

Bienstock, Daniel

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_43

zbMATH Keywords

branch-and-cut algorithmpositive variables

Mathematics Subject Classification ID

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

Related Items (2)

A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ On the structure of linear programs with overlapping cardinality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric indefinite systems for interior point methods
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Large-Scale Portfolio Optimization
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming

This page was built for publication: Computational study of a family of mixed-integer quadratic programming problems