Dual approaches for a specific class of integer nonlinear programming problems

DOI10.1016/j.endm.2016.10.019zbMath1366.90141OpenAlexW2550372578MaRDI QIDQ510937

Marianna De Santis

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.019

zbMATH Keywords

global optimizationinteger programmingquadratic programming

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Uses Software

• CPLEX

Cites Work

• An active set feasible method for large-scale minimization problems with bound constraints
• A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
• An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations

This page was built for publication: Dual approaches for a specific class of integer nonlinear programming problems