AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS

DOI10.15807/JORSJ.24.360MaRDI QIDQ3931021zbMATH OpenOpenAlexFDO

Authors 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

0-1 bilinear knapsack problembipartite matchingcutting plane algorithmcutting stock problemsinteger quadratic programmingmulti-attribute utility analysis

Mathematics Subject Classification ID

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

Cited in

(4)

• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931021)