Optimal assignments in an ordered set: An application of matroid theory
From MaRDI portal
Publication:5593829
DOI10.1016/S0021-9800(68)80039-0zbMath0197.00803OpenAlexW2136499036MaRDI QIDQ5593829
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(68)80039-0
Related Items
A framework for the greedy algorithm, BASES AND CIRCUITS OF FUZZIFYING MATROIDS, Combinatorics of the geometry of Wilson loop diagrams II: Grassmann necklaces, dimensions, and denominators, Evolutionary algorithms and matroid optimization problems, A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids, Dynamic matchings in left vertex weighted convex bipartite graphs, Formal barriers to simple algorithms for the matroid secretary problem, Generalized polymatroids and submodular flows, On exchange properties for Coxeter matroids and oriented matroids, Bimatroids and Gauss decomposition, The delta-sum of matching delta-matroids, From Grassmann necklaces to restricted permutations and back again, Fast Dynamic Weight Matchings in Convex Bipartite Graphs, The traveling-salesman problem and minimum spanning trees: Part II, The greedy algorithm for partially ordered sets, Shadows of Newton polytopes, Bases axioms and circuits axioms for fuzzifying matroids, Greedy algorithm and symmetric matroids, A note on some algorithms for matroids, A new greedy algorithm for the quadratic assignment problem, An effective solution to convex 1-body \(N\)-representability, The nullities for \(M\)-fuzzifying matroids, A greedy algorithm for solving a certain class of linear programmes, On optimal distribution of output from a jointly owned resource, Probabilistic single processor scheduling, Valuated matroids: A new look at the greedy algorithm, Tropical Kirchhoff's formula and postoptimality in matroid optimization, The free product of M-fuzzifying matroids1, Einige Aspekte in der Zuordnungstheorie, A greedy-algorithm characterization of valuated \(\Delta\)-matroids, Sign variation, the Grassmannian, and total positivity, Persistency in combinatorial optimization problems on matroids, A greedy algorithm for maximizing a linear objective function, Active orders for matroid bases, Categories of bi-fuzzy pre-matroids, Matroids, generalized networks, and electric network synthesis, Orbits in \((\mathbb{P}^r)^n\) and equivariant quantum cohomology, The rank function of a positroid and non-crossing partitions, A general model for matroids and the greedy algorithm, A disturbed version of the greedy algorithm, The \(S\)-digraph optimization problem and the greedy algorithm, Flats of a positroid from its decorated permutation, Approximation algorithms for minimum tree partition, A matroid generalization of a theorem of Mendelsohn and Dulmage, A new approach to the fuzzification of matroids, \((L,M)\)-fuzzy matroids, Quasi-matroidal classes of ordered simplicial complexes, A geometric characterization of Coxeter matroids, Arbres minimaux d'un graphe preordonne, \(\Delta\)-matroids with the strong exchange conditions, Flag matroids: algebra and geometry, Poincaré Polynomials of Odd Diagram Classes, An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
