Mixed-integer bilinear programming problems
- 1 March 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 59 (1-3) , 279-305
- https://doi.org/10.1007/bf01581249
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming ProblemsOperations Research, 1990
- A versatile scheme for ranking the extreme points of an assignment polytopeNaval Research Logistics Quarterly, 1981
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problemNaval Research Logistics Quarterly, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- Duality in Discrete Programming: II. The Quadratic CaseManagement Science, 1969
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- Duality in quadratic programmingQuarterly of Applied Mathematics, 1960