A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM

DOI10.15807/JORSJ.20.1MaRDI QIDQ4139999zbMATH OpenOpenAlexFDO

Authors Satoru Fujishige

Publication date 1977

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.20.1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited in

(9)

• Negative circuits for flows and submodular flows
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems
• Structures of polyhedra determined by submodular functions on crossing families
• Two algorithms for weighted matroid intersection
• The Held—Karp algorithm and degree-constrained minimum 1-trees
• Pareto stable matchings under one-sided matroid constraints
• Problems on group-labeled matroid bases
• Optimization of the directed spanning trees using the weighted matroid intersection algorithm

This page was built for publication: A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM

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