Vitor, Fabio; Easton, Todd Approximate and exact merging of knapsack constraints with cover inequalities. (English) Zbl 07313474 Optimization 70, No. 2, 437-460 (2021). MSC: 90C10 90C27 90C39 90C57 PDF BibTeX XML Cite \textit{F. Vitor} and \textit{T. Easton}, Optimization 70, No. 2, 437--460 (2021; Zbl 07313474) Full Text: DOI
Khorramizadeh, Mostafa On path-bridge inequalities for the orienteering arc routing problems. (English) Zbl 07313460 Optimization 70, No. 1, 101-120 (2021). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{M. Khorramizadeh}, Optimization 70, No. 1, 101--120 (2021; Zbl 07313460) Full Text: DOI
Schmidt, Daniel; Zey, Bernd; Margot, François Stronger MIP formulations for the Steiner forest problem. (English) Zbl 07310584 Math. Program. 186, No. 1-2 (A), 373-407 (2021). MSC: 90C27 90C57 90B10 PDF BibTeX XML Cite \textit{D. Schmidt} et al., Math. Program. 186, No. 1--2 (A), 373--407 (2021; Zbl 07310584) Full Text: DOI
Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem. (English) Zbl 07310583 Math. Program. 186, No. 1-2 (A), 337-372 (2021). MSC: 90C10 90C57 90C90 PDF BibTeX XML Cite \textit{P. Bendotti} et al., Math. Program. 186, No. 1--2 (A), 337--372 (2021; Zbl 07310583) Full Text: DOI
Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; Righini, Giovanni; Tirado, Gregorio A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies. (English) Zbl 07307578 SN Oper. Res. Forum 2, No. 1, Paper No. 8, 34 p. (2021). MSC: 90B06 90C27 90C57 PDF BibTeX XML Cite \textit{A. Ceselli} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 8, 34 p. (2021; Zbl 07307578) Full Text: DOI
Baller, Annelieke C.; Dabia, Said; Desaulniers, Guy; Dullaert, Wout E. H. The inventory routing problem with demand moves. (English) Zbl 07307576 SN Oper. Res. Forum 2, No. 1, Paper No. 6, 62 p. (2021). MSC: 90B05 90C57 PDF BibTeX XML Cite \textit{A. C. Baller} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 6, 62 p. (2021; Zbl 07307576) Full Text: DOI
Ben Ticha, Hamza; Absi, Nabil; Feillet, Dominique; Quilliot, Alain; Van Woensel, Tom The time-dependent vehicle routing problem with time windows and road-network information. (English) Zbl 07307574 SN Oper. Res. Forum 2, No. 1, Paper No. 4, 26 p. (2021). MSC: 90B06 90C27 90C57 PDF BibTeX XML Cite \textit{H. Ben Ticha} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 4, 26 p. (2021; Zbl 07307574) Full Text: DOI
Mathlouthi, Ines; Gendreau, Michel; Potvin, Jean-Yves Branch-and-price for a multi-attribute technician routing and scheduling problem. (English) Zbl 07307571 SN Oper. Res. Forum 2, No. 1, Paper No. 1, 36 p. (2021). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{I. Mathlouthi} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 1, 36 p. (2021; Zbl 07307571) Full Text: DOI
Basu, Amitabh; Conforti, Michele; Di Summa, Marco; Jiang, Hongyi Split cuts in the plane. (English) Zbl 07304307 SIAM J. Optim. 31, No. 1, 331-347 (2021). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{A. Basu} et al., SIAM J. Optim. 31, No. 1, 331--347 (2021; Zbl 07304307) Full Text: DOI
Letchford, Adam N.; Vu, Anh N. Facets from gadgets. (English) Zbl 07300741 Math. Program. 185, No. 1-2 (A), 297-314 (2021). MSC: 90C57 90C27 PDF BibTeX XML Cite \textit{A. N. Letchford} and \textit{A. N. Vu}, Math. Program. 185, No. 1--2 (A), 297--314 (2021; Zbl 07300741) Full Text: DOI
Magnouche, Y.; Mahjoub, A. R.; Martin, S. The multi-terminal vertex separator problem: branch-and-cut-and-price. (English) Zbl 07293746 Discrete Appl. Math. 290, 86-111 (2021). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{Y. Magnouche} et al., Discrete Appl. Math. 290, 86--111 (2021; Zbl 07293746) Full Text: DOI
Falq, Anne-Elisabeth; Fouilhoux, Pierre; Kedad-Sidhoum, Safia Mixed integer formulations using natural variables for single machine scheduling around a common due date. (English) Zbl 07293741 Discrete Appl. Math. 290, 36-59 (2021). MSC: 90B35 90C11 90C57 PDF BibTeX XML Cite \textit{A.-E. Falq} et al., Discrete Appl. Math. 290, 36--59 (2021; Zbl 07293741) Full Text: DOI
Heßler, Katrin; Irnich, Stefan A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. (English) Zbl 1452.90267 Discrete Appl. Math. 288, 218-234 (2021). MSC: 90C27 90B06 90C57 PDF BibTeX XML Cite \textit{K. Heßler} and \textit{S. Irnich}, Discrete Appl. Math. 288, 218--234 (2021; Zbl 1452.90267) Full Text: DOI
Bianchessi, Nicola; Irnich, Stefan; Tilk, Christian A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. (English) Zbl 1452.90057 Discrete Appl. Math. 288, 152-170 (2021). MSC: 90B06 90C57 90C39 90C27 PDF BibTeX XML Cite \textit{N. Bianchessi} et al., Discrete Appl. Math. 288, 152--170 (2021; Zbl 1452.90057) Full Text: DOI
Hrga, Timotej; Lužar, Borut; Povh, Janez; Wiegele, Angelika 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). MSC: 90C27 65K05 65Y10 68Q17 90C57 PDF BibTeX XML Cite \textit{T. Hrga} et al., Stud. Comput. Intell. 902, 327--339 (2021; Zbl 1440.90061) Full Text: DOI
Wang, Fenlan A combination of linear approximation and Lagrangian dual with a simple cut for general separable integer programming problems. (English) Zbl 07313909 Pac. J. Optim. 16, No. 3, 441-459 (2020). MSC: 90C10 90C26 90C30 PDF BibTeX XML Cite \textit{F. Wang}, Pac. J. Optim. 16, No. 3, 441--459 (2020; Zbl 07313909) Full Text: Link
Ren, Yifei; Lu, Zhiqiang; Liu, Xinyi A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line. (English) Zbl 07311811 Optim. Lett. 14, No. 8, 2161-2195 (2020). MSC: 90C PDF BibTeX XML Cite \textit{Y. Ren} et al., Optim. Lett. 14, No. 8, 2161--2195 (2020; Zbl 07311811) Full Text: DOI
Cen, Xiaoli; Xia, Yong Globally maximizing the sum of squares of quadratic forms over the unit sphere. (English) Zbl 07311795 Optim. Lett. 14, No. 7, 1907-1919 (2020). MSC: 90C PDF BibTeX XML Cite \textit{X. Cen} and \textit{Y. Xia}, Optim. Lett. 14, No. 7, 1907--1919 (2020; Zbl 07311795) Full Text: DOI
Thun, Kristian; Andersson, Henrik; Stålhane, Magnus A branch-and-price algorithm for the liner shipping network design problem. (English) Zbl 07307561 SN Oper. Res. Forum 1, No. 4, Paper No. 28, 22 p. (2020). MSC: 90B06 90C05 90C11 90C57 90B10 PDF BibTeX XML Cite \textit{K. Thun} et al., SN Oper. Res. Forum 1, No. 4, Paper No. 28, 22 p. (2020; Zbl 07307561) Full Text: DOI
Lam, Edward; Gange, Graeme; Stuckey, Peter J.; Van Hentenryck, Pascal; Dekker, Jip J. Nutmeg: a MIP and CP hybrid solver using branch-and-check. (English) Zbl 07307555 SN Oper. Res. Forum 1, No. 3, Paper No. 22, 28 p. (2020). MSC: 90C PDF BibTeX XML Cite \textit{E. Lam} et al., SN Oper. Res. Forum 1, No. 3, Paper No. 22, 28 p. (2020; Zbl 07307555) Full Text: DOI
Byeon, Geunyeong; Van Hentenryck, Pascal; Bent, Russell; Nagarajan, Harsha Communication-constrained expansion planning for resilient distribution systems. (English) Zbl 07303817 INFORMS J. Comput. 32, No. 4, 968-985 (2020). MSC: 90B18 90C57 PDF BibTeX XML Cite \textit{G. Byeon} et al., INFORMS J. Comput. 32, No. 4, 968--985 (2020; Zbl 07303817) Full Text: DOI
Validi, Hamidreza; Buchanan, Austin The optimal design of low-latency virtual backbones. (English) Zbl 07303816 INFORMS J. Comput. 32, No. 4, 952-967 (2020). MSC: 90B18 90C05 90C35 90C57 PDF BibTeX XML Cite \textit{H. Validi} and \textit{A. Buchanan}, INFORMS J. Comput. 32, No. 4, 952--967 (2020; Zbl 07303816) Full Text: DOI
Januardi, Januardi; Ramdhani, Zakia Puspa; Harnaningrum, Rizky Novera Transshipment model considering environmental cost using mixed integer linear programming: beef distribution problem. (English) Zbl 07302628 Croat. Oper. Res. Rev. (CRORR) 11, No. 2, 155-164 (2020). MSC: 90B06 91B76 90C11 90C05 90C57 PDF BibTeX XML Cite \textit{J. Januardi} et al., Croat. Oper. Res. Rev. (CRORR) 11, No. 2, 155--164 (2020; Zbl 07302628) Full Text: DOI
Recalde, Diego; Torres, Ramiro; Vaca, Polo An exact approach for the multi-constraint graph partitioning problem. (English) Zbl 1452.90225 EURO J. Comput. Optim. 8, No. 3-4, 289-308 (2020). MSC: 90C10 90C27 90C57 05C70 PDF BibTeX XML Cite \textit{D. Recalde} et al., EURO J. Comput. Optim. 8, No. 3--4, 289--308 (2020; Zbl 1452.90225) Full Text: DOI
Gamrath, Gerald; Berthold, Timo; Salvagnin, Domenico An exploratory computational analysis of dual degeneracy in mixed-integer programming. (English) Zbl 1452.90220 EURO J. Comput. Optim. 8, No. 3-4, 241-261 (2020). MSC: 90C10 90C11 90C57 PDF BibTeX XML Cite \textit{G. Gamrath} et al., EURO J. Comput. Optim. 8, No. 3--4, 241--261 (2020; Zbl 1452.90220) Full Text: DOI
Wang, Xiaohui; Zhang, Hao; Xia, Yong GPS localization problem: a new model and its global optimization. (English) Zbl 1452.90253 Optim. Eng. 21, No. 3, 851-866 (2020). MSC: 90C26 90C32 90C90 PDF BibTeX XML Cite \textit{X. Wang} et al., Optim. Eng. 21, No. 3, 851--866 (2020; Zbl 1452.90253) Full Text: DOI
Ren, Yequan; Bai, Yanqin; Li, Qian; Yu, Changjun; Zhang, Liansheng A second-order cone programming algorithm for pooling problem. (Chinese. English summary) Zbl 07296149 Oper. Res. Trans. 24, No. 2, 61-72 (2020). MSC: 90C26 90C57 PDF BibTeX XML Cite \textit{Y. Ren} et al., Oper. Res. Trans. 24, No. 2, 61--72 (2020; Zbl 07296149) Full Text: DOI
Kolpakov, Roman M.; Posypkin, Mikhail A. Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method. (English. Russian original) Zbl 07291226 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 \textit{R. M. Kolpakov} and \textit{M. A. Posypkin}, Discrete Math. Appl. 30, No. 5, 313--325 (2020; Zbl 07291226); translation from Diskretn. Mat. 31, No. 4, 20--37 (2019) Full Text: DOI
Serra, Thiago Reformulating the disjunctive cut generating linear program. (English) Zbl 07290962 Ann. Oper. Res. 295, No. 1, 363-384 (2020). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{T. Serra}, Ann. Oper. Res. 295, No. 1, 363--384 (2020; Zbl 07290962) Full Text: DOI
Li, Xiangyong; Aneja, Y. P. A new branch-and-cut approach for the generalized regenerator location problem. (English) Zbl 07290957 Ann. Oper. Res. 295, No. 1, 229-255 (2020). MSC: 90B18 90B80 90C57 PDF BibTeX XML Cite \textit{X. Li} and \textit{Y. P. Aneja}, Ann. Oper. Res. 295, No. 1, 229--255 (2020; Zbl 07290957) Full Text: DOI
Hosseinian, Seyedmohammadhossein; Fontes, Dalila B. M. M.; Butenko, Sergiy A Lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem. (English) Zbl 07290873 INFORMS J. Comput. 32, No. 3, 747-762 (2020). MSC: 90C35 90C10 90C57 PDF BibTeX XML Cite \textit{S. Hosseinian} et al., INFORMS J. Comput. 32, No. 3, 747--762 (2020; Zbl 07290873) Full Text: DOI
Deleplanque, Samuel; Labbé, Martine; Ponce, Diego; Puerto, Justo A branch-price-and-cut procedure for the discrete ordered Median problem. (English) Zbl 1451.90085 INFORMS J. Comput. 32, No. 3, 582-599 (2020). MSC: 90B80 90C57 PDF BibTeX XML Cite \textit{S. Deleplanque} et al., INFORMS J. Comput. 32, No. 3, 582--599 (2020; Zbl 1451.90085) Full Text: DOI
Poikonen, Stefan; Golden, Bruce The mothership and drone routing problem. (English) Zbl 1451.90020 INFORMS J. Comput. 32, No. 2, 249-262 (2020). MSC: 90B06 90C57 90C59 90C25 PDF BibTeX XML Cite \textit{S. Poikonen} and \textit{B. Golden}, INFORMS J. Comput. 32, No. 2, 249--262 (2020; Zbl 1451.90020) Full Text: DOI
Hu, Hao; Sotirov, Renata On solving the quadratic shortest path problem. (English) Zbl 1451.90018 INFORMS J. Comput. 32, No. 2, 219-233 (2020). MSC: 90B06 90B10 90C27 90C22 05C20 05C38 PDF BibTeX XML Cite \textit{H. Hu} and \textit{R. Sotirov}, INFORMS J. Comput. 32, No. 2, 219--233 (2020; Zbl 1451.90018) Full Text: DOI
Jacek Kubica, Bartłomiej 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 (ISBN 978-3-030-31040-0/hbk; 978-3-030-31041-7/ebook). Studies in Computational Intelligence 835, 311-328 (2020). MSC: 68T37 PDF BibTeX XML Cite \textit{B. Jacek Kubica}, Stud. Comput. Intell. 835, 311--328 (2020; Zbl 07285516) Full Text: DOI
Arslan, Okan; Jabali, Ola; Laporte, Gilbert A flexible, natural formulation for the network design problem with vulnerability constraints. (English) Zbl 1451.90024 INFORMS J. Comput. 32, No. 1, 120-134 (2020). MSC: 90B10 05C82 90C35 90C57 PDF BibTeX XML Cite \textit{O. Arslan} et al., INFORMS J. Comput. 32, No. 1, 120--134 (2020; Zbl 1451.90024) Full Text: DOI
Oliveira, Daniel; Pessoa, Artur An improved branch-cut-and-price algorithm for parallel machine scheduling problems. (English) Zbl 1451.90068 INFORMS J. Comput. 32, No. 1, 90-100 (2020). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{D. Oliveira} and \textit{A. Pessoa}, INFORMS J. Comput. 32, No. 1, 90--100 (2020; Zbl 1451.90068) Full Text: DOI
Xia, Wei; Vera, Juan C.; Zuluaga, Luis F. Globally solving nonconvex quadratic programs via linear integer programming techniques. (English) Zbl 07284452 INFORMS J. Comput. 32, No. 1, 40-56 (2020). MSC: 90C PDF BibTeX XML Cite \textit{W. Xia} et al., INFORMS J. Comput. 32, No. 1, 40--56 (2020; Zbl 07284452) Full Text: DOI
Uematsu, Naoya; Umetani, Shunji; Kawahara, Yoshinobu An efficient branch-and-cut algorithm for submodular function maximization. (English) Zbl 1453.90135 J. Oper. Res. Soc. Japan 63, No. 2, 41-59 (2020). MSC: 90C27 90C10 90C57 PDF BibTeX XML Cite \textit{N. Uematsu} et al., J. Oper. Res. Soc. Japan 63, No. 2, 41--59 (2020; Zbl 1453.90135)
Ghosal, Shubhechyya; Wiesemann, Wolfram The distributionally robust chance-constrained vehicle routing problem. (English) Zbl 1445.90009 Oper. Res. 68, No. 3, 716-732 (2020). MSC: 90B06 90C17 90B36 90C57 PDF BibTeX XML Cite \textit{S. Ghosal} and \textit{W. Wiesemann}, Oper. Res. 68, No. 3, 716--732 (2020; Zbl 1445.90009) Full Text: DOI
Wolsey, Laurence A. Integer programming. 2nd edition. (English) Zbl 07267975 Hoboken, NJ: John Wiley & Sons (ISBN 978-1-119-60653-6/hbk; 978-1-119-60647-5/ebook). 336 p. (2020). MSC: 90-01 90C10 90C57 90C11 PDF BibTeX XML Cite \textit{L. A. Wolsey}, Integer programming. 2nd edition. Hoboken, NJ: John Wiley \& Sons (2020; Zbl 07267975) Full Text: DOI
Gao, Yuelin; Zhang, Bo An outcome-space branch and bound algorithm for the sum-of-linear-ratios programming problem. (Chinese. English summary) Zbl 07267293 Math. Numer. Sin. 42, No. 2, 207-222 (2020). MSC: 90C57 90C26 90C30 PDF BibTeX XML Cite \textit{Y. Gao} and \textit{B. Zhang}, Math. Numer. Sin. 42, No. 2, 207--222 (2020; Zbl 07267293)
Shen, Peiping; Wang, Kaimin; Zhu, Zeyi A branch and bound algorithm for a class of DC programming problems. (Chinese. English summary) Zbl 07267266 Math. Appl. 33, No. 2, 393-398 (2020). MSC: 90C57 90C26 PDF BibTeX XML Cite \textit{P. Shen} et al., Math. Appl. 33, No. 2, 393--398 (2020; Zbl 07267266)
Ruan, Xiaogang; Zhang, Jingjing; Zhu, Xiaoqing; Zhou, Jing Simultaneous localization and mapping data association based on maximum expectation clustering for Gaussian mixture model. (Chinese. English summary) Zbl 07266499 Control Theory Appl. 37, No. 2, 265-274 (2020). MSC: 68T40 PDF BibTeX XML Cite \textit{X. Ruan} et al., Control Theory Appl. 37, No. 2, 265--274 (2020; Zbl 07266499) Full Text: DOI
Cococcioni, Marco; Cudazzo, Alessandro; Pappalardo, Massimo; Sergeyev, Yaroslav D. Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and Grossone methodology. (English) Zbl 1451.90140 Commun. Nonlinear Sci. Numer. Simul. 84, Article ID 105177, 20 p. (2020). MSC: 90C29 90C11 90C57 PDF BibTeX XML Cite \textit{M. Cococcioni} et al., Commun. Nonlinear Sci. Numer. Simul. 84, Article ID 105177, 20 p. (2020; Zbl 1451.90140) Full Text: DOI
Diwekar, Urmila M. Introduction to applied optimization. 3rd edition. (English) Zbl 1451.90001 Springer Optimization and Its Applications 22. Cham: Springer (ISBN 978-3-030-55403-3/hbk; 978-3-030-55404-0/ebook). xxix, 358 p. (2020). MSC: 90-01 90C05 90C30 90C10 90C29 90C11 90C57 90C59 PDF BibTeX XML Cite \textit{U. M. Diwekar}, Introduction to applied optimization. 3rd edition. Cham: Springer (2020; Zbl 1451.90001) Full Text: DOI
Bunel, Rudy; Turkaslan, Ilker; Torr, Philip H. S.; Kumar, M. Pawan; Lu, Jingyue; Kohli, Pushmeet Branch and bound for piecewise linear neural network verification. (English) Zbl 07255073 J. Mach. Learn. Res. 21, Paper No. 42, 39 p. (2020). MSC: 68T05 PDF BibTeX XML Cite \textit{R. Bunel} et al., J. Mach. Learn. Res. 21, Paper No. 42, 39 p. (2020; Zbl 07255073) Full Text: Link
Huber, Stefan; König, Robert; Tomamichel, Marco Jointly constrained semidefinite bilinear programming with an application to Dobrushin curves. (English) Zbl 1448.90072 IEEE Trans. Inf. Theory 66, No. 5, 2934-2950 (2020). MSC: 90C22 90C57 94A15 68Q12 PDF BibTeX XML Cite \textit{S. Huber} et al., IEEE Trans. Inf. Theory 66, No. 5, 2934--2950 (2020; Zbl 1448.90072) Full Text: DOI
Estes, Alexander S.; Ball, Michael O. Facets of the stochastic network flow problem. (English) Zbl 1450.90056 SIAM J. Optim. 30, No. 3, 2355-2378 (2020). MSC: 90C35 90C27 90C57 PDF BibTeX XML Cite \textit{A. S. Estes} and \textit{M. O. Ball}, SIAM J. Optim. 30, No. 3, 2355--2378 (2020; Zbl 1450.90056) Full Text: DOI
Briskorn, Dirk; Zey, Lennart Interference aware scheduling of triple-crossover-cranes. (English) Zbl 1446.90073 J. Sched. 23, No. 4, 465-485 (2020). MSC: 90B35 90C27 90C57 90B06 PDF BibTeX XML Cite \textit{D. Briskorn} and \textit{L. Zey}, J. Sched. 23, No. 4, 465--485 (2020; Zbl 1446.90073) Full Text: DOI
Bulhões, Teobaldo; Sadykov, Ruslan; Subramanian, Anand; Uchoa, Eduardo On the exact solution of a large class of parallel machine scheduling problems. (English) Zbl 1446.90074 J. Sched. 23, No. 4, 411-429 (2020). MSC: 90B35 68M20 90C57 PDF BibTeX XML Cite \textit{T. Bulhões} et al., J. Sched. 23, No. 4, 411--429 (2020; Zbl 1446.90074) Full Text: DOI
Gschwind, Timo; Irnich, Stefan; Tilk, Christian; Emde, Simon Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. (English) Zbl 1446.90079 J. Sched. 23, No. 3, 363-377 (2020). MSC: 90B35 68M20 90B06 90C57 PDF BibTeX XML Cite \textit{T. Gschwind} et al., J. Sched. 23, No. 3, 363--377 (2020; Zbl 1446.90079) Full Text: DOI
Watermeyer, Kai; Zimmermann, Jürgen A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. (English) Zbl 1446.90087 OR Spectrum 42, No. 2, 427-460 (2020). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{K. Watermeyer} and \textit{J. Zimmermann}, OR Spectrum 42, No. 2, 427--460 (2020; Zbl 1446.90087) Full Text: DOI
Nannicini, Giacomo; Sartor, Giorgio; Traversi, Emiliano; Wolfler Calvo, Roberto An exact algorithm for robust influence maximization. (English) Zbl 1450.90020 Math. Program. 183, No. 1-2 (B), 419-453 (2020). MSC: 90C17 90C11 90C57 PDF BibTeX XML Cite \textit{G. Nannicini} et al., Math. Program. 183, No. 1--2 (B), 419--453 (2020; Zbl 1450.90020) Full Text: DOI
Bienstock, Daniel; Chen, Chen; Muñoz, Gonzalo Outer-product-free sets for polynomial optimization and oracle-based cuts. (English) Zbl 1450.90024 Math. Program. 183, No. 1-2 (B), 105-148 (2020). MSC: 90C23 90C30 90C57 PDF BibTeX XML Cite \textit{D. Bienstock} et al., Math. Program. 183, No. 1--2 (B), 105--148 (2020; Zbl 1450.90024) Full Text: DOI
Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile Symmetry-breaking inequalities for ILP with structured sub-symmetry. (English) Zbl 1450.90010 Math. Program. 183, No. 1-2 (B), 61-103 (2020). MSC: 90C10 90C57 90C90 PDF BibTeX XML Cite \textit{P. Bendotti} et al., Math. Program. 183, No. 1--2 (B), 61--103 (2020; Zbl 1450.90010) Full Text: DOI
Coey, Chris; Lubin, Miles; Vielma, Juan Pablo Outer approximation with conic certificates for mixed-integer convex problems. (English) Zbl 1441.90095 Math. Program. Comput. 12, No. 2, 249-293 (2020). MSC: 90C11 90C25 90C26 90C57 PDF BibTeX XML Cite \textit{C. Coey} et al., Math. Program. Comput. 12, No. 2, 249--293 (2020; Zbl 1441.90095) Full Text: DOI
Subramanyam, Anirudh; Gounaris, Chrysanthos E.; Wiesemann, Wolfram \(K\)-adaptability in two-stage mixed-integer robust optimization. (English) Zbl 1441.90101 Math. Program. Comput. 12, No. 2, 193-224 (2020). MSC: 90C11 90C15 90C34 90C47 PDF BibTeX XML Cite \textit{A. Subramanyam} et al., Math. Program. Comput. 12, No. 2, 193--224 (2020; Zbl 1441.90101) Full Text: DOI
Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V. On the impact of running intersection inequalities for globally solving polynomial optimization problems. (English) Zbl 1441.90097 Math. Program. Comput. 12, No. 2, 165-191 (2020). MSC: 90C11 90C26 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} et al., Math. Program. Comput. 12, No. 2, 165--191 (2020; Zbl 1441.90097) Full Text: DOI
Furini, Fabio; Ljubić, Ivana; Malaguti, Enrico; Paronuzzi, Paolo On integer and bilevel formulations for the \(k\)-vertex cut problem. (English) Zbl 1447.90011 Math. Program. Comput. 12, No. 2, 133-164 (2020). MSC: 90B10 90C10 90C05 90C27 90C57 90C35 05C85 PDF BibTeX XML Cite \textit{F. Furini} et al., Math. Program. Comput. 12, No. 2, 133--164 (2020; Zbl 1447.90011) Full Text: DOI
Nelles, Oliver Nonlinear system identification. From classical approaches to neural networks, fuzzy models, and Gaussian processes. 2nd edition. (English) Zbl 1453.93001 Cham: Springer (ISBN 978-3-030-47438-6/hbk; 978-3-030-47439-3/ebook). xxviii, 1225 p. (2020). MSC: 93-01 93-02 93B30 93C10 93C42 92B20 93C15 PDF BibTeX XML Cite \textit{O. Nelles}, Nonlinear system identification. From classical approaches to neural networks, fuzzy models, and Gaussian processes. 2nd edition. Cham: Springer (2020; Zbl 1453.93001) Full Text: DOI
Hu, Jiaming; Miao, Cuixia; Zou, Juan A branch-and-bound algorithm for uniform machines scheduling problem with in-tree precedence constraints. (Chinese. English summary) Zbl 1449.90105 J. Qufu Norm. Univ., Nat. Sci. 46, No. 1, 4-10 (2020). MSC: 90B35 90C57 PDF BibTeX XML Cite \textit{J. Hu} et al., J. Qufu Norm. Univ., Nat. Sci. 46, No. 1, 4--10 (2020; Zbl 1449.90105) Full Text: DOI
Jara-Moroni, Francisco; Mitchell, John E.; Pang, Jong-Shi; Wächter, Andreas An enhanced logical benders approach for linear programs with complementarity constraints. (English) Zbl 1447.90040 J. Glob. Optim. 77, No. 4, 687-714 (2020). MSC: 90C26 90C33 90C57 PDF BibTeX XML Cite \textit{F. Jara-Moroni} et al., J. Glob. Optim. 77, No. 4, 687--714 (2020; Zbl 1447.90040) Full Text: DOI
Shimizu, Satoshi; Yamaguchi, Kazuaki; Masuda, Sumio A maximum edge-weight clique extraction algorithm based on branch-and-bound. (English) Zbl 07225961 Discrete Optim. 37, Article ID 100583, 15 p. (2020). MSC: 90C PDF BibTeX XML Cite \textit{S. Shimizu} et al., Discrete Optim. 37, Article ID 100583, 15 p. (2020; Zbl 07225961) Full Text: DOI
Gupte, Akshay; Kalinowski, Thomas; Rigterink, Fabian; Waterer, Hamish Extended formulations for convex hulls of some bilinear functions. (English) Zbl 07225953 Discrete Optim. 36, Article ID 100569, 33 p. (2020). MSC: 90C57 90C26 52B12 PDF BibTeX XML Cite \textit{A. Gupte} et al., Discrete Optim. 36, Article ID 100569, 33 p. (2020; Zbl 07225953) Full Text: DOI
Cho, Yunhi; Kim, Seonhwa Volume of hypercubes clipped by hyperplanes and combinatorial identities. (English) Zbl 1444.52003 Electron. J. Linear Algebra 36, 228-255 (2020). Reviewer: Piotr Pokora (Kraków) MSC: 52A38 90C57 52C35 PDF BibTeX XML Cite \textit{Y. Cho} and \textit{S. Kim}, Electron. J. Linear Algebra 36, 228--255 (2020; Zbl 1444.52003) Full Text: Link
Fabián López Pérez, Jesús; Ekin, Tahir; Jimenez, Jesus A.; Méndez Mediavilla, Francis A. Risk-balanced territory design optimization for a micro finance institution. (English) Zbl 1449.90151 J. Ind. Manag. Optim. 16, No. 2, 741-758 (2020). MSC: 90B50 90C11 90B80 90C57 90C59 91B05 PDF BibTeX XML Cite \textit{J. Fabián López Pérez} et al., J. Ind. Manag. Optim. 16, No. 2, 741--758 (2020; Zbl 1449.90151) Full Text: DOI
Kaparis, Konstantinos; Letchford, Adam N.; Mourtos, Ioannis On matroid parity and matching polytopes. (English) Zbl 1443.05030 Discrete Appl. Math. 284, 322-331 (2020). MSC: 05B35 52B40 90C57 PDF BibTeX XML Cite \textit{K. Kaparis} et al., Discrete Appl. Math. 284, 322--331 (2020; Zbl 1443.05030) Full Text: DOI
Briheche, Yann; Barbaresco, Frederic; Bennis, Fouad; Chablat, Damien Branch-and-bound method for just-in-time optimization of radar search patterns. (English) Zbl 1436.90118 Bennis, Fouad (ed.) et al., Nature-inspired methods for metaheuristics optimization. Algorithms and applications in science and engineering. Cham: Springer. Model. Optim. Sci. Technol. 16, 465-488 (2020). MSC: 90C27 90C57 90C59 90C90 PDF BibTeX XML Cite \textit{Y. Briheche} et al., Model. Optim. Sci. Technol. 16, 465--488 (2020; Zbl 1436.90118) Full Text: DOI
Hojny, Christopher Packing, partitioning, and covering symresacks. (English) Zbl 1446.90110 Discrete Appl. Math. 283, 689-717 (2020). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{C. Hojny}, Discrete Appl. Math. 283, 689--717 (2020; Zbl 1446.90110) Full Text: DOI
Luedtke, James; D’Ambrosio, Claudia; Linderoth, Jeff; Schweiger, Jonas Strong convex nonlinear relaxations of the pooling problem. (English) Zbl 1445.90088 SIAM J. Optim. 30, No. 2, 1582-1609 (2020). MSC: 90C26 90C57 PDF BibTeX XML Cite \textit{J. Luedtke} et al., SIAM J. Optim. 30, No. 2, 1582--1609 (2020; Zbl 1445.90088) Full Text: DOI
Queiroga, Eduardo; Frota, Yuri; Sadykov, Ruslan; Subramanian, Anand; Uchoa, Eduardo; Vidal, Thibaut On the exact solution of vehicle routing problems with backhauls. (English) Zbl 1443.90128 Eur. J. Oper. Res. 287, No. 1, 76-89 (2020). MSC: 90B06 90C57 90C10 PDF BibTeX XML Cite \textit{E. Queiroga} et al., Eur. J. Oper. Res. 287, No. 1, 76--89 (2020; Zbl 1443.90128) Full Text: DOI
Ritt, Marcus; Pereira, Jordi Heuristic and exact algorithms for minimum-weight non-spanning arborescences. (English) Zbl 1443.90325 Eur. J. Oper. Res. 287, No. 1, 61-75 (2020). MSC: 90C35 90C10 90C57 90C59 PDF BibTeX XML Cite \textit{M. Ritt} and \textit{J. Pereira}, Eur. J. Oper. Res. 287, No. 1, 61--75 (2020; Zbl 1443.90325) Full Text: DOI
Yuan, Yuan; Cattaruzza, Diego; Ogier, Maxime; Semet, Frédéric A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. (English) Zbl 1443.90327 Eur. J. Oper. Res. 286, No. 3, 849-866 (2020). MSC: 90C35 90C27 90C57 PDF BibTeX XML Cite \textit{Y. Yuan} et al., Eur. J. Oper. Res. 286, No. 3, 849--866 (2020; Zbl 1443.90327) Full Text: DOI
Bollwein, Ferdinand; Dahmen, Martin; Westphal, Stephan A branch & bound algorithm to determine optimal cross-splits for decision tree induction. (English) Zbl 1435.68254 Ann. Math. Artif. Intell. 88, No. 4, 291-311 (2020). MSC: 68T05 90C27 68W40 PDF BibTeX XML Cite \textit{F. Bollwein} et al., Ann. Math. Artif. Intell. 88, No. 4, 291--311 (2020; Zbl 1435.68254) Full Text: DOI
Dash, Sanjeeb; Günlük, Oktay; Morán R., Diego A. Lattice closures of polyhedra. (English) Zbl 1445.90063 Math. Program. 181, No. 1 (A), 119-147 (2020). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{S. Dash} et al., Math. Program. 181, No. 1 (A), 119--147 (2020; Zbl 1445.90063) Full Text: DOI
Davari, Morteza; Ranjbar, Mohammad; De Causmaecker, Patrick; Leus, Roel Minimizing makespan on a single machine with release dates and inventory constraints. (English) Zbl 1443.90177 Eur. J. Oper. Res. 286, No. 1, 115-128 (2020). MSC: 90B35 90C39 90C57 PDF BibTeX XML Cite \textit{M. Davari} et al., Eur. J. Oper. Res. 286, No. 1, 115--128 (2020; Zbl 1443.90177) Full Text: DOI
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario; Sadykov, Ruslan Corrigendum to: “Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem”. (English) Zbl 1434.90098 Eur. J. Oper. Res. 285, No. 3, 1199-1203 (2020). MSC: 90C10 90C35 90C27 90C57 PDF BibTeX XML Cite \textit{L. Gouveia} et al., Eur. J. Oper. Res. 285, No. 3, 1199--1203 (2020; Zbl 1434.90098) Full Text: DOI
Yoo, Yeawon; Escobedo, Adolfo R.; Skolfield, J. Kyle A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings. (English) Zbl 1443.91120 Eur. J. Oper. Res. 285, No. 3, 1025-1041 (2020). MSC: 91B06 62H20 90C57 PDF BibTeX XML Cite \textit{Y. Yoo} et al., Eur. J. Oper. Res. 285, No. 3, 1025--1041 (2020; Zbl 1443.91120) Full Text: DOI
Zhang, Yi; Sahinidis, Nikolaos V.; Nohra, Carlos; Rong, Gang Optimality-based domain reduction for inequality-constrained NLP and MINLP problems. (English) Zbl 07203798 J. Glob. Optim. 77, No. 3, 425-454 (2020). MSC: 90C30 90C11 90C57 PDF BibTeX XML Cite \textit{Y. Zhang} et al., J. Glob. Optim. 77, No. 3, 425--454 (2020; Zbl 07203798) Full Text: DOI
Lee, Wen-Chiung; Wang, Jen-Ya A three-agent scheduling problem for minimizing the flow time on two machines. (English) Zbl 1443.90247 RAIRO, Oper. Res. 54, No. 2, 307-323 (2020). MSC: 90C05 90B35 90-08 PDF BibTeX XML Cite \textit{W.-C. Lee} and \textit{J.-Y. Wang}, RAIRO, Oper. Res. 54, No. 2, 307--323 (2020; Zbl 1443.90247) Full Text: DOI
de Andrade, Rafael Castro; Saraiva, Rommel Dias MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles. (English) Zbl 1443.90321 Ann. Oper. Res. 286, No. 1-2, 147-172 (2020). MSC: 90C35 PDF BibTeX XML Cite \textit{R. C. de Andrade} and \textit{R. D. Saraiva}, Ann. Oper. Res. 286, No. 1--2, 147--172 (2020; Zbl 1443.90321) Full Text: DOI
Borghini, Fabrizio; Méndez-Díaz, Isabel; Zabala, Paula An exact algorithm for the edge coloring by total labeling problem. (English) Zbl 1439.05080 Ann. Oper. Res. 286, No. 1-2, 11-31 (2020). MSC: 05C15 05C85 05C78 90C57 90C10 90B18 90B50 90C59 90C30 PDF BibTeX XML Cite \textit{F. Borghini} et al., Ann. Oper. Res. 286, No. 1--2, 11--31 (2020; Zbl 1439.05080) Full Text: DOI
Aziez, Imadeddine; Côté, Jean-François; Coelho, Leandro C. Exact algorithms for the multi-pickup and delivery problem with time windows. (English) Zbl 1441.90016 Eur. J. Oper. Res. 284, No. 3, 906-919 (2020). MSC: 90B06 90C57 PDF BibTeX XML Cite \textit{I. Aziez} et al., Eur. J. Oper. Res. 284, No. 3, 906--919 (2020; Zbl 1441.90016) Full Text: DOI
Li, Zixiang; Kucukkoc, Ibrahim; Zhang, Zikai Branch, bound and remember algorithm for two-sided assembly line balancing problem. (English) Zbl 1441.90055 Eur. J. Oper. Res. 284, No. 3, 896-905 (2020). MSC: 90B30 90C27 90C57 PDF BibTeX XML Cite \textit{Z. Li} et al., Eur. J. Oper. Res. 284, No. 3, 896--905 (2020; Zbl 1441.90055) Full Text: DOI
Gmys, Jan; Mezmaz, Mohand; Melab, Nouredine; Tuyttens, Daniel A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem. (English) Zbl 1441.90061 Eur. J. Oper. Res. 284, No. 3, 814-833 (2020). MSC: 90B35 90C57 65K05 65Y05 PDF BibTeX XML Cite \textit{J. Gmys} et al., Eur. J. Oper. Res. 284, No. 3, 814--833 (2020; Zbl 1441.90061) Full Text: DOI
Xia, Yong; Wang, Longfei; Wang, Xiaohui Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds. (English) Zbl 1442.90156 J. Glob. Optim. 77, No. 2, 301-318 (2020). MSC: 90C26 90C20 90C22 PDF BibTeX XML Cite \textit{Y. Xia} et al., J. Glob. Optim. 77, No. 2, 301--318 (2020; Zbl 1442.90156) Full Text: DOI
Paulavičius, R.; Adjiman, C. S. New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm. (English) Zbl 1442.90151 J. Glob. Optim. 77, No. 2, 197-225 (2020). MSC: 90C26 90C57 PDF BibTeX XML Cite \textit{R. Paulavičius} and \textit{C. S. Adjiman}, J. Glob. Optim. 77, No. 2, 197--225 (2020; Zbl 1442.90151) Full Text: DOI
Bastubbe, Michael; Lübbecke, Marco E. A branch-and-price algorithm for capacitated hypergraph vertex separation. (English) Zbl 1437.90133 Math. Program. Comput. 12, No. 1, 39-68 (2020). MSC: 90C27 90C09 49M27 90C35 90C57 90C10 05C65 PDF BibTeX XML Cite \textit{M. Bastubbe} and \textit{M. E. Lübbecke}, Math. Program. Comput. 12, No. 1, 39--68 (2020; Zbl 1437.90133) Full Text: DOI
Shen, Peiping; Huang, Bingdi Global algorithm for solving linear multiplicative programming problems. (English) Zbl 1442.90153 Optim. Lett. 14, No. 3, 693-710 (2020). MSC: 90C26 90C57 PDF BibTeX XML Cite \textit{P. Shen} and \textit{B. Huang}, Optim. Lett. 14, No. 3, 693--710 (2020; Zbl 1442.90153) Full Text: DOI
Deza, Michel; Dutour Sikirić, Mathieu Generalized cut and metric polytopes of graphs and simplicial complexes. (English) Zbl 1442.05253 Optim. Lett. 14, No. 2, 273-289 (2020). MSC: 05E45 52B12 90C27 90C57 PDF BibTeX XML Cite \textit{M. Deza} and \textit{M. Dutour Sikirić}, Optim. Lett. 14, No. 2, 273--289 (2020; Zbl 1442.05253) Full Text: DOI
Aribi, Walid Ben; Ammar, Hamadi; Alaya, Mohamed Ben Stochastic global optimization using tangent minorants for Lipschitz functions. (English) Zbl 1434.90147 J. Comput. Appl. Math. 373, Article ID 112462, 15 p. (2020). MSC: 90C26 90C15 90C57 PDF BibTeX XML Cite \textit{W. B. Aribi} et al., J. Comput. Appl. Math. 373, Article ID 112462, 15 p. (2020; Zbl 1434.90147) Full Text: DOI
Eichfelder, Gabriele; Niebling, Julia; Rocktäschel, Stefan An algorithmic approach to multiobjective optimization with decision uncertainty. (English) Zbl 07192413 J. Glob. Optim. 77, No. 1, 3-25 (2020). MSC: 90C PDF BibTeX XML Cite \textit{G. Eichfelder} et al., J. Glob. Optim. 77, No. 1, 3--25 (2020; Zbl 07192413) Full Text: DOI
Ertem, Zeynep; Lykhovyd, Eugene; Wang, Yiming; Butenko, Sergiy The maximum independent union of cliques problem: complexity and exact approaches. (English) Zbl 1448.90093 J. Glob. Optim. 76, No. 3, 545-562 (2020). Reviewer: Patric R. J. Östergård (Aalto) MSC: 90C35 68Q25 90C10 90C57 PDF BibTeX XML Cite \textit{Z. Ertem} et al., J. Glob. Optim. 76, No. 3, 545--562 (2020; Zbl 1448.90093) Full Text: DOI
Xu, Wei; Feng, Zhi Guo; Lin, Gui-Hua; Yu, Liying Optimal scheduling of discrete-time switched linear systems. (English) Zbl 1436.93080 IMA J. Math. Control Inf. 37, No. 1, 1-18 (2020). MSC: 93C55 93C30 93C05 90B06 90B35 PDF BibTeX XML Cite \textit{W. Xu} et al., IMA J. Math. Control Inf. 37, No. 1, 1--18 (2020; Zbl 1436.93080) Full Text: DOI
Salman, Raad; Ekstedt, Fredrik; Damaschke, Peter Branch-and-bound for the precedence constrained generalized traveling salesman problem. (English) Zbl 07186957 Oper. Res. Lett. 48, No. 2, 163-166 (2020). MSC: 90 PDF BibTeX XML Cite \textit{R. Salman} et al., Oper. Res. Lett. 48, No. 2, 163--166 (2020; Zbl 07186957) Full Text: DOI
Rocktäschel, Stefan A branch-and-bound algorithm for multiobjective mixed-integer convex optimization. (English) Zbl 1446.90125 BestMasters. Wiesbaden: Springer Spektrum (ISBN 978-3-658-29148-8/pbk; 978-3-658-29149-5/ebook). viii, 70 p. (2020). MSC: 90C25 90C11 90C29 65K05 90C57 PDF BibTeX XML Cite \textit{S. Rocktäschel}, A branch-and-bound algorithm for multiobjective mixed-integer convex optimization. Wiesbaden: Springer Spektrum (2020; Zbl 1446.90125) Full Text: DOI
Lin, Ruizhi; Zhang, Heping Fractional matching preclusion number of graphs and the perfect matching polytope. (English) Zbl 1435.05162 J. Comb. Optim. 39, No. 3, 915-932 (2020). MSC: 05C70 05C72 05C76 90C27 90C35 90C57 PDF BibTeX XML Cite \textit{R. Lin} and \textit{H. Zhang}, J. Comb. Optim. 39, No. 3, 915--932 (2020; Zbl 1435.05162) Full Text: DOI
Kobayashi, Ken; Takano, Yuich A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems. (English) Zbl 1440.90031 Comput. Optim. Appl. 75, No. 2, 493-513 (2020). MSC: 90C11 90C22 90C57 PDF BibTeX XML Cite \textit{K. Kobayashi} and \textit{Y. Takano}, Comput. Optim. Appl. 75, No. 2, 493--513 (2020; Zbl 1440.90031) Full Text: DOI
Bouras, Ikram; Figueiredo, Rosa; Poss, Michael; Zhou, Fen Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach. (English) Zbl 1433.90038 Optim. Lett. 14, No. 1, 209-227 (2020). MSC: 90B18 90C11 90C30 90C57 PDF BibTeX XML Cite \textit{I. Bouras} et al., Optim. Lett. 14, No. 1, 209--227 (2020; Zbl 1433.90038) Full Text: DOI