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)

\(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
A decomposition property of polyhedra
Bimatroids and invariants
Matchings and \(\Delta\)-matroids
A good algorithm for edge-disjoint branching
Equivalence of permutation polytopes corresponding to strictly supermodular functions
Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity
George Dantzig's impact on the theory of computation
Note on pseudolattices, lattices and submodular linear programs
Minimum cuts in parametric networks
Greedy sets and related problems
A strongly polynomial time algorithm for a constrained submodular optimization problem
On the graphic matroid parity problem
Monge extensions of cooperation and communication structures
Network reinforcement
A greedy algorithm for some classes of integer programs.
A greedy algorithm for convex geometries
A note on matchings and separability
Complexity of tropical Schur polynomials
Greedoid polyhedra
Submodular linear programs on forests
A note on the implications of approximate submodularity in discrete optimization
A strongly polynomial algorithm for line search in submodular polyhedra
Some recent results in the analysis of greedy algorithms for assignment problems
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
On box totally dual integral polyhedra
Integral decomposition in polyhedra
A faster algorithm for computing the principal sequence of partitions of a graph
The Hopf monoid and the basic invariant of directed graphs
Dual greedy polyhedra, choice functions, and abstract convex geometries
Polymatroid greedoids
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
On the \(k\)-cut problem
Parametric properties of the transportation problem and relations to supermatroids
Branch-and-price approaches for the network design problem with relays
Hopf Monoids and Generalized Permutahedra
Inequalities on submodular functions via term rewriting
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
Core stability of the Shapley value for cooperative games
Hamiltonian double Latin squares
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
Structural aspects of ordered polymatroids
A correct response model in knowledge structure theory
Bisubmodular polyhedra, simplicial divisions, and discrete convexity
The linear delta-matroid parity problem
A note on submodular set cover on matroids
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

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)