Mixed-integer bilinear programming problems
type: Item
instance of: scholarly article
title: Mixed-integer bilinear programming problems
zbMATH Open document ID: 0801.90085
DOI: 10.1007/BF01581249
author: Warren P. Adams
author: Hanif D. Sherali
published in: Mathematical Programming. Series A. Series B
publication date: 1994-04-04T00:00:00Z
review text: This paper considers the bilinear programming problem with one set of variables restricted to be binary values. The authors describe some special cases of the problem which admit more efficient solution procedures. A composite Lagrangian relaxation cutting plane algorithm is given for the more general case. Some computational results are presented for comparing different algorithmic steps.
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 429090
zbMATH Keywords: implicit enumeration
zbMATH Keywords: bilinear programming
zbMATH Keywords: composite Lagrangian relaxation cutting plane algorithm
MaRDI profile type: Publication
cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
cites work: Duality in Discrete Programming: II. The Quadratic Case
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: On the choice of step size in subgradient optimization
cites work: Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
cites work: A versatile scheme for ranking the extreme points of an assignment polytope
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
cites work: Duality in quadratic programming
cites work: An Improved Implicit Enumeration Approach for Integer Programming
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Generalized Benders decomposition
cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Validation of subgradient optimization
cites work: A cutting plane algorithm for solving bilinear programs
cites work: Mixed-integer quadratic programming
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
cites work: Q5566712
cites work: Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures
cites work: On the generation of deep disjunctive cutting planes
cites work: A Decomposition Algorithm for a Discrete Location-Allocation Problem
cites work: Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
cites work: Q4124606
full work available at URL: https://doi.org/10.1007/bf01581249
OpenAlex ID: W2015127564
description: scientific article; zbMATH DE number 429090