A Branch and Cut solver for the maximum stable set problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-009-9264-3
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
- Alessandro Avenali, 2007. "Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem," Operations Research, INFORMS, vol. 55(5), pages 932-948, October.
- Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
- Dawn M. Strickland & Earl Barnes & Joel S. Sokol, 2005. "Optimal Protein Structure Alignment Using Maximum Cliques," Operations Research, INFORMS, vol. 53(3), pages 389-402, June.
- E. C. Sewell, 1998. "A Branch and Bound Algorithm for the Stability Number of a Sparse Graph," INFORMS Journal on Computing, INFORMS, vol. 10(4), pages 438-447, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Qinghua Wu & Jin-Kao Hao, 2013. "An adaptive multistart tabu search approach to solve the maximum clique problem," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 86-108, July.
- Fernando Aliaga & Diego Delle Donne & Guillermo Durán & Javier Marenco, 2022. "Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques," Annals of Operations Research, Springer, vol. 316(2), pages 891-904, September.
- Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
- Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu, 2016. "Solving the maximum vertex weight clique problem via binary quadratic programming," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 531-549, August.
- David Bergman & Andre A. Cire & Willem-Jan van Hoeve & J. N. Hooker, 2014. "Optimization Bounds from Binary Decision Diagrams," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 253-268, May.
- Coniglio, Stefano & Furini, Fabio & San Segundo, Pablo, 2021. "A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts," European Journal of Operational Research, Elsevier, vol. 289(2), pages 435-455.
- Stefano Coniglio & Stefano Gualandi, 2022. "Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1006-1023, March.
- Ferrarini, Luca & Gualandi, Stefano, 2022. "Total Coloring and Total Matching: Polyhedra and Facets," European Journal of Operational Research, Elsevier, vol. 303(1), pages 129-142.
- Wu, Qinghua & Hao, Jin-Kao, 2015. "A review on algorithms for maximum clique problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 693-709.
- Balasundaram, Balabhaskar & Borrero, Juan S. & Pan, Hao, 2022. "Graph signatures: Identification and optimization," European Journal of Operational Research, Elsevier, vol. 296(3), pages 764-775.
- Nathan Sudermann‐Merx & Steffen Rebennack & Christian Timpe, 2021. "Crossing Minimal Edge‐Constrained Layout Planning using Benders Decomposition," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3429-3447, October.
- Figueiredo, Rosa & Frota, Yuri, 2014. "The maximum balanced subgraph of a signed graph: Applications and solution approaches," European Journal of Operational Research, Elsevier, vol. 236(2), pages 473-487.
- Nasirian, Farzaneh & Mahdavi Pajouh, Foad & Balasundaram, Balabhaskar, 2020. "Detecting a most closeness-central clique in complex networks," European Journal of Operational Research, Elsevier, vol. 283(2), pages 461-475.
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.- Alessandro Avenali & Giorgio Matteucci & Fabio Nonino, 2010. "Outsourcing of Facility Management Activities and Procurement Design," DIS Technical Reports 2010-13, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Mishra, Debasis & Parkes, David C., 2007.
"Ascending price Vickrey auctions for general valuations,"
Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
- MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," LIDAM Discussion Papers CORE 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
- Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
- Charles L. Jackson, 2011. "Coase and the New Zealand Spectrum Reforms," Journal of Law and Economics, University of Chicago Press, vol. 54(S4), pages 189-205.
- Robert W. Day & Peter Cramton, 2012.
"Quadratic Core-Selecting Payment Rules for Combinatorial Auctions,"
Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
- Robert Day & Peter Cramton, 2008. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Papers of Peter Cramton 08qcspr, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
- Ngoc Mai Tran & Josephine Yu, 2015. "Product-Mix Auctions and Tropical Geometry," Papers 1505.05737, arXiv.org, revised Oct 2017.
- Dellbrügge, Marius & Brilka, Tim & Kreuz, Felix & Clausen, Uwe, 2022. "Auction design in strategic freight procurement," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Jahn, Carlos & Blecker, Thorsten & Ringle, Christian M. (ed.), Changing Tides: The New Role of Resilience and Sustainability in Logistics and Supply Chain Management – Innovative Approaches for the Shift to a New , volume 33, pages 295-325, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
- Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.
- Svyatoslav Trukhanov & Chitra Balasubramaniam & Balabhaskar Balasundaram & Sergiy Butenko, 2013. "Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations," Computational Optimization and Applications, Springer, vol. 56(1), pages 113-130, September.
- Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
- Bourbeau, Benoit & Gabriel Crainic, Teodor & Gendreau, Michel & Robert, Jacques, 2005. "Design for optimized multi-lateral multi-commodity markets," European Journal of Operational Research, Elsevier, vol. 163(2), pages 503-529, June.
- Pham, Long & Teich, Jeffrey & Wallenius, Hannele & Wallenius, Jyrki, 2015. "Multi-attribute online reverse auctions: Recent research trends," European Journal of Operational Research, Elsevier, vol. 242(1), pages 1-9.
- Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
- Zhu Jianming, 2014. "Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem," Journal of Systems Science and Information, De Gruyter, vol. 2(5), pages 451-460, October.
- Johannes C. Müller & Sebastian Pokutta & Alexander Martin & Susanne Pape & Andrea Peter & Thomas Winter, 2017. "Pricing and clearing combinatorial markets with singleton and swap orders," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(2), pages 155-177, April.
- Tobias Buer & Rasmus Haass, 2018. "Cooperative liner shipping network design by means of a combinatorial auction," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 686-711, December.
- Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
- Tuomas Sandholm & David Levine & Michael Concordia & Paul Martyn & Rick Hughes & Jim Jacobs & Dennis Begg, 2006. "Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization," Interfaces, INFORMS, vol. 36(1), pages 55-68, February.
- M A Krajewska & H Kopfer & G Laporte & S Ropke & G Zaccour, 2008. "Horizontal cooperation among freight carriers: request allocation and profit sharing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1483-1491, November.
More about this item
Keywords
Maximum stable set problem; Cutting-plane algorithm; Branch and Cut; Separation algorithm; Edge-projection;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:jcomop:v:21:y:2011:i:4:d:10.1007_s10878-009-9264-3. 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.