Color constrained combinatorial optimization problems

DOI10.1016/0167-6377(91)90061-SzbMath0745.90061OpenAlexW2060093257MaRDI QIDQ1178732

Franz Rendl, Horst W. Hamacher

Publication date: 26 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90061-s

zbMATH Keywords

polynomial algorithms3-matroid intersectioncolor constraintscolored bipartite matching

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Biobjective optimization problems on matroids with binary costs ⋮ On generalized balanced optimization problems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid optimization with the interleaving of two ordered sets
• A strongly polynomial minimum cost circulation algorithm
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
• A multiply constrained matroid optimization problem
• Efficient algorithms for a family of matroid intersection problems
• k-Best constrained bases of a matroid
• Two algorithms for weighted matroid intersection

This page was built for publication: Color constrained combinatorial optimization problems