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)

A tractable class of binary VCSPs via M-convex intersection
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Towards using the chordal graph polytope in learning decomposable models
Vertices of Schubitopes
Anti-Ramsey number of edge-disjoint rainbow spanning trees
Generic symmetry-forced infinitesimal rigidity: translations and rotations
Submodular optimization problems and greedy strategies: a survey
Strong formulations for conic quadratic optimization with indicator variables
A discrete convex min-max formula for box-TDI polyhedra
A primal-dual algorithm for the minimum partial set multi-cover problem
Rigidity of frameworks on expanding spheres
Decreasing minimization on M-convex sets: background and structures
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
Linear matroid intersection is in quasi-NC
Optimal matroid partitioning problems
Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
Deformation cones of graph associahedra and nestohedra
Randomized selection algorithm for online stochastic unrelated machines scheduling
Matroids are not Ehrhart positive
Universal Tutte polynomial
Optimal matroid partitioning problems
Power of \(k\) choices and rainbow spanning trees in random graphs
A proof of Rado's theorem via principal extension
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Submodular optimization views on the random assignment problem
The Paulsen problem made simple
A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
Submodularity in Conic Quadratic Mixed 0–1 Optimization
On Submodular Search and Machine Scheduling
A generalized-polymatroid approach to disjoint common independent sets in two matroids
Lifted polymatroid inequalities for mean-risk optimization with indicator variables
Approximating the least core value and least core of cooperative games with supermodular costs
On partitioning two matroids into common independent subsets
Stochastic packing integer programs with few queries
Computing in combinatorial optimization
Minkowski summands of cubes
The Paulsen problem made simple
Minkowski summands of cubes
An exact cutting plane method for \(k\)-submodular function maximization
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
Celebrating Loday's associahedron
Facets of the independent path-matching polytope
Choice functions in the intersection of matroids
Fair integral submodular flows
Reachability in arborescence packings
Gaussian downlink user selection subject to access limit, power budget, and rate demands
Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
\(b\)-matching degree-sequence polyhedra
Solution concepts for games with general coalitional structure
The Euler circuit theorem for binary matroids
Greedoids from flames
Structural properties of matroid matchings
A greedy algorithm for solving a certain class of linear programmes
Combined connectivity augmentation and orientation problems
Tropical cycles and Chow polytopes
Independence-domination duality
Elimination for generic sparse polynomial systems
On the expansion of combinatorial polytopes
Minimum cut problem using bases of extended polymatroids
Generalized Wong sequences and their applications to Edmonds' problems
Weakly Modular Graphs and Nonpositive Curvature
On matroid parity and matching polytopes
Cooperative colorings of trees and of bipartite graphs
Polyhedral structure of submodular and posi-modular systems
Minimum cost source location problem with local 3-vertex-connectivity requirements
A vector exchange property of submodular systems
A decomposition property of polyhedra
Bimatroids and invariants
Matchings and \(\Delta\)-matroids
A good algorithm for edge-disjoint branching
Equivalence of permutation polytopes corresponding to strictly supermodular functions
Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity
George Dantzig's impact on the theory of computation
Note on pseudolattices, lattices and submodular linear programs
Minimum cuts in parametric networks
Greedy sets and related problems
A strongly polynomial time algorithm for a constrained submodular optimization problem
On the graphic matroid parity problem
Monge extensions of cooperation and communication structures
Network reinforcement
A greedy algorithm for some classes of integer programs.
A greedy algorithm for convex geometries
A note on matchings and separability
Complexity of tropical Schur polynomials
Greedoid polyhedra
Submodular linear programs on forests
A note on the implications of approximate submodularity in discrete optimization
A strongly polynomial algorithm for line search in submodular polyhedra
Some recent results in the analysis of greedy algorithms for assignment problems
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
On box totally dual integral polyhedra
Integral decomposition in polyhedra
A faster algorithm for computing the principal sequence of partitions of a graph
The Hopf monoid and the basic invariant of directed graphs
Dual greedy polyhedra, choice functions, and abstract convex geometries
Polymatroid greedoids

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)