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)

The convex hull of two core capacitated network design problems
Independent spanning trees with small depths in iterated line digraphs
Supermodular functions on finite lattices
Explicit convex and concave envelopes through polyhedral subdivisions
A characterisation of the generic rigidity of 2-dimensional point-line frameworks
Packing Steiner trees
On submodular function minimization
The rectilinear Steiner tree problem with given topology and length restrictions
Matroids on partially ordered sets
Extended formulations for independence polytopes of regular matroids
Embedding rectilinear Steiner trees with length restrictions
Antistrong digraphs
scientific article; zbMATH DE number 7378329 (Why is no real title available?)
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
On some algorithmic aspects of hypergraphic matroids
Tropical computations in \texttt{polymake}
Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems
Semimodular Functions and Combinatorial Geometries
Core-based criterion for extreme supermodular functions
On games corresponding to sequencing situations with ready times
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
Polyhedra with the integer Carathéodory property
Four proofs of Gittins' multiarmed bandit theorem
The polytope algebra of generalized permutahedra
Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
Fractional covers for forests and matchings
The Steiner tree polytope and related polyhedra
The matroids with the max-flow min-cut property
Matroid matching and some applications
Theta rank, levelness, and matroid minors
An out-of-kilter method for submodular flows
The popular matching and condensation problems under matroid constraints
On the ratio of optimal integral and fractional covers
Sequencing unreliable jobs on parallel machines
A class of extreme convex set functions with finite carrier
Finding feasible vectors of Edmonds-Giles polyhedra
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Faces for a linear inequality in 0–1 variables
Integer Rounding for Polymatroid and Branching Optimization Problems
Blocking and anti-blocking pairs of polyhedra
Maximization of submodular functions: theory and enumeration algorithms
Rooted \(k\)-connections in digraphs
Structure of a simple scheduling polyhedron
Generalized polymatroids and submodular flows
On Minkowski sums of simplices
Extremality of submodular functions
On the concavity of delivery games
Using separation algorithms to generate mixed integer model reformulations
Efficient computation of optimal auctions via reduced forms
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
The root location problem for arc-disjoint arborescences
A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
Remarkable polyhedra related to set functions, games and capacities
On a generalization of the Ryser-Brualdi-Stein conjecture
Is submodularity testable?
Extreme convex set functions with finite carrier: General theory
On the complexity of testing membership in the core of min-cost spanning tree games
Exact and approximation algorithms for weighted matroid intersection
Polynomially computable bounds for the probability of the union of events
A necessary and sufficient condition for the convexity in oligopoly games
\(k\)-edge connected polyhedra on series-parallel graphs
Deformation cones of hypergraphic polytopes
The computational complexity of some problems of linear algebra
Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
Pre-emptive scheduling problems with controllable processing times
Paths on polymatroids
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Testing membership in matroid polyhedra
Algorithms for tight spans and tropical linear spaces
On the generalized minimum spanning tree problem
Stiefel tropical linear spaces
Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
Efficient solution methods for a general \(r\)-interdiction median problem with fortification
A push-relabel framework for submodular function minimization and applications to parametric optimization
Axioms for infinite matroids
The structure of crossing separations in matroids
Looking for edge-equitable spanning trees
On stable set polyhedra for K//(1,3)free graphs
Adjacency on polymatroids
Edge-disjoint rainbow spanning trees in complete graphs
The \(b\)-branching problem in digraphs
Improved bound for the Carathéodory rank of the bases of a matroid
Valuative invariants for polymatroids
Super-modularity: Applications to convex games and to the greedy algorithm for LP
Matching Theory for Combinatorial Geometries
Some recent results in combinatorial approaches to dynamical systems
\(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

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)