MATROID INTERSECTION WITH PRIORITY CONSTRAINTS

From MaRDI portal

Revision as of 01:54, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5403864

Jump to:navigation, search

DOI10.15807/jorsj.56.15zbMath1288.90077OpenAlexW2169872223MaRDI QIDQ5403864

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

matching discrete optimization Dulmage-Mendelsohn decomposition

Mathematics Subject Classification ID

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

Related Items (2)

Popular Matchings with Ties and Matroid Constraints ⋮ Approximation by lexicographically maximal solutions in matching and matroid intersection problems

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5403864&oldid=20143663"