Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Variable Decomposition, Constraint Decomposition and Cross Decomposition in General Mathematical Programming Read chapter Read first chapter

1992 | OriginalPaper | Chapter

A Set Covering Formulation of the Matrix Equipartition Problem

Authors : S. Nicoloso, P. Nobili

Published in: Combinatorial Optimization

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

This paper is concerned with a certain NP-hard matrix decomposition problem (Matrix Equipartition). Given a (0, 1)-matrix M with a row set R, Matrix Equipartition consists of finding two equicardinality subsets R1 and R2 of R with maximum size such that every row of R1 is disjoint from every row of R2. Call R3 the set of the remaining rows.

previous chapter Euclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs
next chapter Maximizing a Submodular Function by Integer Programming: A Polyhedral Approach
Metadata
Title
A Set Covering Formulation of the Matrix Equipartition Problem
Authors
S. Nicoloso
P. Nobili
Copyright Year
1992
Publisher
Springer Berlin Heidelberg
Book
Combinatorial Optimization

Print ISBN: 978-3-642-77491-1

Electronic ISBN: 978-3-642-77489-8

Copyright Year: 1992

DOI
https://doi.org/10.1007/978-3-642-77489-8_35

Premium Partner

    Image Credits