Color constrained combinatorial optimization problems

Color constrained combinatorial optimization problems

0.00 Avg rating—0 Votes
Article ID: iaor1992285
Country: Netherlands
Volume: 10
Issue: 4
Start Page Number: 211
End Page Number: 219
Publication Date: Jun 1991
Journal: Operations Research Letters
Authors: ,
Abstract:

The authors consider combinatorial optimization problems in which each feasible solution contains l1,...,lk elements of a given set of colors E1,...,Ek, respectively. They show how to reduce this problem to a parametric problem with pairwise disjoint colors and derive as special cases polynomial algorithms for one instance of a 3-matroid intersection problem and colored bipartite matching problems.

Reviews

Required fields are marked *. Your email address will not be published.