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
The convex hull of two core capacitated network design problems
Independent spanning trees with small depths in iterated line digraphs
Supermodular functions on finite lattices
Explicit convex and concave envelopes through polyhedral subdivisions
A characterisation of the generic rigidity of 2-dimensional point-line frameworks
Packing Steiner trees
On submodular function minimization
The rectilinear Steiner tree problem with given topology and length restrictions
Matroids on partially ordered sets
Extended formulations for independence polytopes of regular matroids
Embedding rectilinear Steiner trees with length restrictions
Antistrong digraphs
scientific article; zbMATH DE number 7378329 (Why is no real title available?)
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
On some algorithmic aspects of hypergraphic matroids
Tropical computations in \texttt{polymake}
Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems
Semimodular Functions and Combinatorial Geometries
Core-based criterion for extreme supermodular functions
On games corresponding to sequencing situations with ready times
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
Polyhedra with the integer Carathéodory property
Four proofs of Gittins' multiarmed bandit theorem
The polytope algebra of generalized permutahedra
Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
Fractional covers for forests and matchings
The Steiner tree polytope and related polyhedra
The matroids with the max-flow min-cut property
Matroid matching and some applications
Theta rank, levelness, and matroid minors
An out-of-kilter method for submodular flows
The popular matching and condensation problems under matroid constraints
On the ratio of optimal integral and fractional covers
Sequencing unreliable jobs on parallel machines
A class of extreme convex set functions with finite carrier
Finding feasible vectors of Edmonds-Giles polyhedra
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Faces for a linear inequality in 0–1 variables
Integer Rounding for Polymatroid and Branching Optimization Problems
Blocking and anti-blocking pairs of polyhedra
Maximization of submodular functions: theory and enumeration algorithms
Rooted \(k\)-connections in digraphs
Structure of a simple scheduling polyhedron
Generalized polymatroids and submodular flows
On Minkowski sums of simplices
Extremality of submodular functions
On the concavity of delivery games
Using separation algorithms to generate mixed integer model reformulations
Efficient computation of optimal auctions via reduced forms

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)