scientific article; zbMATH DE number 3422402

Publication date 1970

Linear programming (90C05) Combinatorial aspects of block designs (05B05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Structure theory of lattices (06B05) Graph theory (05Cxx) Designs and configurations (05Bxx)

Cited in

(only showing first 100 items - show all)

Proving total dual integrality with cross-free families—A general framework
Structural theorems for submodular functions, polymatroids and polymatroid intersections
On matroids induced by packing subgraphs
Inverse problems and derivatives of determinants
A novel probabilistic formulation for locating and sizing emergency medical service stations
A framework of discrete DC programming by discrete convex analysis
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
On cardinality constrained polymatroids
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
Linear spaces, transversal polymatroids and ASL domains
Packing rooted directed cuts in a weighted directed graph
Randomized priority algorithms
An intersection theorem for supermatroids
A faster algorithm for computing the strength of a network
A note on Frank's generalized polymatroids
Two algorithms for weighted matroid intersection
Pseudomatroids
Separating from the dominant of the spanning tree polytope
On the combinatorial lower bound for the extension complexity of the spanning tree polytope
Directed submodularity, ditroids and directed submodular flows
Bases-cobases graphs and polytopes of matroids
On set functions that can be extended to convex functionals
Immersing complete digraphs
On rank-critical matrix spaces
On the number of common bases of two matroids
Poset matching---a distributive analog of independent matching
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
\(K\)-classes for matroids and equivariant localization
Discrete convexity and unimodularity. I.
Eisenberg-Gale markets: algorithms and game-theoretic properties
\(M\)-convex functions and tree metrics
A cost-scaling algorithm for \(0-1\) submodular flows
Independent branchings in acyclic digraphs
The greedy algorithm for partially ordered sets
Minimizing a sum of submodular functions
Power control and capacity of spread spectrum wireless networks
A generalization of the space of complete quadrics
A general model for matroids and the greedy algorithm
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Fractional matroid matchings
The optimal path-matching problem
Total dual integrality and integer polyhedra
The English auction with differentiated commodities
Choice functions
Structures of polyhedra determined by submodular functions on crossing families
A generalization of max flow—min cut
A fully combinatorial algorithm for submodular function minimization.
Tropical flag varieties
Random matroids
The facets of the spanning trees polytope
Matroids on convex geometries (cg-matroids)
Submodular functions in graph theory
On matroid intersections
Fuzzy bases of fuzzy independent set systems
Covering skew-supermodular functions by hypergraphs of minimum total size
On totally dual integral systems
Recent trends in combinatorial optimization
Discrete convex analysis
Submodular functions: learnability, structure, and optimization
Decomposition of submodular functions
Co-2-plex vertex partitions
A Hierarchical Model for Cooperative Games
On finding optimal polytrees
Dynamic linear programming games with risk-averse players
An exchange theorem for bases of matroids
Sparse hypergraphs and pebble game algorithms
The nucleon of cooperative games and an algorithm for matching games
Survivable networks, linear programming relaxations and the parsimonious property
A convex representation of totally balanced games
My experiences as a student and researcher in OR during the 1960's and 70's
Some combinatorial properties of discriminants in metric vector spaces
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
Extension of M-convexity and L-convexity to polyhedral convex functions
Solving combinatorial problems with combined min-max-min-sum objective and applications
On fuzzification of matroids
Discrete polymatroids
On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
Crashing a maximum-weight complementary basis
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
\(b\)-matching degree-sequence polyhedra
Solution concepts for games with general coalitional structure
The Euler circuit theorem for binary matroids
Greedoids from flames
Structural properties of matroid matchings
A greedy algorithm for solving a certain class of linear programmes
Combined connectivity augmentation and orientation problems
Tropical cycles and Chow polytopes
Independence-domination duality
Elimination for generic sparse polynomial systems
On the expansion of combinatorial polytopes
Minimum cut problem using bases of extended polymatroids
Generalized Wong sequences and their applications to Edmonds' problems
Weakly Modular Graphs and Nonpositive Curvature
On matroid parity and matching polytopes
Cooperative colorings of trees and of bipartite graphs
Polyhedral structure of submodular and posi-modular systems
Minimum cost source location problem with local 3-vertex-connectivity requirements
A vector exchange property of submodular systems

This page was built for publication:

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