×

Found 536 Documents (Results 1–100)

100
MathJax

Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II. (English) Zbl 1483.90083

Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 383-398 (2021).
MSC:  90C11 90C60
PDF BibTeX XML Cite
Full Text: DOI arXiv

Multi-cover inequalities for totally-ordered multiple knapsack sets. (English) Zbl 1482.90180

Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 193-207 (2021).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the complexity of branching proofs. (English) Zbl 07561762

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 34, 35 p. (2020).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI

On weakening strategies for PB solvers. (English) Zbl 07331030

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 322-331 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI arXiv

Constructing mixed algorithms on the basis of some bundle method. (English) Zbl 1460.90139

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 150-163 (2020).
MSC:  90C25
PDF BibTeX XML Cite
Full Text: DOI

Automating cutting planes is NP-hard. (English) Zbl 07298231

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 68-77 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On perturbation spaces of minimal valid functions: inverse semigroup theory and equivariant decomposition theorem. (English) Zbl 1436.90084

Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 247-260 (2019).
MSC:  90C10
PDF BibTeX XML Cite
Full Text: DOI

Consistency for \(0-1\) programming. (English) Zbl 07116696

Rousseau, Louis-Martin (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 16th international conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11494, 225-240 (2019).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Stabbing planes. (English) Zbl 1462.68077

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 10, 20 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Representations of monotone Boolean functions by linear programs. (English) Zbl 1440.68078

O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 3, 14 p. (2017).
MSC:  68Q06 03F20 68Q17
PDF BibTeX XML Cite
Full Text: DOI

Graph colouring is hard for algorithms based on Hilbert’s Nullstellensatz and Gröbner bases. (English) Zbl 1440.68105

O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 2, 20 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

On the separation of topology-free rank inequalities for the max stable set problem. (English) Zbl 1433.68286

Iliopoulos, Costas S. (ed.) et al., 16th international symposium on experimental algorithms, SEA 2017, London, UK, June 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 75, Article 29, 13 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Structure and interpretation of dual-feasible functions. (English) Zbl 1397.90274

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 153-158 (2017).
MSC:  90C10 90C46
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software