Matroid-constrained number partitioning
id:
matroid-constrained-number-partitioning-271-12924599
title:
Matroid-constrained number partitioning
text:
Matroid-constrained number partitioning is a variant of the multiway number partitioning problem, in which the subsets in the partition should be independent sets of a matroid. The input to this problem is a set S of items, a positive integer m, and some m matroids over the same set S. The goal is to partition S into m subsets, such that each subset i is an independent set in matroid i. Subject to this constraint, some objective function should be minimized, for example, minimizing the largest s
brand slug:
wiki
category slug:
encyclopedia
description:
Matroid theory
original url:
https://en.wikipedia.org/wiki/Matroid-constrained_number_partitioning
date created:
date modified:
2023-08-18T23:07:42Z
main entity:
{"identifier":"Q109297384","url":"https://www.wikidata.org/entity/Q109297384"}
image:
fields total:
13
integrity:
14