The Data-Correcting Algorithm for the Minimization of Supermodular Functions
From MaRDI portal
Publication:4950970
DOI10.1287/mnsc.45.11.1539zbMath0946.90062OpenAlexW1987550262MaRDI QIDQ4950970
Michael Tso, Gerard Sierksma, Boris I. Goldengorin, Gert A. Tijssen
Publication date: 25 October 2000
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8a8e4a008c37ad7df0872970ade86ecef9b858c2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (10)
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization ⋮ Finite-Time Analysis for the Knowledge-Gradient Policy ⋮ Branch and peg algorithms for the simple plant location problem. ⋮ Branch and peg algorithms for the simple plant location problem ⋮ Equivalent instances of the simple plant location problem ⋮ Monotone submodular maximization over the bounded integer lattice with cardinality constraints ⋮ Maximization of submodular functions: theory and enumeration algorithms ⋮ Maximization problems of balancing submodular relevance and supermodular diversity ⋮ A combinatorial approach to level of repair analysis ⋮ A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
This page was built for publication: The Data-Correcting Algorithm for the Minimization of Supermodular Functions
