Dual approaches for a specific class of integer nonlinear programming problems

DOI10.1016/J.ENDM.2016.10.019MaRDI QIDQ510937zbMATH OpenOpenAlexFDO

Authors M. 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)

Recommendations

• A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• A new branch and bound method for integer quadratic programming problems
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound

Cites work

• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• An active set feasible method for large-scale minimization problems with bound constraints
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations

Cited in

(4)

• Solution approaches for highly primal- and dual-degenerate all-integer programming problems
• Comment on A nonlinear Lagrangian dual for integer programming.
• scientific article; zbMATH DE number 3904332 (Why is no real title available?)
• Success guarantee of dual search in integer programming: p-th power Lagrangian method.

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510937)