A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
From MaRDI portal
Publication:2569153
DOI10.1007/s10898-004-5909-zzbMath1098.90093OpenAlexW2098341253MaRDI QIDQ2569153
Diptesh Ghosh, Boris I. Goldengorin
Publication date: 18 October 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-5909-z
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (7)
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization ⋮ Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms ⋮ Constraint generation approaches for submodular function maximization leveraging graph properties ⋮ Non-submodular streaming maximization with minimum memory and low adaptive complexity ⋮ Monotone submodular maximization over the bounded integer lattice with cardinality constraints ⋮ Non-submodular maximization on massive data streams ⋮ Maximization of submodular functions: theory and enumeration algorithms
Cites Work
- Experiments in quadratic 0-1 programming
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- An improved branch \& bound method for the uncapacitated competitive location problem
- Lagrangean heuristics for location problems
- Solving the max-cut problem using eigenvalues
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- The Data-Correcting Algorithm for the Minimization of Supermodular Functions
This page was built for publication: A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
