scientific article; zbMATH DE number 994412

MaRDI QIDQ3126375zbMATH OpenFDO

Authors Volker Schnecke

Publication date 25 March 1997

zbMATH Keywords

bin-packing problemgenetic algorithmsVLSI circuit layout

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computer system organization (68M99) Parallel algorithms in computer science (68W10)

Recommendations

• Hybrid genetic algorithms for bin-packing and related problems
• A genetic algorithm for facility layout
• Algorithms for VLSI placement
• Use of genetic algorithms for solution of the rectangle packing problem
• Hope: A genetic algorithm for the unequal area facility layout problem.

Cited in

(12)

• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
• Polyominoes tiling by a genetic algorithm
• Hybrid genetic algorithms for bin-packing and related problems
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• Dynamic hierarchical packing of wireless switches using a seed, repair and replace genetic algorithm
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• scientific article; zbMATH DE number 4110154 (Why is no real title available?)
• scientific article; zbMATH DE number 1487517 (Why is no real title available?)
• scientific article; zbMATH DE number 953062 (Why is no real title available?)
• Genetic Algorithms and Heuristic Rules for Solving the Nesting Problem in the Package Industry
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing 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 Q3126375)