×

Found 520 Documents (Results 1–100)

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

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

Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method. (English. Russian original) Zbl 1456.90135

Discrete Math. Appl. 30, No. 5, 313-325 (2020); translation from Diskretn. Mat. 31, No. 4, 20-37 (2019).
MSC:  90C27 90C57
PDF BibTeX XML Cite
Full Text: DOI

Interval methods for solving various kinds of quantified nonlinear problems. (English) Zbl 07285516

Kosheleva, Olga (ed.) et al., Beyond traditional probabilistic data processing techniques: interval, fuzzy etc. methods and their applications. Dedicated to Vladik Kreinovich on the occasion of his 65th birthday. Cham: Springer. Stud. Comput. Intell. 835, 311-328 (2020).
MSC:  68T37
PDF BibTeX XML Cite
Full Text: DOI

The branch and cut method for the clique partitioning problem. (Russian, English) Zbl 1438.90395

Diskretn. Anal. Issled. Oper. 26, No. 3, 60-87 (2019); translation in J. Appl. Ind. Math. 13, No. 3, 539-556 (2019).
MSC:  90C57 90C59 90C35
PDF BibTeX XML Cite
Full Text: DOI

Methods for solving of the aircraft landing problem. I: Exact solution methods. (English. Russian original) Zbl 1429.90029

Autom. Remote Control 80, No. 7, 1317-1334 (2019); translation from Probl. Upr. 2018, No. 4, 2-13 (2018).
MSC:  90B35 90C08 90C57
PDF BibTeX XML Cite
Full Text: DOI

Quantum branch-and-bound algorithm and its application to the travelling salesman problem. (English. Russian original) Zbl 1426.81026

J. Math. Sci., New York 241, No. 2, 168-184 (2019); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 138, 60-75 (2017).
PDF BibTeX XML Cite
Full Text: DOI

Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering. (English. Russian original) Zbl 1369.90196

Autom. Remote Control 78, No. 3, 463-474 (2017); translation from Avtom. Telemekh. 2017, No. 3, 96-110 (2017).
MSC:  90C57 90C60
PDF BibTeX XML Cite
Full Text: DOI

New underestimator for univariate global optimization. (English) Zbl 1370.90198

Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Proceedings of the 3rd international conference on modelling, computation and optimization in information systems and management sciences, MCO 2015, Lorraine, France, May 11–13, 2015. Part I. Cham: Springer (ISBN 978-3-319-18160-8/pbk; 978-3-319-18161-5/ebook). Advances in Intelligent Systems and Computing 359, 403-410 (2015).
MSC:  90C26 90C57
PDF BibTeX XML Cite
Full Text: DOI

Integrating simplex with tableaux. (English) Zbl 1471.68304

De Nivelle, Hans (ed.), Automated reasoning with analytic tableaux and related methods. 24th international conference, TABLEAUX 2015, Wrocław, Poland, September 21–24, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9323, 86-101 (2015).
MSC:  68V15 03B35
PDF BibTeX XML Cite
Full Text: DOI Link

Synthesis of cutting and separating planes in a nonsmooth optimization method. (English. Russian original) Zbl 1327.90225

Cybern. Syst. Anal. 51, No. 4, 619-631 (2015); translation from Kibern. Sist. Anal. 2015, No. 4, 137-150 (2015).
MSC:  90C25 90C57
PDF BibTeX XML Cite
Full Text: DOI

Linear and integer optimization. Theory and practice. 3rd ed. (English) Zbl 1329.90183

Advances in Applied Mathematics (Boca Raton). Boca Raton, FL: CRC Press (ISBN 978-1-4987-1016-9/hbk; 978-1-4987-1022-0/ebook). xxix, 656 p. (2015).
PDF BibTeX XML Cite

The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers. (Russian, English) Zbl 1324.90105

Diskretn. Anal. Issled. Oper. 21, No. 2, 3-23 (2014); translation in J. Appl. Ind. Math. 8, No. 2, 177-189 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Some algorithms of solving minimax multiprocessor scheduling problem. (English. Russian original) Zbl 1317.90119

J. Comput. Syst. Sci. Int. 53, No. 2, 195-200 (2014); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2014, No. 2, 50-56 (2014).
MSC:  90B35 90C57 68M07
PDF BibTeX XML Cite
Full Text: DOI

Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations. (English. Russian original) Zbl 1308.90208

Cybern. Syst. Anal. 50, No. 4, 620-626 (2014); translation from Kibern. Sist. Anal. No. 4, 154-161 (2014).
PDF BibTeX XML Cite
Full Text: DOI Link

The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations. (English. Russian original) Zbl 1308.90205

Cybern. Syst. Anal. 50, No. 4, 613-619 (2014); translation from Kibern. Sist. Anal. No. 4, 146-153 (2014).
MSC:  90C57 90C27 90C05
PDF BibTeX XML Cite
Full Text: DOI

Estimation of the number of iterations in integer programming algorithms using the regular partitions method. (English. Russian original) Zbl 1297.90091

Russ. Math. 58, No. 1, 35-46 (2014); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2014, No. 1, 31-40 (2014).
MSC:  90C11
PDF BibTeX XML Cite
Full Text: DOI

Algorithm for stochastic generalized production-transportation problem with concave costs. (English) Zbl 1333.90014

Zadnik Stirn, Lidija (ed.) et al., SOR ’13 proceedings. The 12th international symposium on operational research in Slovenia, Dolenjske Toplice, Slovenia, September 25–27, 2013. Ljubljana: Slovenian Society Informatika (SDI), Section for Operational Research (SOR) (ISBN 978-961-6165-40-2/pbk). 21-32 (2013).
MSC:  90B06
PDF BibTeX XML Cite

Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem). (English. Russian original) Zbl 1306.90135

Cybern. Syst. Anal. 49, No. 5, 739-748 (2013); translation from Kibern. Sist. Anal. 2013, No. 5, 112-123 (2013).
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

Main Field

all top 3

Software