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)

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

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)