Optimization Problems with Color-Induced Budget Constraints

DOI10.1007/978-3-319-45587-7_17zbMath1452.90266OpenAlexW2513401197MaRDI QIDQ2835676

Hendrik Lüthen, Britta Peis, Andreas Wierz, Corinna Gottschalk

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_17

zbMATH Keywords

poset matroids, binary trees minimum cost ideal

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• On a multicriteria shortest path problem
• Matching is as easy as matrix inversion
• The greedy algorithm for partially ordered sets
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• A constrained independent set problem for matroids
• Almost exact matchings
• Submodular functions and optimization.
• Efficient algorithms for a family of matroid intersection problems
• The Recognition of Series Parallel Digraphs
• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
• Discrete Convex Analysis

This page was built for publication: Optimization Problems with Color-Induced Budget Constraints