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)

Independence-domination duality
Valuative invariants for polymatroids
On Submodular Search and Machine Scheduling
Minimum cuts in parametric networks
\(M\)-convex functions and tree metrics
Random matroids
The divisor class group of a discrete polymatroid
Polypositroids
Semimodular Functions and Combinatorial Geometries
Activity optimization games with complementarity
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Submodular function minimization and polarity
A game theoretic approach to a problem in polymatroid maximization
k-edge connected polyhedra on series-parallel graphs
Extension of M-convexity and L-convexity to polyhedral convex functions
Separating from the dominant of the spanning tree polytope
Minimum cut problem using bases of extended polymatroids
A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
Semiantichains and Unichain Coverings in Direct Products of Partial Orders
A greedy algorithm for solving ordinary transportation problem with capacity constraints
My experiences as a student and researcher in OR during the 1960's and 70's
A submodular optimization problem with side constraints
The bipermutahedron
Structural theorems for submodular functions, polymatroids and polymatroid intersections
Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes
The polytope algebra of generalized permutahedra
A generalization of max flow—min cut
On the number of common bases of two matroids
Submodularity in Conic Quadratic Mixed 0–1 Optimization
Axioms for infinite matroids
Survivable networks, linear programming relaxations and the parsimonious property
A note on optimal covering augmentation for graphic polymatroids.
Crashing a maximum-weight complementary basis
A discrete convex min-max formula for box-TDI polyhedra
Polymatroids, closure operators and lattices
Combined connectivity augmentation and orientation problems
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
Multi-splits and tropical linear spaces from nested matroids
Rigid cylindrical frameworks with two coincident points
Resolution of ideals associated to subspace arrangements
Matroids from hypersimplex splits
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Minimizing convex functions with rational minimizers
A characterisation of the generic rigidity of 2-dimensional point-line frameworks
Packing Steiner trees
A note on Frank's generalized polymatroids
Minimum cost source location problem with local 3-vertex-connectivity requirements
Total dual integrality and integer polyhedra
Submodular linear programs on forests
A fully combinatorial algorithm for submodular function minimization.
The nucleon of cooperative games and an algorithm for matching games
The convex hull of two core capacitated network design problems
Improving graph partitions using submodular functions.
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
Structural aspects of ordered polymatroids
Contractors' minimum spanning tree
The Paulsen problem made simple
Vertices of Schubitopes
Minimizing a sum of submodular functions
Is submodularity testable?
A faster algorithm for computing the principal sequence of partitions of a graph
Stiefel tropical linear spaces
Covering skew-supermodular functions by hypergraphs of minimum total size
Orientations and detachments of graphs with prescribed degrees and connectivity
Core-based criterion for extreme supermodular functions
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
On set functions that can be extended to convex functionals
Some recent results in combinatorial approaches to dynamical systems
On some algorithmic aspects of hypergraphic matroids
On the generalized minimum spanning tree problem
Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Convexity of integer veto and elimination procedures
Chvátal-Gomory cuts for the Steiner tree problem
Tropical flag varieties
On the \(k\)-cut problem
Polymatroid greedoids
Discrete polymatroids satisfying a stronger symmetric exchange property
Immersing complete digraphs
Bases-cobases graphs and polytopes of matroids
A generalization of the space of complete quadrics
Bimatroids and invariants
Submodular functions: learnability, structure, and optimization
On the concavity of delivery games
An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
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
Decomposition of submodular functions
Core stability of the Shapley value for cooperative games
b-matching degree-sequence polyhedra
Fuzzy bases of fuzzy independent set systems
Super-modularity: Applications to convex games and to the greedy algorithm for LP
Pseudomatroids
Directed submodularity, ditroids and directed submodular flows
Choice functions in the intersection of matroids
A good algorithm for edge-disjoint branching
Universal Tutte characters via combinatorial coalgebras
On the ratio of optimal integral and fractional covers
A characterization of matroidal systems of inequalities

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)