scientific article; zbMATH DE number 3813350

zbMATH Open0514.90061MaRDI QIDQ3661315FDOQ3661315

Authors: Didier Fayard, Gérard Plateau 

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

lower and upper boundscomputational resultsbranch and bound algorithmtime complexity analysiscollapsing knapsack problemefficient reduction phasenonlinear 0-1 knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)

Cited In (1)

• An exact algorithm for the 0-1 collapsing knapsack problem

This page was built for publication:

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