Multi-budgeted matching problems

DOI10.1002/NET.21802MaRDI QIDQ4687211zbMATH OpenOpenAlexFDO

Authors Christina Büsing, Martin Comis

Publication date 11 October 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21802

zbMATH Keywords

bounded treewidthbudget constraintscomplexitydynamic programmingmatchingsNice tree decompositionseries-parallel graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Budgeted colored matching problems
• New approaches to multi-objective optimization
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Approximation Schemes for Multi-Budgeted Independence Systems
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle

Cited in

(9)

• Budgeted colored matching problems
• Emergence and dynamics of short food supply chains
• Model-based approaches to multi-attribute diverse matching
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• Editorial: New advances and applications in deterministic and stochastic network optimization
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Minimum <scp>color‐degree</scp> perfect b‐matchings
• Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
• Hierarchical \(b\)-matching

This page was built for publication: Multi-budgeted matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4687211)