Publication:5684698
From MaRDI portal
zbMath0268.05019MaRDI QIDQ5684698
Publication date: 1970
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
90C05: Linear programming
05B05: Combinatorial aspects of block designs
05B35: Combinatorial aspects of matroids and geometric lattices
06B05: Structure theory of lattices
05Cxx: Graph theory
05Bxx: Designs and configurations
Related Items
Semimodular Functions and Combinatorial Geometries, On set functions that can be extended to convex functionals, Total dual integrality and integer polyhedra, A cost-scaling algorithm for \(0-1\) submodular flows, Bases-cobases graphs and polytopes of matroids, Poset matching---a distributive analog of independent matching, Submodular functions in graph theory, Survivable networks, linear programming relaxations and the parsimonious property, The convex hull of two core capacitated network design problems, The greedy algorithm for partially ordered sets, Matroid matching and some applications, Discrete extremal problems, Using separation algorithms to generate mixed integer model reformulations, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, \(b\)-matching degree-sequence polyhedra, Euclidean semi-matchings of random samples, Crashing a maximum-weight complementary basis, Paths on polymatroids, Structural properties of matroid matchings, Dilworth truncations and \(k\)-induced matroids, Separating from the dominant of the spanning tree polytope, Invertibility of the base Radon transform of a matroid, Extreme convex set functions with finite carrier: General theory, A good algorithm for edge-disjoint branching, Random matroids, The Euler circuit theorem for binary matroids, On the ratio of optimal integral and fractional covers, The matroids with the max-flow min-cut property, Bimatroids and invariants, Matroids on partially ordered sets, The optimal path-matching problem, On the concavity of delivery games, Greedy sets and related problems, Fenchel-type duality for matroid valuations, The nucleon of cooperative games and an algorithm for matching games, Discrete convex analysis, A necessary and sufficient condition for the convexity in oligopoly games, Independent branchings in acyclic digraphs, The computational complexity of some problems of linear algebra, On fuzzification of matroids, Some recent results in the analysis of greedy algorithms for assignment problems, A faster algorithm for computing the strength of a network, The Steiner tree polytope and related polyhedra, Compatible systems of representatives, Extreme convex set functions with many nonnegative differences, Equilibrium in a market of intellectual goods, On the complexity of testing membership in the core of min-cost spanning tree games, A short proof of optimality of the bottom up algorithm for discrete resource allocation problems, Minimum cut problem using bases of extended polymatroids, On the graphic matroid parity problem, Improved bound for the Carathéodory rank of the bases of a matroid, The linear delta-matroid parity problem, Hamiltonian double Latin squares, A push-relabel framework for submodular function minimization and applications to parametric optimization, On decomposing a hypergraph into \(k\) connected sub-hypergraphs, Combined connectivity augmentation and orientation problems, Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability, A greedy algorithm for convex geometries, New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities., Improving graph partitions using submodular functions., A greedy algorithm for some classes of integer programs., Application of M-convex submodular flow problem to mathematical economics, A constrained independent set problem for matroids, The English auction with differentiated commodities, Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness, A note on optimal covering augmentation for graphic polymatroids., Minimum cost source location problem with vertex-connectivity requirements in digraphs, Discrete convexity and unimodularity. I., \(M\)-convex functions and tree metrics, Coordinatewise domain scaling algorithm for M-convex function minimization, Structure of a simple scheduling polyhedron, Fractional matroid matchings, Eigensets and power products of a bimatroid, Power control and capacity of spread spectrum wireless networks, Extension of M-convexity and L-convexity to polyhedral convex functions, Polyhedral structure of submodular and posi-modular systems, Finding all common bases in two matroids, A combinatorial algorithm minimizing submodular functions in strongly polynomial time., A fully combinatorial algorithm for submodular function minimization., Discrete polymatroids, Minimum cuts in parametric networks, On games corresponding to sequencing situations with ready times, Submodular linear programs on forests, Structural aspects of ordered polymatroids, On the \(k\)-cut problem, Extremality of submodular functions, An exchange theorem for bases of matroids, Dual greedy polyhedra, choice functions, and abstract convex geometries, A class of extreme convex set functions with finite carrier, \(k\)-edge connected polyhedra on series-parallel graphs, On partitioning two matroids into common independent subsets, Network reinforcement, A greedy algorithm for maximizing a linear objective function, A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows, Parametric properties of the transportation problem and relations to supermatroids, Connected and alternating vectors: Polyhedra and algorithms, Optimal priorities in GI|Gn|1 queue, A greedy algorithm for solving a certain class of linear programmes, Faces for a linear inequality in 0–1 variables, A generalization of max flow—min cut, Packing rooted directed cuts in a weighted directed graph, On the generalized minimum spanning tree problem, Unnamed Item, Blocking and anti-blocking pairs of polyhedra, Matching Theory for Combinatorial Geometries, Independent spanning trees with small depths in iterated line digraphs, A strongly polynomial time algorithm for a constrained submodular optimization problem
