Covering with rectangular pieces

zbMATH Open1084.05500MaRDI QIDQ5201262FDOQ5201262

Paul Iacob, Cristina Luca, Daniela Marinescu

Publication date: 12 April 2006

Full work available at URL: https://eudml.org/doc/125742

Recommendations

• A rectangular cover problem
• scientific article; zbMATH DE number 3914057
• scientific article
• Experimental and Efficient Algorithms
• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds

zbMATH Keywords

algorithmsmultiple criteria optimizationdatabase systems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) Combinatorial aspects of packing and covering (05B40) Algorithms in computer science (68W99)

Cited In (5)

• Optimized location of light sources to cover a rectangular region
• A rectangular cover problem
• A mixed integer formulation for maximal covering by inclined parallelograms
• Covering of a rectangle with squares from both sides
• Covering a square by small perimeter rectangles

This page was built for publication: Covering with rectangular pieces

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