scientific article; zbMATH DE number 3422402

Publication date 1970

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matroids and geometric lattices (05B35) Designs and configurations (05Bxx) Graph theory (05Cxx) Structure theory of lattices (06B05) Linear programming (90C05)

Cited in

(only showing first 100 items - show all)

A general model for matroids and the greedy algorithm
The \(S\)-digraph optimization problem and the greedy algorithm
Rooted \(k\)-connections in digraphs
Maximization of submodular functions: theory and enumeration algorithms
Covering skew-supermodular functions by hypergraphs of minimum total size
Sparse hypergraphs and pebble game algorithms
A note on submodular set cover on matroids
Decomposition of submodular functions
Testing membership in matroid polyhedra
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Some combinatorial properties of discriminants in metric vector spaces
Activity optimization games with complementarity
An out-of-kilter method for submodular flows
Greedoid polyhedra
On submodular function minimization
On matroids induced by packing subgraphs
Pseudomatroids
Convexity of integer veto and elimination procedures
Generalized polymatroids and submodular flows
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
Directed submodularity, ditroids and directed submodular flows
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
A characterization of matroidal systems of inequalities
Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
Combinatorial dynamical system theory: General framework and controllability criteria
The greedy algorithm for partially ordered sets
Matroid matching and some applications
Discrete extremal problems
Super-modularity: Applications to convex games and to the greedy algorithm for LP
On matroid intersections
On stable set polyhedra for K//(1,3)free graphs
Using separation algorithms to generate mixed integer model reformulations
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
b-matching degree-sequence polyhedra
Euclidean semi-matchings of random samples
Crashing a maximum-weight complementary basis
Paths on polymatroids
Structural properties of matroid matchings
Dilworth truncations and \(k\)-induced matroids
Separating from the dominant of the spanning tree polytope
Invertibility of the base Radon transform of a matroid
Extreme convex set functions with finite carrier: General theory
A good algorithm for edge-disjoint branching
Random matroids
The Euler circuit theorem for binary matroids
On the ratio of optimal integral and fractional covers
The matroids with the max-flow min-cut property
Bimatroids and invariants
Matroids on partially ordered sets
The optimal path-matching problem
On the concavity of delivery games
Greedy sets and related problems
Fenchel-type duality for matroid valuations
The nucleon of cooperative games and an algorithm for matching games
Discrete convex analysis
A necessary and sufficient condition for the convexity in oligopoly games
Independent branchings in acyclic digraphs
The computational complexity of some problems of linear algebra
On fuzzification of matroids
Some recent results in the analysis of greedy algorithms for assignment problems
A faster algorithm for computing the strength of a network
The Steiner tree polytope and related polyhedra
Compatible systems of representatives
Extreme convex set functions with many nonnegative differences
Equilibrium in a market of intellectual goods
On the complexity of testing membership in the core of min-cost spanning tree games
A short proof of optimality of the bottom up algorithm for discrete resource allocation problems
Minimum cut problem using bases of extended polymatroids
On the graphic matroid parity problem
Improved bound for the Carathéodory rank of the bases of a matroid
The linear delta-matroid parity problem
Hamiltonian double Latin squares
A push-relabel framework for submodular function minimization and applications to parametric optimization
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Combined connectivity augmentation and orientation problems
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
A greedy algorithm for convex geometries
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Improving graph partitions using submodular functions.
A greedy algorithm for some classes of integer programs.
Application of M-convex submodular flow problem to mathematical economics
A constrained independent set problem for matroids
The English auction with differentiated commodities
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
A note on optimal covering augmentation for graphic polymatroids.
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Universal Tutte characters via combinatorial coalgebras
Matroid optimisation problems with nested non-linear monomials in the objective function
Strong formulations for quadratic optimization with M-matrices and indicator variables
Branch-and-price approaches for the network design problem with relays
Matrix orbit closures
Cores and Weber sets for fuzzy extensions of cooperative games
On rank-critical matrix spaces
Syzygies on Tutte polynomials of freedom matroids
Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
The connected facility location polytope
Fair representation in dimatroids
Polyhedra and parameter spaces for matroids over valuation rings
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
A greedy algorithm for solving ordinary transportation problem with capacity constraints

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)