Active Set Methods with Reoptimization for Convex Quadratic Integer Programming

DOI10.1007/978-3-319-09174-7_11zbMath1452.90235OpenAlexW16428385MaRDI QIDQ3195322

Christoph Buchheim, Long Trieu

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_11

zbMATH Keywords

few linear constraints, enumeration of the branch-and-bound nodes

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20)

Related Items (3)

A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs ⋮ A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming

Uses Software

• CPLEX
• Unnamed Item

Cites Work

• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• An effective branch-and-bound algorithm for convex quadratic integer programming
• SCIP: solving constraint integer programs
• An algorithmic framework for convex mixed integer nonlinear programs
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• Optimization Methods in Finance
• Models and methods of solution of quadratic integer programming problems
• The polynomial solvability of convex quadratic programming
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• An Infeasible Active Set Method for Quadratic Problems with Simple Bounds

This page was built for publication: Active Set Methods with Reoptimization for Convex Quadratic Integer Programming