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)

\(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
Submodular functions: learnability, structure, and optimization
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
A faster algorithm for computing the strength of a network
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
Some combinatorial properties of discriminants in metric vector spaces
Eisenberg-Gale markets: algorithms and game-theoretic properties
The optimal path-matching problem
Discrete convex analysis
Sparse hypergraphs and pebble game algorithms
On matroids induced by packing subgraphs
Packing rooted directed cuts in a weighted directed graph
Power control and capacity of spread spectrum wireless networks
Proving total dual integrality with cross-free families—A general framework
Poset matching---a distributive analog of independent matching
A Hierarchical Model for Cooperative Games
Solving combinatorial problems with combined min-max-min-sum objective and applications
On fuzzification of matroids
An intersection theorem for supermatroids
On rank-critical matrix spaces
A general model for matroids and the greedy algorithm
Matroids on convex geometries (cg-matroids)
A novel probabilistic formulation for locating and sizing emergency medical service stations
A framework of discrete DC programming by discrete convex analysis
On cardinality constrained polymatroids
\(K\)-classes for matroids and equivariant localization
The greedy algorithm for partially ordered sets
Linear spaces, transversal polymatroids and ASL domains
Independent branchings in acyclic digraphs
Co-2-plex vertex partitions
On finding optimal polytrees
A convex representation of totally balanced games
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
The facets of the spanning trees polytope
Recent trends in combinatorial optimization
Inverse problems and derivatives of determinants
On matroid intersections
Structures of polyhedra determined by submodular functions on crossing families
Submodular functions in graph theory
Two algorithms for weighted matroid intersection
On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
Randomized priority algorithms
A cost-scaling algorithm for \(0-1\) submodular flows
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Dynamic linear programming games with risk-averse players
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

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)