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
Independence-domination duality
Minimum cuts in parametric networks
Minimum cut problem using bases of extended polymatroids
On the number of common bases of two matroids
Combined connectivity augmentation and orientation problems
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
Minimum cost source location problem with local 3-vertex-connectivity requirements
Submodular linear programs on forests
Structural aspects of ordered polymatroids
A faster algorithm for computing the principal sequence of partitions of a graph
Polymatroid greedoids
On the \(k\)-cut problem
Core stability of the Shapley value for cooperative games
Bimatroids and invariants
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
\(b\)-matching degree-sequence polyhedra
A good algorithm for edge-disjoint branching
Explicit bounds for graph minors
The linear delta-matroid parity problem
The Euler circuit theorem for binary matroids
A decomposition property of polyhedra
A greedy algorithm for convex geometries
A note on the implications of approximate submodularity in discrete optimization
Some recent results in the analysis of greedy algorithms for assignment problems
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
On the expansion of combinatorial polytopes
Cooperative colorings of trees and of bipartite graphs
Polyhedral structure of submodular and posi-modular systems
Branch-and-price approaches for the network design problem with relays
Greedy sets and related problems
Integral decomposition in polyhedra
Monge extensions of cooperation and communication structures
A strongly polynomial algorithm for line search in submodular polyhedra
Inequalities on submodular functions via term rewriting
Complexity of tropical Schur polynomials
Dual greedy polyhedra, choice functions, and abstract convex geometries
Weakly Modular Graphs and Nonpositive Curvature
A vector exchange property of submodular systems
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
Elimination for generic sparse polynomial systems
Generalized Wong sequences and their applications to Edmonds' problems
On matroid parity and matching polytopes
Hopf Monoids and Generalized Permutahedra
Bisubmodular polyhedra, simplicial divisions, and discrete convexity
Matchings and \(\Delta\)-matroids
Network reinforcement
A correct response model in knowledge structure theory
Solution concepts for games with general coalitional structure
Structural properties of matroid matchings

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)