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.
Similar content being viewed by others
References
J.E. Beasley (1993) ArticleTitleLagrangean heuristics for location problems European Journal of Operational Research 65 383–399 Occurrence Handle10.1016/0377-2217(93)90118-7
F. Barahona M. Grötschel M. Junger G. Reinelt. (1988) ArticleTitleAn application of combinatorial optimization to statistical physics and circuit layout design Operations Research 36 IssueID3 493–512
F. Barahona M. Junger G. Reinelt (1989) ArticleTitleExperiments in quadratic 0-1 programming Mathematical Programming 44 127–137
S. Benati (2003) ArticleTitleAn improved branch and bound method for the uncapacitated competitive location problem Annals of Operations Research 122 43–58
Cherenin V.P. (1962): Solving some combinatorial problems of optimal planning by the method of successive calculations. In: Proceedings of the Conference on Experiences and Perspectives of the Application of Mathematical Methods and Electronic Computers in Planning, Mimeograph, Novosibirsk (in Russian)
F. Glover G.A. Kochenberger B. Alidaee (1998) ArticleTitleAdaptive memory tabu search for binary quadratic programs Management Science 44 IssueID3 336–345
B. Goldengorin (1983) ArticleTitleA correcting algorithm for solving some discrete optimization problems Soviet Math. Dokl 27 620–623
B. Goldengorin G. Gutin (1998) Polynomially solvable cases of the supermodular set function minimization problem. Research Report TR/6/98 Department of Mathematics and Statistics, Brunel University, Uxbridge, Middlesex United Kingdom
B. Goldengorin G. Sierksma G.A. Tijssen M. Tso (1999) ArticleTitleThe data-correcting algorithm for the minimization of supermodular functions Management Science 45 IssueID11 1539–1551
B. Goldengorin (2002) Data correcting algorithms in combinatorial optimization. Ph.D. Thesis, SOM Research Institute University of Groningen Groningen, The Netherlands
V.R. Khachaturov (1989) Mathematical Methods of Regional Programming Nauka Moscow
H. Lee G.L. Nemhauser Y. Wang (1996) ArticleTitleMaximizing a submodular function by integer programming: Polyhedral results for the quadratic case European Journal of Operational Research 94 154–166
M. Minoux (1977) Accelerated greedy algorithms for maximizing submodular set functions J. Stoer (Eds) Actes Congres IFIP Springer Verlag Berlin 234–243
P.M. Pardalos G.P. Rodgers (1990) ArticleTitleComputational aspects of a branch and bound algorithm for quadratic zero-one programming Computing 40 131–144
S. Poljak F. Rendl (1995) ArticleTitleSolving the max-cut problem using eigenvalues Discrete Applied Mathematics 62 249–278
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goldengorin, B., Ghosh, D. A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem. J Glob Optim 32, 65–82 (2005). https://doi.org/10.1007/s10898-004-5909-z
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-5909-z