Multi‐budgeted matching problems

DOI10.1002/net.21802zbMath1397.90323OpenAlexW2782820084MaRDI QIDQ4687211

Martin Comis, Christina Büsing

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

complexitydynamic programmingmatchingsseries-parallel graphsbounded treewidthbudget constraintsNice tree decomposition

Mathematics Subject Classification ID

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

Related Items (3)

Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ New advances and applications in deterministic and stochastic network optimization ⋮ Emergence and dynamics of short food supply chains

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