A method for the implicit exhaustive search of solutions to some extremum problems on sets

zbMATH Open0928.05014MaRDI QIDQ3365255FDOQ3365255

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

Publication date: 1996

Recommendations

• Application of implicit enumeration to solve the packing problem
• An approach to the solution of the set-covering problem
• On the constructive enumeration of packings and coverings of index one
• Implementation algorithms for solution of covering problems and analysis of their efficiency
• A procedure for solution of the problem of optimal covering of a finite set

zbMATH Keywords

coveringpackingpartition problemimplicit exhaustive search method

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Lattice packing and covering (number-theoretic aspects) (11H31) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (3)

• Title not available (Why is that?)
• Adaptation of implicit search methods
• Application of implicit enumeration to solve the packing problem

This page was built for publication: A method for the implicit exhaustive search of solutions to some extremum problems on sets

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