scientific article; zbMATH DE number 3422402

zbMATH Open0268.05019MaRDI QIDQ5684698FDOQ5684698

Publication date: 1970

Title of this publication is not available (Why is that?)

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)

Independence-domination duality
Minimum cuts in parametric networks
Minimum cut problem using bases of extended polymatroids
On the number of common bases of two matroids
Combined connectivity augmentation and orientation problems
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
Minimum cost source location problem with local 3-vertex-connectivity requirements
Submodular linear programs on forests
Structural aspects of ordered polymatroids
A faster algorithm for computing the principal sequence of partitions of a graph
Polymatroid greedoids
On the \(k\)-cut problem
Core stability of the Shapley value for cooperative games
Bimatroids and invariants
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
\(b\)-matching degree-sequence polyhedra
A good algorithm for edge-disjoint branching
Explicit bounds for graph minors
The linear delta-matroid parity problem
The Euler circuit theorem for binary matroids
A decomposition property of polyhedra
A greedy algorithm for convex geometries
A note on the implications of approximate submodularity in discrete optimization
Some recent results in the analysis of greedy algorithms for assignment problems
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
On the expansion of combinatorial polytopes
Cooperative colorings of trees and of bipartite graphs
Polyhedral structure of submodular and posi-modular systems
Branch-and-price approaches for the network design problem with relays
Greedy sets and related problems
Integral decomposition in polyhedra
Monge extensions of cooperation and communication structures
A strongly polynomial algorithm for line search in submodular polyhedra
Inequalities on submodular functions via term rewriting
Complexity of tropical Schur polynomials
Dual greedy polyhedra, choice functions, and abstract convex geometries
Weakly Modular Graphs and Nonpositive Curvature
A vector exchange property of submodular systems
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
Elimination for generic sparse polynomial systems
Generalized Wong sequences and their applications to Edmonds' problems
On matroid parity and matching polytopes
Hopf Monoids and Generalized Permutahedra
Bisubmodular polyhedra, simplicial divisions, and discrete convexity
Matchings and \(\Delta\)-matroids
Network reinforcement
A correct response model in knowledge structure theory
Solution concepts for games with general coalitional structure
Structural properties of matroid matchings
On the graphic matroid parity problem
The Hopf monoid and the basic invariant of directed graphs
A greedy algorithm for solving a certain class of linear programmes
Tropical cycles and Chow polytopes
Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity
A note on matchings and separability
Greedoids from flames
Parametric properties of the transportation problem and relations to supermatroids
Equivalence of permutation polytopes corresponding to strictly supermodular functions
George Dantzig's impact on the theory of computation
Note on pseudolattices, lattices and submodular linear programs
Greedoid polyhedra
Hamiltonian double Latin squares
A note on submodular set cover on matroids
\(M\)-convex functions and tree metrics
Random matroids
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
Extension of M-convexity and L-convexity to polyhedral convex functions
Separating from the dominant of the spanning tree polytope
A generalization of max flow—min cut
My experiences as a student and researcher in OR during the 1960's and 70's
Structural theorems for submodular functions, polymatroids and polymatroid intersections
Survivable networks, linear programming relaxations and the parsimonious property
Crashing a maximum-weight complementary basis
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
A note on Frank's generalized polymatroids
Total dual integrality and integer polyhedra
A fully combinatorial algorithm for submodular function minimization.
The nucleon of cooperative games and an algorithm for matching games
Minimizing a sum of submodular functions
Covering skew-supermodular functions by hypergraphs of minimum total size
On set functions that can be extended to convex functionals
A generalization of the space of complete quadrics
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Tropical flag varieties
Bases-cobases graphs and polytopes of matroids
Immersing complete digraphs
Fuzzy bases of fuzzy independent set systems
Decomposition of submodular functions
Pseudomatroids
Directed submodularity, ditroids and directed submodular flows
An exchange theorem for bases of matroids
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Discrete convexity and unimodularity. I.
On the combinatorial lower bound for the extension complexity of the spanning tree polytope
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
Choice functions
Fractional matroid matchings
On totally dual integral systems
Discrete polymatroids
The English auction with differentiated commodities

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)