Complexity and approximability results for slicing floorplan designs

Author： Deneko V.G.   Woeginger G.J.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.149, Iss.3, 2003-09, pp. : 533-539

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Generalized p-Center problems: Complexity results and approximation algorithms

By Hochbaum D.S.   Pathria A.  

European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. : 594-607

Elsevier

Access to resources Recommend Favorite

VLSI floorplan repair using dynamic white-space management, constraint graphs, and linear programming

By Vorwerk Kristoffer  

Engineering Optimization, Vol. 40, Iss. 6, 2008-06 ,pp. : 559-577

Taylor & Francis Ltd

Access to resources Recommend Favorite

Study on the Slicing of Sapphire Using a Wire Tool

By  

Advanced Materials Research, Vol. 2015, Iss. 806, 2015-12 ,pp. : 333-337

Trans Tech Publications

Access to resources Recommend Favorite

Heuristic optimization of experimental designs

By Lejeune M.A.  

European Journal of Operational Research, Vol. 147, Iss. 3, 2003-06 ,pp. : 484-498

Elsevier

Access to resources Recommend Favorite

Layout designs in cellular manufacturing

By Bazargan-Lari M.  

European Journal of Operational Research, Vol. 112, Iss. 2, 1999-01 ,pp. : 258-272

Elsevier

Access to resources Recommend Favorite