Minimum cuts, modular functions, and matroid polyhedra
From MaRDI portal
Publication:3703586
DOI10.1002/NET.3230150206zbMath0581.90059OpenAlexW1984448896MaRDI QIDQ3703586
Publication date: 1985
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230150206
Related Items (23)
A strongly polynomial algorithm for the minimum cost tension problem ⋮ Separation of partition inequalities with terminals ⋮ On submodular function minimization ⋮ Optimum partitioning into intersections of ring families ⋮ Strength and reinforcement of a network and tree packing ⋮ Cones of alternating and cut submodular set functions ⋮ Recognition problems for special classes of polynomials in 0-1 variables ⋮ Hypergraph Cuts with General Splitting Functions ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ The complexity of controlled selection ⋮ Using separation algorithms to generate mixed integer model reformulations ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ The complexity of soft constraint satisfaction ⋮ Lattice matrices, intersection of ring families and dicuts ⋮ Soft arc consistency revisited ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ A characterization of network representable polymatroids ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ Submodular containment is hard, even for networks ⋮ Testing membership in matroid polyhedra ⋮ Network reinforcement ⋮ Who should get vaccinated? Individualized allocation of vaccines over SIR network ⋮ Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
Cites Work
This page was built for publication: Minimum cuts, modular functions, and matroid polyhedra
