AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
From MaRDI portal
Publication:4116278
DOI10.15807/jorsj.19.32zbMath0346.90062OpenAlexW2110568274MaRDI QIDQ4116278
Publication date: 1976
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.19.32
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Convexity and Steinitz's exchange property, Matroid bases with cardinality constraints on the intersection, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Shortest bibranchings and valuated matroid intersection, Packing of arborescences with matroid constraints via matroid intersection, The \(b\)-branching problem in digraphs, Two algorithms for weighted matroid intersection, Matroid Intersection under Restricted Oracles, Unnamed Item, A Weighted Linear Matroid Parity Algorithm, On finding optimal polytrees, Crashing a maximum-weight complementary basis, On Some Problems in the Design of Plane Skeletal Structures, Structures of polyhedra determined by submodular functions on crossing families, Matroids, generalized networks, and electric network synthesis, The Held—Karp algorithm and degree-constrained minimum 1-trees, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Pareto Stable Matchings under One-Sided Matroid Constraints, Exact and approximation algorithms for weighted matroid intersection, Unnamed Item, Boolean sublattices connected with minimization problems on matroids, Fenchel-type duality for matroid valuations, Discrete convex analysis
