On duality for Boolean programming
From MaRDI portal
The paper presents a survey on duality for Boolean programming. The author discusses ways to obtain sharp bounds for branch-and-bound algorithms. Linear and nonlinear objective functions and nonlinear representations of the Boolean restrictions on the variables are used in the primal problem to get various forms for the dual problem.
Recommendations
- An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- scientific article; zbMATH DE number 279605
- Duality for mixed-integer linear programs
- scientific article; zbMATH DE number 4035570
Cites work
- A general theory of dual optimization problems
- A hybrid method for solving nonlinear knapsack problems
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- An exact penalty approach for solving a class of minimization problems with boolean variables
- An Exact Penalty Method for Mixed-Integer Programs
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Calculating surrogate constraints
- Constructive Duality in Integer Programming
- Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator)
- Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme
- Equivalence of some quadratic programming algorithms
- scientific article; zbMATH DE number 3934777 (Why is no real title available?)
- scientific article; zbMATH DE number 4012317 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3717129 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3476892 (Why is no real title available?)
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- scientific article; zbMATH DE number 3353073 (Why is no real title available?)
- scientific article; zbMATH DE number 3376984 (Why is no real title available?)
- Integer quadratic optimization
- Methods of Nonlinear 0-1 Programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Penalty for zero–one integer equivalent problem
- Penalty formulation for zero-one nonlinear programming
- Semi-Definite Matrix Constraints in Optimization
- Some relationships between lagrangian and surrogate duality in integer programming
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- The indefinite zero-one quadratic problem
- The value function of a mixed integer program. II
- The value function of a mixed integer program: I
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
- Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
Cited in
(7)- Dualization of regular Boolean functions
- Dualities in the class of extended Boolean functions
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
- The dual of a logical linear programme
This page was built for publication: On duality for Boolean programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750292)
