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)

A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
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
Submodularity in Conic Quadratic Mixed 0–1 Optimization
A discrete convex min-max formula for box-TDI polyhedra
An improved integrality gap for asymmetric TSP paths
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Vertices of Schubitopes
Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
Choice functions in the intersection of matroids
The Paulsen problem made simple
Submodular optimization views on the random assignment problem
Matroids are not Ehrhart positive
Universal Tutte polynomial
A proof of Rado's theorem via principal extension
A tractable class of binary VCSPs via M-convex intersection
Anti-Ramsey number of edge-disjoint rainbow spanning trees
Linear matroid intersection is in quasi-NC
Optimal matroid partitioning problems
Optimal matroid partitioning problems
Strong formulations for conic quadratic optimization with indicator variables
Minkowski summands of cubes
Minkowski summands of cubes
Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Generic symmetry-forced infinitesimal rigidity: translations and rotations
A generalized-polymatroid approach to disjoint common independent sets in two matroids
Lifted polymatroid inequalities for mean-risk optimization with indicator variables
On partitioning two matroids into common independent subsets
Fair integral submodular flows
Reachability in arborescence packings
Gaussian downlink user selection subject to access limit, power budget, and rate demands
Approximating the least core value and least core of cooperative games with supermodular costs
A primal-dual algorithm for the minimum partial set multi-cover problem
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
Facets of the independent path-matching polytope
Title not available (Why is that?)
Submodular optimization problems and greedy strategies: a survey
An exact cutting plane method for \(k\)-submodular function maximization
Rigidity of frameworks on expanding spheres
Towards using the chordal graph polytope in learning decomposable models
Computing in combinatorial optimization
Stochastic packing integer programs with few queries
Celebrating Loday's associahedron
Deformation cones of graph associahedra and nestohedra
Randomized selection algorithm for online stochastic unrelated machines scheduling
Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
Decreasing minimization on M-convex sets: background and structures
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
On Submodular Search and Machine Scheduling
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
Blocking and anti-blocking pairs of polyhedra
The structure of crossing separations in matroids
The \(b\)-branching problem in digraphs
Tropical computations in \texttt{polymake}
Four proofs of Gittins' multiarmed bandit theorem
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Algorithms for tight spans and tropical linear spaces
Edge-disjoint rainbow spanning trees in complete graphs
Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems
Remarkable polyhedra related to set functions, games and capacities
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Extreme convex set functions with finite carrier: General theory
Explicit convex and concave envelopes through polyhedral subdivisions
Finding feasible vectors of Edmonds-Giles polyhedra
Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
A push-relabel framework for submodular function minimization and applications to parametric optimization
Looking for edge-equitable spanning trees
Polynomially computable bounds for the probability of the union of events
The Steiner tree polytope and related polyhedra
An out-of-kilter method for submodular flows
Generalized polymatroids and submodular flows
On the complexity of testing membership in the core of min-cost spanning tree games
On stable set polyhedra for K//(1,3)free graphs
The matroids with the max-flow min-cut property
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
On a generalization of the Ryser-Brualdi-Stein conjecture
A necessary and sufficient condition for the convexity in oligopoly games
Extremality of submodular functions

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)