SDP-based bounds for graph partition via extended ADMM
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-022-00355-1
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Dirk A. Lorenz & Quoc Tran-Dinh, 2019. "Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence," Computational Optimization and Applications, Springer, vol. 74(1), pages 67-92, September.
- David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
- Neng Fan & Panos Pardalos, 2010. "Linear and quadratic programming approaches for the general graph partitioning problem," Journal of Global Optimization, Springer, vol. 48(1), pages 57-71, September.
- Bissan Ghaddar & Miguel Anjos & Frauke Liers, 2011. "A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem," Annals of Operations Research, Springer, vol. 188(1), pages 155-174, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Diego Recalde & Ramiro Torres & Polo Vaca, 2020. "An exact approach for the multi-constraint graph partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 289-308, October.
- Fuda Ma & Jin-Kao Hao, 2017. "A multiple search operator heuristic for the max-k-cut problem," Annals of Operations Research, Springer, vol. 248(1), pages 365-403, January.
- Maria da Conceição Cunha, 1999. "On Solving Aquifer Management Problems with Simulated Annealing Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 13(3), pages 153-170, June.
- Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
- S Küçükpetek & F Polat & H Oğuztüzün, 2005. "Multilevel graph partitioning: an evolutionary approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 549-562, May.
- Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
- Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
- Orlin, James & Sharma, Dushyant, 2003. "The Extended Neighborhood: Definition And Characterization," Working papers 4392-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra, 2016. "A multi-period shelter location-allocation model with evacuation orders for flood disasters," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 299-323, September.
- Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
- M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
- Antunes, Antonio & Peeters, Dominique, 2001.
"On solving complex multi-period location models using simulated annealing,"
European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
- ANTUNES, Antonio & PEETERS, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," LIDAM Reprints CORE 1526, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Cheng Lu & Zhibin Deng, 2021. "A branch-and-bound algorithm for solving max-k-cut problem," Journal of Global Optimization, Springer, vol. 81(2), pages 367-389, October.
- Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
- Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.
- Eduardo Queiroga & Anand Subramanian & Rosa Figueiredo & Yuri Frota, 2021. "Integer programming formulations and efficient local search for relaxed correlation clustering," Journal of Global Optimization, Springer, vol. 81(4), pages 919-966, December.
- Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
- Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
- Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
- Sonia Cafieri & Alberto Costa & Pierre Hansen, 2014. "Reformulation of a model for hierarchical divisive graph modularity maximization," Annals of Operations Research, Springer, vol. 222(1), pages 213-226, November.
More about this item
Keywords
Graph partitioning; Semidefinite programming; ADMM; Combinatorial optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:82:y:2022:i:1:d:10.1007_s10589-022-00355-1. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.