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 submodular optimization problem with side constraints
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Towards using the chordal graph polytope in learning decomposable models
Finding a stable allocation in polymatroid intersection
Vertices of Schubitopes
Anti-Ramsey number of edge-disjoint rainbow spanning trees
Randomized mechanism design for decentralized network scheduling
Cyclic flats of a polymatroid
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
On the complexity of packing rainbow spanning trees
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
An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
Optimal matroid partitioning problems
Geometric rescaling algorithms for submodular function minimization
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
A note on interconnecting matchings in graphs
Universal Tutte polynomial
Optimal matroid partitioning problems
Power of \(k\) choices and rainbow spanning trees in random graphs
Chvátal-Gomory cuts for the Steiner tree problem
A proof of Rado's theorem via principal extension
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Submodularity and its application to some global constraints
Optimal bounds on approximation of submodular and XOS functions by juntas
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
A 3/2-Approximation for the Metric Many-Visits Path TSP
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
Orientations and detachments of graphs with prescribed degrees and connectivity
Computing in combinatorial optimization
Matroid Intersection under Restricted Oracles
Minkowski summands of cubes
The Paulsen problem made simple
Minkowski summands of cubes
Tautological classes of matroids
An exact cutting plane method for \(k\)-submodular function maximization
The finite matroid-based valuation conjecture is false
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
The \(st\)-bond polytope on series-parallel graphs
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
Proving total dual integrality with cross-free families—A general framework
Structural theorems for submodular functions, polymatroids and polymatroid intersections
On matroids induced by packing subgraphs
Inverse problems and derivatives of determinants
A novel probabilistic formulation for locating and sizing emergency medical service stations
A framework of discrete DC programming by discrete convex analysis
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
On cardinality constrained polymatroids
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
Linear spaces, transversal polymatroids and ASL domains
Packing rooted directed cuts in a weighted directed graph
Randomized priority algorithms
An intersection theorem for supermatroids
A faster algorithm for computing the strength of a network
A note on Frank's generalized polymatroids
Two algorithms for weighted matroid intersection
Pseudomatroids
Separating from the dominant of the spanning tree polytope
On the combinatorial lower bound for the extension complexity of the spanning tree polytope
Directed submodularity, ditroids and directed submodular flows
Bases-cobases graphs and polytopes of matroids
On set functions that can be extended to convex functionals
Immersing complete digraphs
On rank-critical matrix spaces
On the number of common bases of two matroids
Poset matching---a distributive analog of independent matching
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
\(K\)-classes for matroids and equivariant localization
Discrete convexity and unimodularity. I.
Eisenberg-Gale markets: algorithms and game-theoretic properties
\(M\)-convex functions and tree metrics

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)