Optimization problems with color-induced budget constraints

DOI10.1007/s10878-017-0182-5zbMath1414.90344OpenAlexW2901078815MaRDI QIDQ1631646

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

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0182-5

zbMATH Keywords

posetsinteger polymatroidsposet matroidsbudget constrained optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint

Cites Work

• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• Matching is as easy as matrix inversion
• The greedy algorithm for partially ordered sets
• Matroid matching and some applications
• 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
• Complexity of Matroid Property Algorithms
• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
• Discrete Convex Analysis