A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Authors:
Boris Goldengorin;Diptesh Ghosh
Affiliations:
Department of Econometrics and Operations Research, Faculty of Economic Sciences, University of Groningen, AV Groningen, The Netherlands 9700;P& QM Area, Indian Institute of Management, Ahmedabad, India
Venue:
Journal of Global Optimization
Year:
2005

Citing 6
Cited 0

An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Experiments in quadratic 0-1 programming

Mathematical Programming: Series A and B
Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Solving the max-cut problem using eigenvalues

Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
The Data-Correcting Algorithm for the Minimization of Supermodular Functions

Management Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use information belonging to only one level in the Hasse diagram adjacent to the level of the solution at hand. In this paper, we propose a data correcting algorithm that looks at multiple levels of the Hasse diagram and hence makes the data correcting algorithm more efficient. Our computations with quadratic cost partition problems show that this multilevel search effects a 8- to 10-fold reduction in computation times, so that some of the dense quadratic partition problem instances of size 500, currently considered as some of the most difficult problems and far beyond the capabilities of current exact methods, are solvable on a personal computer working at 300 MHz within 10 min.