On duality for Boolean programming

DOI10.1016/0377-2217(90)90016-5zbMath0713.90051OpenAlexW1971940064MaRDI QIDQ750292

Frank Koerner

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90016-5

zbMATH Keywords

branch-and-boundpenalty functionsharp boundssurrogate problemsurvey on duality

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Duality theory (optimization) (49N15)

Related Items

A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs, Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The indefinite zero-one quadratic problem
• Integer quadratic optimization
• A general theory of dual optimization problems
• Penalty formulation for zero-one nonlinear programming
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• A hybrid method for solving nonlinear knapsack problems
• Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
• The value function of a mixed integer program: I
• The value function of a mixed integer program. II
• Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator)
• Penalty for zero–one integer equivalent problem
• Equivalence of some quadratic programming algorithms
• Semi-Definite Matrix Constraints in Optimization
• Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme
• The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
• An exact penalty approach for solving a class of minimization problems with boolean variables
• Some relationships between lagrangian and surrogate duality in integer programming
• Methods of Nonlinear 0-1 Programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Calculating surrogate constraints
• An Exact Penalty Method for Mixed-Integer Programs
• Constructive Duality in Integer Programming
• Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints