Application of implicit enumeration to solve the packing problem

MaRDI QIDQ1842413zbMATH OpenFDO

Authors V. A. Roshchin, I. V. Sergienko

Publication date 17 May 1995

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

packingpartition problemscomplete and partial covering problems

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)

Recommendations

• A method for the implicit exhaustive search of solutions to some extremum problems on sets
• Combinatorial problems of packing and covering and related problems of integer linear program\-ming
• scientific article; zbMATH DE number 3943557
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• scientific article; zbMATH DE number 2196275

Cited in

(7)

• A method for the implicit exhaustive search of solutions to some extremum problems on sets
• Some directions and results of research in mathematical programming and system analysis
• scientific article; zbMATH DE number 3943557 (Why is no real title available?)
• Alternative formulations for the set packing problem and their application to the winner determination problem
• scientific article; zbMATH DE number 4137673 (Why is no real title available?)
• scientific article; zbMATH DE number 2196275 (Why is no real title available?)
• Combinatorial problems of packing and covering and related problems of integer linear program\-ming

This page was built for publication: Application of implicit enumeration to solve the packing problem

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