AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS

DOI10.15807/jorsj.24.360zbMath0475.90063OpenAlexW2182349857MaRDI QIDQ3931021

Hiroshi Konno

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

zbMATH Keywords

bipartite matchinginteger quadratic programmingcutting plane algorithmcutting stock problems0-1 bilinear knapsack problemmulti-attribute utility analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (4)

On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Knowledge based approach to the cutting stock problem ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases

This page was built for publication: AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS