Complexity of One Packing Optimization Problem

Complexity of One Packing Optimization Problem

The authors consider packing optimization for elements of a square matrix, which are given by positive integers, into blocks of fixed size. The problem is formulated and its combinatorial intractability is discussed. The problem is proved to be NP-complete. This is done by polynomial reduction of an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2016, Vol.52 (1), p.76-84
Hauptverfasser: Trofymchuk, O. M., Vasyanin, V. A., Kuzmenko, V. N.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Artificial Intelligence
Combinatorial analysis
Complexity
Control
Cybernetics
Integers
Mathematics
Mathematics and Statistics
Optimization
Packing problem
Polynomials
Processor Architectures
Reduction
Software Engineering/Programming and Operating Systems
Studies
Systems analysis
Systems Theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The authors consider packing optimization for elements of a square matrix, which are given by positive integers, into blocks of fixed size. The problem is formulated and its combinatorial intractability is discussed. The problem is proved to be NP-complete. This is done by polynomial reduction of an NP-complete minimum-cost integer multicommodity flow problem to this problem.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-016-9802-9