Treffer: Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
Title:
Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
Authors:
Source:
Discrete Applied Mathematics. 116:243-260
Publisher Information:
Elsevier BV, 2002.
Publication Year:
2002
Subject Terms:
Combinatorial optimization, Branch and bound techniques, Integer programming, Matrix partitioning, Applied Mathematics, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, matrix partitioning, 02 engineering and technology, Mathematical problems of computer architecture, Minimax problems in mathematical programming, branch-and-bound techniques
Document Type:
Fachzeitschrift
Article
File Description:
application/xml
Language:
English
ISSN:
0166-218X
DOI:
10.1016/s0166-218x(00)00286-9
Access URL:
https://zbmath.org/1716753
https://doi.org/10.1016/s0166-218x(00)00286-9
https://www.sciencedirect.com/science/article/abs/pii/S0166218X00002869
https://dblp.uni-trier.de/db/journals/dam/dam116.html#MingozziM02
https://www.sciencedirect.com/science/article/pii/S0166218X00002869
https://hdl.handle.net/11585/879665
https://doi.org/10.1016/s0166-218x(00)00286-9
https://www.sciencedirect.com/science/article/abs/pii/S0166218X00002869
https://dblp.uni-trier.de/db/journals/dam/dam116.html#MingozziM02
https://www.sciencedirect.com/science/article/pii/S0166218X00002869
https://hdl.handle.net/11585/879665
Rights:
Elsevier Non-Commercial
Accession Number:
edsair.doi.dedup.....52f7dd2c74b2e6c2a003950d19db2cb3
Database:
OpenAIRE
Weitere Informationen
zbMATH Open Web Interface contents unavailable due to conflicting licenses.