×

Found 6,250 Documents (Results 1–100)

100
MathJax

Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem. 2nd edition. (English) Zbl 07504330

Applied Mathematical Sciences 175. Berlin: Springer (ISBN 978-3-662-64876-6/hbk; 978-3-662-64879-7/pbk; 978-3-662-64877-3/ebook). xi, 227 p. (2022).
MSC:  90C27 90C59 90C57
PDF BibTeX XML Cite
Full Text: DOI

Generalized target-allocation functions and their evaluation by the branch-and-bound method. (English. Russian original) Zbl 07513596

Comput. Math. Model. 32, No. 2, 183-197 (2021); translation from Prikl. Mat. Inf. 66, 89-103 (2021).
MSC:  65-XX 90-XX
PDF BibTeX XML Cite
Full Text: DOI

Improving branch-and-bound using decision diagrams and reinforcement learning. (English) Zbl 07493645

Stuckey, Peter J. (ed.), Integration of constraint programming, artificial intelligence, and operations research. 18th international conference, CPAIOR 2021, Vienna, Austria, July 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12735, 446-455 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

On the integrality gap of binary integer programs with Gaussian data. (English) Zbl 1483.90079

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, 427-442 (2021).
MSC:  90C10 90C57
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the geometry of symmetry breaking inequalities. (English) Zbl 1482.90124

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, 73-88 (2021).
MSC:  90C10 90C57
PDF BibTeX XML Cite
Full Text: DOI arXiv

A Lagrangian approach to chance constrained routing with local broadcast. (English) Zbl 1479.90053

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 277-291 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Optimal strategy for solving a special case of the knapsack problem by the branch and bound method. (English. Russian original) Zbl 1480.90213

Mosc. Univ. Math. Bull. 76, No. 3, 97-106 (2021); translation from Vestn. Mosk. Univ., Ser. I 76, No. 3, 13-22 (2021).
MSC:  90C27 90C57
PDF BibTeX XML Cite
Full Text: DOI

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

Biographic Reference

all top 3

Software