AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS
From MaRDI portal
Publication:3931021
DOI10.15807/jorsj.24.360zbMath0475.90063MaRDI QIDQ3931021
Publication date: 1981
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.24.360
bipartite matching; integer quadratic programming; cutting plane algorithm; cutting stock problems; 0-1 bilinear knapsack problem; multi-attribute utility analysis
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C09: Boolean programming
Related Items
Knowledge based approach to the cutting stock problem, Combinatorial optimization with interaction costs: complexity and solvable cases, On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty, Models and methods of solution of quadratic integer programming problems