MATROID INTERSECTION WITH PRIORITY CONSTRAINTS

DOI10.15807/JORSJ.56.15MaRDI QIDQ5403864zbMATH OpenOpenAlexFDO

Authors Naoyuki Kamiyama

Publication date 19 March 2014

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.56.15

zbMATH Keywords

discrete optimizationDulmage-Mendelsohn decompositionmatching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cited in

(2)

• Approximation by lexicographically maximal solutions in matching and matroid intersection problems
• Popular matchings with ties and matroid constraints

This page was built for publication: MATROID INTERSECTION WITH PRIORITY CONSTRAINTS

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