Uma abordagem particular ao estudo de alguns problemas NP-completos

Authors

Abstract

This work defines a theorectical framework within multicriteria optimization. It makes it possible to prove several results that allow to design a polynomial algorithm for the compaction of slicing floorplans, thus showing that this particular problem is in P. It also lays the ground work for exploring compaction generalization problems that are believed to be NP-complete.

Keywords

Multicriteria optimization, computational complexity, compaction floorplan

Subject

Mathematics - Computer Science

MSc Thesis

Uma abordagem particular ao estudo de alguns problemas NP-completos, April 1994