×

Found 28 Documents (Results 1–28)

100
MathJax

BiqBin: moving boundaries for NP-hard problems by HPC. (English) Zbl 1440.90061

Dimov, Ivan (ed.) et al., Advances in high performance computing. Results of the international conference on high performance computing, Borovets, Bulgaria, September 2–6, 2019. Cham: Springer. Stud. Comput. Intell. 902, 327-339 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Security games over lexicographic orders. (English) Zbl 1484.91011

Zhu, Quanyan (ed.) et al., Decision and game theory for security. 11th international conference, GameSec 2020, College Park, MD, USA, October 28–30, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12513, 422-441 (2020).
MSC:  91A10 91B03
PDF BibTeX XML Cite
Full Text: DOI

An optimization-based sum-of-squares approach to Vizing’s conjecture. (English) Zbl 1444.68303

Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 155-162 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Exact solution methods for the \(k\)-item quadratic knapsack problem. (English) Zbl 1452.90273

Cerulli, Raffaele (ed.) et al., Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9849, 166-176 (2016).
MSC:  90C27 90C20 90C22
PDF BibTeX XML Cite
Full Text: DOI arXiv

A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs. (English) Zbl 1432.90100

Cerulli, Raffaele (ed.) et al., Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9849, 110-122 (2016).
MSC:  90C20 90C10 90C22
PDF BibTeX XML Cite
Full Text: DOI arXiv

Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method. (English) Zbl 1317.90301

Jünger, Michael (ed.) et al., Facets of combinatorial optimization. Festschrift for Martin Grötschel on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-38188-1/hbk; 978-3-642-38189-8/ebook). 355-386 (2013).
MSC:  90C35 90C27
PDF BibTeX XML Cite
Full Text: DOI

Computational approaches to MAX-cut. (English) Zbl 1334.90149

Anjos, Miguel F. (ed.) et al., Handbook on semidefinite, conic and polynomial optimization. New York, NY: Springer (ISBN 978-1-4614-0768-3/hbk; 978-1-4614-0769-0/ebook). International Series in Operations Research & Management Science 166, 821-847 (2012).
MSC:  90C27 90C22 90-01
PDF BibTeX XML Cite
Full Text: DOI Link

A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. (English) Zbl 1136.90461

Fischetti, Matteo (ed.) et al., Integer programming and combinatorial optimization. 12th international IPCO conference, Ithaca, NY, USA, June 25–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72791-0/pbk). Lecture Notes in Computer Science 4513, 295-309 (2007).
MSC:  90C27 90C57
PDF BibTeX XML Cite
Full Text: DOI Link

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Classification

all top 3

Software