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
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
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
A strongly polynomial time algorithm for a constrained submodular optimization problem
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
A greedy algorithm for some classes of integer programs.
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
On box totally dual integral polyhedra
Hamiltonian double Latin squares
A note on submodular set cover on matroids
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
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
Tropical computations in \texttt{polymake}
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

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)