Color constrained combinatorial optimization problems

Authors:
Horst W. Hamacher;Franz Rendl
Affiliations:
Fachbereich Mathematik, Universität Kaiserslautern, FRG;Institut für Mathematik, Technische Universität Graz, Austria
Venue:
Operations Research Letters
Year:
1991

Citing 5
Cited 0

A strongly polynomial minimum cost circulation algorithm

Combinatorica
Two algorithms for weighted matroid intersection

Mathematical Programming: Series A and B
Optimal message routing without complete routing tables

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A multiply constrained matroid optimization problem

Discrete Mathematics - Proceedings of the Oberwolfach Meeting "Kombinatorik," January 19-25, 1986
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider combinatorial optimization problems in which each feasible solution contains l"1,...,l"k elements of a given set of colors E"1,...,E"k, respectively. We 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.