Bodur, Merve; Chan, Timothy C. Y.; Zhu, Ian Yihang Inverse mixed integer optimization: polyhedral insights and trust region methods. (English) Zbl 07552218 INFORMS J. Comput. 34, No. 3, 1471-1488 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{M. Bodur} et al., INFORMS J. Comput. 34, No. 3, 1471--1488 (2022; Zbl 07552218) Full Text: DOI OpenURL
Prata, Bruno de Athayde; Fernandez-Viagas, Victor; Framinan, Jose M.; Rodrigues, Carlos Diego Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. (English) Zbl 07546587 Comput. Oper. Res. 145, Article ID 105880, 10 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{B. de A. Prata} et al., Comput. Oper. Res. 145, Article ID 105880, 10 p. (2022; Zbl 07546587) Full Text: DOI OpenURL
Dey, Santanu S.; Kazachkov, Aleksandr; Lodi, Andrea; Munoz, Gonzalo Cutting plane generation through sparse principal component analysis. (English) Zbl 07543646 SIAM J. Optim. 32, No. 2, 1319-1343 (2022). MSC: 90C26 90C20 90-08 PDF BibTeX XML Cite \textit{S. S. Dey} et al., SIAM J. Optim. 32, No. 2, 1319--1343 (2022; Zbl 07543646) Full Text: DOI OpenURL
Djeumou Fomeni, Franklin; Kaparis, Konstantinos; Letchford, Adam N. A cut-and-branch algorithm for the quadratic knapsack problem. (English) Zbl 07538827 Discrete Optim. 44, Article ID 100579, 18 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{F. Djeumou Fomeni} et al., Discrete Optim. 44, Article ID 100579, 18 p. (2022; Zbl 07538827) Full Text: DOI OpenURL
Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen On a generalization of the Chvátal-Gomory closure. (English) Zbl 07495416 Math. Program. 192, No. 1-2 (B), 149-175 (2022). MSC: 90C10 90C11 90C27 90C57 PDF BibTeX XML Cite \textit{S. Dash} et al., Math. Program. 192, No. 1--2 (B), 149--175 (2022; Zbl 07495416) Full Text: DOI OpenURL
Kaparis, Konstantinos; Letchford, Adam N.; Mourtos, Ioannis Generalised 2-circulant inequalities for the max-cut problem. (English) Zbl 07487774 Oper. Res. Lett. 50, No. 2, 122-128 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{K. Kaparis} et al., Oper. Res. Lett. 50, No. 2, 122--128 (2022; Zbl 07487774) Full Text: DOI OpenURL
Büyüktahtakın, İ. Esra Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs. (English) Zbl 1478.90065 Ann. Oper. Res. 309, No. 1, 1-35 (2022). MSC: 90C15 90C11 90C10 90C27 91G70 PDF BibTeX XML Cite \textit{İ. E. Büyüktahtakın}, Ann. Oper. Res. 309, No. 1, 1--35 (2022; Zbl 1478.90065) Full Text: DOI OpenURL
Morapitiye, Sunil; Kis, Tamás Strong cuts from compatibility relations for the dial-a-ride problem. (English) Zbl 1483.90170 Discrete Appl. Math. 309, 240-257 (2022). MSC: 90C35 90B06 PDF BibTeX XML Cite \textit{S. Morapitiye} and \textit{T. Kis}, Discrete Appl. Math. 309, 240--257 (2022; Zbl 1483.90170) Full Text: DOI OpenURL
Brandenberg, René; Stursberg, Paul Refined cut selection for Benders decomposition: applied to network capacity expansion problems. (English) Zbl 1485.90064 Math. Methods Oper. Res. 94, No. 3, 383-412 (2021). MSC: 90C05 90C57 90C29 PDF BibTeX XML Cite \textit{R. Brandenberg} and \textit{P. Stursberg}, Math. Methods Oper. Res. 94, No. 3, 383--412 (2021; Zbl 1485.90064) Full Text: DOI OpenURL
Nannicini, Giacomo; Traversi, Emiliano; Calvo, Roberto Wolfler A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs. (English) Zbl 1480.49034 Math. Program. Comput. 13, No. 4, 645-681 (2021). MSC: 49M27 90C15 90C57 90C39 PDF BibTeX XML Cite \textit{G. Nannicini} et al., Math. Program. Comput. 13, No. 4, 645--681 (2021; Zbl 1480.49034) Full Text: DOI OpenURL
Basu, Amitabh; Conforti, Michele; Di Summa, Marco; Jiang, Hongyi 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 \textit{A. Basu} et al., Lect. Notes Comput. Sci. 12707, 383--398 (2021; Zbl 1483.90083) Full Text: DOI arXiv OpenURL
Del Pia, Alberto; Linderoth, Jeff; Zhu, Haoran 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 \textit{A. Del Pia} et al., Lect. Notes Comput. Sci. 12707, 193--207 (2021; Zbl 1482.90180) Full Text: DOI arXiv OpenURL
Chen, Liang; Chen, Wei-Kun; Yang, Mu-Ming; Dai, Yu-Hong An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron. (English) Zbl 1481.90230 J. Glob. Optim. 81, No. 3, 659-689 (2021). MSC: 90C11 90C27 PDF BibTeX XML Cite \textit{L. Chen} et al., J. Glob. Optim. 81, No. 3, 659--689 (2021; Zbl 1481.90230) Full Text: DOI arXiv OpenURL
Aardal, Karen; Lodi, Andrea; Tramontani, Andrea; von Heymann, Frederik; Wolsey, Laurence A. Lattice reformulation cuts. (English) Zbl 1479.90134 SIAM J. Optim. 31, No. 4, 2539-2557 (2021). MSC: 90C10 11H06 PDF BibTeX XML Cite \textit{K. Aardal} et al., SIAM J. Optim. 31, No. 4, 2539--2557 (2021; Zbl 1479.90134) Full Text: DOI OpenURL
Neumann, Christoph; Stein, Oliver Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts. (English) Zbl 1479.90142 SIAM J. Optim. 31, No. 3, 2396-2428 (2021). MSC: 90C11 90C10 90C31 90C30 PDF BibTeX XML Cite \textit{C. Neumann} and \textit{O. Stein}, SIAM J. Optim. 31, No. 3, 2396--2428 (2021; Zbl 1479.90142) Full Text: DOI OpenURL
Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen Generalized Chvátal-Gomory closures for integer programs with bounds on variables. (English) Zbl 1478.90059 Math. Program. 190, No. 1-2 (A), 393-425 (2021). MSC: 90C10 90C11 90C27 90C57 PDF BibTeX XML Cite \textit{S. Dash} et al., Math. Program. 190, No. 1--2 (A), 393--425 (2021; Zbl 1478.90059) Full Text: DOI OpenURL
Galli, Laura; Letchford, Adam N. Valid inequalities for quadratic optimisation with domain constraints. (English) Zbl 07411465 Discrete Optim. 41, Article ID 100661, 19 p. (2021). MSC: 90Cxx PDF BibTeX XML Cite \textit{L. Galli} and \textit{A. N. Letchford}, Discrete Optim. 41, Article ID 100661, 19 p. (2021; Zbl 07411465) Full Text: DOI OpenURL
Bansal, Manish; Zhang, Yingqiu Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs. (English) Zbl 1478.90062 J. Glob. Optim. 81, No. 2, 391-433 (2021). MSC: 90C11 90C17 90C15 PDF BibTeX XML Cite \textit{M. Bansal} and \textit{Y. Zhang}, J. Glob. Optim. 81, No. 2, 391--433 (2021; Zbl 1478.90062) Full Text: DOI OpenURL
Nguyen, Trang T.; Richard, Jean-Philippe P.; Tawarmalani, Mohit Convexification techniques for linear complementarity constraints. (English) Zbl 1473.90163 J. Glob. Optim. 80, No. 2, 249-286 (2021). MSC: 90C30 90C33 PDF BibTeX XML Cite \textit{T. T. Nguyen} et al., J. Glob. Optim. 80, No. 2, 249--286 (2021; Zbl 1473.90163) Full Text: DOI OpenURL
Kıbış, Eyyüb Y.; Büyüktahtakın, İ. Esra; Haight, Robert G.; Akhundov, Najmaddin; Knight, Kathleen; Flower, Charles E. A multistage stochastic programming approach to the optimal surveillance and control of the emerald ash borer in cities. (English) Zbl 07362348 INFORMS J. Comput. 33, No. 2, 808-834 (2021). MSC: 90Cxx PDF BibTeX XML Cite \textit{E. Y. Kıbış} et al., INFORMS J. Comput. 33, No. 2, 808--834 (2021; Zbl 07362348) Full Text: DOI OpenURL
Rostami, Borzou; Kämmerling, Nicolas; Naoum-Sawaya, Joe; Buchheim, Christoph; Clausen, Uwe Stochastic single-allocation hub location. (English) Zbl 1487.90445 Eur. J. Oper. Res. 289, No. 3, 1087-1106 (2021). MSC: 90B80 90C15 PDF BibTeX XML Cite \textit{B. Rostami} et al., Eur. J. Oper. Res. 289, No. 3, 1087--1106 (2021; Zbl 1487.90445) Full Text: DOI OpenURL
Brito, Samuel Souza; Santos, Haroldo Gambini Preprocessing and cutting planes with conflict graphs. (English) Zbl 07350565 Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{S. S. Brito} and \textit{H. G. Santos}, Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021; Zbl 07350565) Full Text: DOI arXiv OpenURL
Davarnia, Danial; van Hoeve, Willem-Jan Outer approximation for integer nonlinear programs via decision diagrams. (English) Zbl 1465.90044 Math. Program. 187, No. 1-2 (A), 111-150 (2021). MSC: 90C10 90C26 90C30 90C35 90C57 90C90 PDF BibTeX XML Cite \textit{D. Davarnia} and \textit{W.-J. van Hoeve}, Math. Program. 187, No. 1--2 (A), 111--150 (2021; Zbl 1465.90044) Full Text: DOI OpenURL
Hojny, Christopher Strong IP formulations need large coefficients. (English) Zbl 1474.90293 Discrete Optim. 39, Article ID 100624, 25 p. (2021). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{C. Hojny}, Discrete Optim. 39, Article ID 100624, 25 p. (2021; Zbl 1474.90293) Full Text: DOI OpenURL
Davarnia, Danial Strong relaxations for continuous nonlinear programs based on decision diagrams. (English) Zbl 07331259 Oper. Res. Lett. 49, No. 2, 239-245 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{D. Davarnia}, Oper. Res. Lett. 49, No. 2, 239--245 (2021; Zbl 07331259) Full Text: DOI OpenURL
Yu, Qimeng; Küçükyavuz, Simge A polyhedral approach to bisubmodular function minimization. (English) Zbl 07331219 Oper. Res. Lett. 49, No. 1, 5-10 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{Q. Yu} and \textit{S. Küçükyavuz}, Oper. Res. Lett. 49, No. 1, 5--10 (2021; Zbl 07331219) Full Text: DOI arXiv OpenURL
Vitor, Fabio; Easton, Todd Approximate and exact merging of knapsack constraints with cover inequalities. (English) Zbl 1460.90113 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 1460.90113) Full Text: DOI OpenURL
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 1457.90012 SN Oper. Res. Forum 2, No. 1, Paper No. 8, 34 p. (2021). MSC: 90B06 90C27 90C59 90C39 PDF BibTeX XML Cite \textit{A. Ceselli} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 8, 34 p. (2021; Zbl 1457.90012) Full Text: DOI OpenURL
Basu, Amitabh; Conforti, Michele; Di Summa, Marco; Jiang, Hongyi Split cuts in the plane. (English) Zbl 1458.90476 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 1458.90476) Full Text: DOI arXiv OpenURL
Dadush, Daniel; Tiwari, Samarth 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 \textit{D. Dadush} and \textit{S. Tiwari}, LIPIcs -- Leibniz Int. Proc. Inform. 169, Article 34, 35 p. (2020; Zbl 07561762) Full Text: DOI OpenURL
Le Berre, Daniel; Marquis, Pierre; Wallon, Romain 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 \textit{D. Le Berre} et al., Lect. Notes Comput. Sci. 12178, 322--331 (2020; Zbl 07331030) Full Text: DOI arXiv OpenURL
Yarullin, Rashid 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 \textit{R. Yarullin}, Commun. Comput. Inf. Sci. 1275, 150--163 (2020; Zbl 1460.90139) Full Text: DOI OpenURL
Göös, Mika; Koroth, Sajin; Mertz, Ian; Pitassi, Toniann 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 \textit{M. Göös} et al., in: 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; Zbl 07298231) Full Text: DOI arXiv OpenURL
Letelier, Orlando Rivera; Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Muñoz, Gonzalo Production scheduling for strategic open pit mine planning: a mixed-integer programming approach. (English) Zbl 1455.90069 Oper. Res. 68, No. 5, 1425-1444 (2020). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{O. R. Letelier} et al., Oper. Res. 68, No. 5, 1425--1444 (2020; Zbl 1455.90069) Full Text: DOI OpenURL
Serra, Thiago Reformulating the disjunctive cut generating linear program. (English) Zbl 1456.90105 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 1456.90105) Full Text: DOI OpenURL
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 arXiv OpenURL
Pereira, Dilson Lucas; Salles da Cunha, Alexandre Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem. (English) Zbl 1441.90170 Eur. J. Oper. Res. 284, No. 2, 413-426 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{D. L. Pereira} and \textit{A. Salles da Cunha}, Eur. J. Oper. Res. 284, No. 2, 413--426 (2020; Zbl 1441.90170) Full Text: DOI OpenURL
Kazachkov, Aleksandr M.; Nadarajah, Selvaprabu; Balas, Egon; Margot, François Partial hyperplane activation for generalized intersection cuts. (English) Zbl 1437.90111 Math. Program. Comput. 12, No. 1, 69-107 (2020). MSC: 90C11 90C27 PDF BibTeX XML Cite \textit{A. M. Kazachkov} et al., Math. Program. Comput. 12, No. 1, 69--107 (2020; Zbl 1437.90111) Full Text: DOI arXiv OpenURL
Porumbel, Daniel Projective cutting-planes. (English) Zbl 1441.90140 SIAM J. Optim. 30, No. 1, 1007-1032 (2020). MSC: 90C27 90C17 65K05 90C05 PDF BibTeX XML Cite \textit{D. Porumbel}, SIAM J. Optim. 30, No. 1, 1007--1032 (2020; Zbl 1441.90140) Full Text: DOI OpenURL
Horváth, Markó; Kis, Tamás Polyhedral results for position-based scheduling of chains on a single machine. (English) Zbl 1429.90024 Ann. Oper. Res. 284, No. 1, 283-322 (2020). MSC: 90B35 68Q25 68M20 90C05 90C57 PDF BibTeX XML Cite \textit{M. Horváth} and \textit{T. Kis}, Ann. Oper. Res. 284, No. 1, 283--322 (2020; Zbl 1429.90024) Full Text: DOI OpenURL
Basu, Amitabh; Conforti, Michele; Di Summa, Marco An extreme function which is nonnegative and discontinuous everywhere. (English) Zbl 1434.90094 Math. Program. 179, No. 1-2 (A), 447-453 (2020). MSC: 90C10 90C11 PDF BibTeX XML Cite \textit{A. Basu} et al., Math. Program. 179, No. 1--2 (A), 447--453 (2020; Zbl 1434.90094) Full Text: DOI arXiv OpenURL
Araujo, Janniele A. S.; Santos, Haroldo G.; Gendron, Bernard; Jena, Sanjay Dominik; Brito, Samuel S.; Souza, Danilo S. Strong bounds for resource constrained project scheduling: preprocessing and cutting planes. (English) Zbl 1458.90247 Comput. Oper. Res. 113, Article ID 104782, 16 p. (2020). MSC: 90B35 90C11 PDF BibTeX XML Cite \textit{J. A. S. Araujo} et al., Comput. Oper. Res. 113, Article ID 104782, 16 p. (2020; Zbl 1458.90247) Full Text: DOI arXiv OpenURL
Christian, Tjandraatmadja; Willem-Jan, van Hoeve Target cuts from relaxed decision diagrams. (English) Zbl 1474.90291 INFORMS J. Comput. 31, No. 2, 285-301 (2019). MSC: 90C10 90C05 PDF BibTeX XML Cite \textit{T. Christian} and \textit{v. H. Willem-Jan}, INFORMS J. Comput. 31, No. 2, 285--301 (2019; Zbl 1474.90291) Full Text: DOI Link OpenURL
Davarnia, Danial; Richard, Jean-Philippe P.; Içyüz-Ay, Ece; Taslimi, Bijan Network models with unsplittable node flows with application to unit train scheduling. (English) Zbl 1444.90032 Oper. Res. 67, No. 4, 1053-1068 (2019). MSC: 90B10 90C11 90B06 90B05 PDF BibTeX XML Cite \textit{D. Davarnia} et al., Oper. Res. 67, No. 4, 1053--1068 (2019; Zbl 1444.90032) Full Text: DOI Link OpenURL
Basu, Amitabh; Conforti, Michele; Di Summa, Marco; Zambelli, Giacomo Optimal cutting planes from the group relaxations. (English) Zbl 1437.90106 Math. Oper. Res. 44, No. 4, 1208-1220 (2019). MSC: 90C10 90C11 90C57 90C05 PDF BibTeX XML Cite \textit{A. Basu} et al., Math. Oper. Res. 44, No. 4, 1208--1220 (2019; Zbl 1437.90106) Full Text: DOI arXiv Link OpenURL
Ustun, Berk; Rudin, Cynthia Learning optimized risk scores. (English) Zbl 1440.68242 J. Mach. Learn. Res. 20, Paper No. 150, 75 p. (2019). MSC: 68T05 62H30 90C30 PDF BibTeX XML Cite \textit{B. Ustun} and \textit{C. Rudin}, J. Mach. Learn. Res. 20, Paper No. 150, 75 p. (2019; Zbl 1440.68242) Full Text: arXiv Link OpenURL
Hildebrand, Robert; Köppe, Matthias; Zhou, Yuan 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 \textit{R. Hildebrand} et al., Lect. Notes Comput. Sci. 11480, 247--260 (2019; Zbl 1436.90084) Full Text: DOI OpenURL
Barilla, D.; Caristi, G.; Puglisi, A. Cutting plane with non-uniform distributions. (English) Zbl 1440.90026 Far East J. Appl. Math. 101, No. 2, 93-100 (2019). MSC: 90C10 11P21 52A22 PDF BibTeX XML Cite \textit{D. Barilla} et al., Far East J. Appl. Math. 101, No. 2, 93--100 (2019; Zbl 1440.90026) Full Text: DOI OpenURL
Fukasawa, Ricardo; Poirrier, Laurent; Xavier, Álinson S. The (not so) trivial lifting in two dimensions. (English) Zbl 1434.90104 Math. Program. Comput. 11, No. 2, 211-235 (2019). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{R. Fukasawa} et al., Math. Program. Comput. 11, No. 2, 211--235 (2019; Zbl 1434.90104) Full Text: DOI OpenURL
Kumar, Ranjeet; Wenzel, Michael J.; Ellis, Matthew J.; ElBsat, Mohammad N.; Drees, Kirk H.; Zavala, Victor M. Hierarchical MPC schemes for periodic systems using stochastic programming. (English) Zbl 1429.93096 Automatica 107, 306-316 (2019). MSC: 93B45 90C15 93-08 PDF BibTeX XML Cite \textit{R. Kumar} et al., Automatica 107, 306--316 (2019; Zbl 1429.93096) Full Text: DOI arXiv OpenURL
Bruglieri, M.; Mancini, S.; Pisacane, O. The green vehicle routing problem with capacitated alternative fuel stations. (English) Zbl 1458.90065 Comput. Oper. Res. 112, Article ID 104759, 12 p. (2019). MSC: 90B06 90C11 PDF BibTeX XML Cite \textit{M. Bruglieri} et al., Comput. Oper. Res. 112, Article ID 104759, 12 p. (2019; Zbl 1458.90065) Full Text: DOI OpenURL
Davarnia, Danial; Hooker, J. N. 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 \textit{D. Davarnia} and \textit{J. N. Hooker}, Lect. Notes Comput. Sci. 11494, 225--240 (2019; Zbl 07116696) Full Text: DOI arXiv OpenURL
Li, Can; Grossmann, Ignacio E. A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables. (English) Zbl 1428.90106 J. Glob. Optim. 75, No. 2, 247-272 (2019). MSC: 90C15 90C11 90C57 PDF BibTeX XML Cite \textit{C. Li} and \textit{I. E. Grossmann}, J. Glob. Optim. 75, No. 2, 247--272 (2019; Zbl 1428.90106) Full Text: DOI OpenURL
Koch, Ivo; Marenco, Javier An integer programming approach to b-coloring. (English) Zbl 07066050 Discrete Optim. 32, 43-62 (2019). MSC: 90Cxx PDF BibTeX XML Cite \textit{I. Koch} and \textit{J. Marenco}, Discrete Optim. 32, 43--62 (2019; Zbl 07066050) Full Text: DOI OpenURL
Lee, Dabeen On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube. (English) Zbl 07066047 Discrete Optim. 32, 11-18 (2019). MSC: 90Cxx PDF BibTeX XML Cite \textit{D. Lee}, Discrete Optim. 32, 11--18 (2019; Zbl 07066047) Full Text: DOI OpenURL
Basu, Amitabh; Sankaranarayanan, Sriram Can cut-generating functions be good and efficient? (English) Zbl 1411.90221 SIAM J. Optim. 29, No. 2, 1190-1210 (2019). MSC: 90C10 90C11 90C57 PDF BibTeX XML Cite \textit{A. Basu} and \textit{S. Sankaranarayanan}, SIAM J. Optim. 29, No. 2, 1190--1210 (2019; Zbl 1411.90221) Full Text: DOI arXiv OpenURL
Bonami, Pierre; Lodi, Andrea; Schweiger, Jonas; Tramontani, Andrea Solving quadratic programming by cutting planes. (English) Zbl 1411.90247 SIAM J. Optim. 29, No. 2, 1076-1105 (2019). MSC: 90C20 90C26 PDF BibTeX XML Cite \textit{P. Bonami} et al., SIAM J. Optim. 29, No. 2, 1076--1105 (2019; Zbl 1411.90247) Full Text: DOI OpenURL
Sato, Keisuke; Izunaga, Yoichi An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs. (English) Zbl 1458.90625 Comput. Oper. Res. 106, 236-245 (2019). MSC: 90C35 90C05 90C11 PDF BibTeX XML Cite \textit{K. Sato} and \textit{Y. Izunaga}, Comput. Oper. Res. 106, 236--245 (2019; Zbl 1458.90625) Full Text: DOI arXiv OpenURL
Bansal, Manish Facets for single module and multi-module capacitated lot-sizing problems without backlogging. (English) Zbl 1436.90089 Discrete Appl. Math. 255, 117-141 (2019). Reviewer: Efstratios Rappos (Aubonne) MSC: 90C11 90C27 90C57 90B30 PDF BibTeX XML Cite \textit{M. Bansal}, Discrete Appl. Math. 255, 117--141 (2019; Zbl 1436.90089) Full Text: DOI OpenURL
Yang, Zhen; Chen, Haoxun; Chu, Feng; Wang, Nengmin An effective hybrid approach to the two-stage capacitated facility location problem. (English) Zbl 1430.90387 Eur. J. Oper. Res. 275, No. 2, 467-480 (2019). MSC: 90B80 90B06 90C10 PDF BibTeX XML Cite \textit{Z. Yang} et al., Eur. J. Oper. Res. 275, No. 2, 467--480 (2019; Zbl 1430.90387) Full Text: DOI OpenURL
Beame, Paul; Fleming, Noah; Impagliazzo, Russell; Kolokolova, Antonina; Pankratov, Denis; Pitassi, Toniann; Robere, Robert 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). MSC: 68Q25 03F20 68Q11 90C10 PDF BibTeX XML Cite \textit{P. Beame} et al., LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 10, 20 p. (2018; Zbl 1462.68077) Full Text: DOI arXiv OpenURL
Benchetrit, Yohann; Fiorini, Samuel; Huynh, Tony; Weltge, Stefan Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank. (English) Zbl 1451.90115 Math. Oper. Res. 43, No. 3, 718-725 (2018). Reviewer: Efstratios Rappos (Aubonne) MSC: 90C23 90C10 90C27 90C57 PDF BibTeX XML Cite \textit{Y. Benchetrit} et al., Math. Oper. Res. 43, No. 3, 718--725 (2018; Zbl 1451.90115) Full Text: DOI arXiv Link OpenURL
Dey, Santanu S.; Molinaro, Marco; Wang, Qianyi Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs. (English) Zbl 1432.90090 Math. Oper. Res. 43, No. 1, 304-332 (2018). MSC: 90C11 90C15 PDF BibTeX XML Cite \textit{S. S. Dey} et al., Math. Oper. Res. 43, No. 1, 304--332 (2018; Zbl 1432.90090) Full Text: DOI arXiv OpenURL
Köppe, Matthias; Zhou, Yuan Equivariant perturbation in Gomory and Johnson’s infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions. (English) Zbl 1454.90034 Discrete Optim. 30, 51-72 (2018). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{M. Köppe} and \textit{Y. Zhou}, Discrete Optim. 30, 51--72 (2018; Zbl 1454.90034) Full Text: DOI arXiv OpenURL
Fukasawa, Ricardo; Poirrier, Laurent; Xavier, Álinson S. Intersection cuts for single row corner relaxations. (English) Zbl 1402.90097 Math. Program. Comput. 10, No. 3, 423-455 (2018). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{R. Fukasawa} et al., Math. Program. Comput. 10, No. 3, 423--455 (2018; Zbl 1402.90097) Full Text: DOI OpenURL
Bodur, Merve; Luedtke, James R. Integer programming formulations for minimum deficiency interval coloring. (English) Zbl 1397.05056 Networks 72, No. 2, 249-271 (2018). MSC: 05C15 90C10 90C57 PDF BibTeX XML Cite \textit{M. Bodur} and \textit{J. R. Luedtke}, Networks 72, No. 2, 249--271 (2018; Zbl 1397.05056) Full Text: DOI OpenURL
Bodur, Merve; Del Pia, Alberto; Dey, Santanu S.; Molinaro, Marco; Pokutta, Sebastian Aggregation-based cutting-planes for packing and covering integer programs. (English) Zbl 1405.90080 Math. Program. 171, No. 1-2 (A), 331-359 (2018). MSC: 90C10 90C27 PDF BibTeX XML Cite \textit{M. Bodur} et al., Math. Program. 171, No. 1--2 (A), 331--359 (2018; Zbl 1405.90080) Full Text: DOI arXiv OpenURL
Beyersdorff, Olaf; Chew, Leroy; Mahajan, Meena; Shukla, Anil Understanding cutting planes for QBFs. (English) Zbl 1477.03245 Inf. Comput. 262, Part 1, 141-161 (2018). MSC: 03F20 PDF BibTeX XML Cite \textit{O. Beyersdorff} et al., Inf. Comput. 262, Part 1, 141--161 (2018; Zbl 1477.03245) Full Text: DOI Link OpenURL
Bansal, Manish; Huang, Kuo-Ling; Mehrotra, Sanjay Decomposition algorithms for two-stage distributionally robust mixed binary programs. (English) Zbl 1401.90126 SIAM J. Optim. 28, No. 3, 2360-2383 (2018). MSC: 90C10 90C15 PDF BibTeX XML Cite \textit{M. Bansal} et al., SIAM J. Optim. 28, No. 3, 2360--2383 (2018; Zbl 1401.90126) Full Text: DOI OpenURL
Westerlund, Tapio; Eronen, Ville-Pekka; Mäkelä, Marko M. On solving generalized convex MINLP problems using supporting hyperplane techniques. (English) Zbl 1397.90286 J. Glob. Optim. 71, No. 4, 987-1011 (2018). MSC: 90C11 90C25 PDF BibTeX XML Cite \textit{T. Westerlund} et al., J. Glob. Optim. 71, No. 4, 987--1011 (2018; Zbl 1397.90286) Full Text: DOI OpenURL
Porumbel, Daniel From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. (English) Zbl 06920588 Discrete Optim. 29, 148-173 (2018). MSC: 90Cxx PDF BibTeX XML Cite \textit{D. Porumbel}, Discrete Optim. 29, 148--173 (2018; Zbl 06920588) Full Text: DOI HAL OpenURL
Dash, Sanjeeb; Günlük, Oktay; Hildebrand, Robert Binary extended formulations of polyhedral mixed-integer sets. (English) Zbl 1391.90425 Math. Program. 170, No. 1 (B), 207-236 (2018). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{S. Dash} et al., Math. Program. 170, No. 1 (B), 207--236 (2018; Zbl 1391.90425) Full Text: DOI OpenURL
Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. (English) Zbl 1403.90157 Eur. J. Oper. Res. 270, No. 2, 530-543 (2018). MSC: 90B06 90B10 90C57 PDF BibTeX XML Cite \textit{A. Pessoa} et al., Eur. J. Oper. Res. 270, No. 2, 530--543 (2018; Zbl 1403.90157) Full Text: DOI OpenURL
Seif, Javad; Yu, Andrew J. An extensive operations and maintenance planning problem with an efficient solution method. (English) Zbl 1458.90220 Comput. Oper. Res. 95, 151-162 (2018). MSC: 90B25 90B35 90C11 PDF BibTeX XML Cite \textit{J. Seif} and \textit{A. J. Yu}, Comput. Oper. Res. 95, 151--162 (2018; Zbl 1458.90220) Full Text: DOI OpenURL
Büyüktahtakın, İ. Esra; Smith, J. Cole; Hartman, Joseph C. Partial objective inequalities for the multi-item capacitated lot-sizing problem. (English) Zbl 1391.90215 Comput. Oper. Res. 91, 132-144 (2018). MSC: 90B30 90B05 90C39 90C11 90C57 PDF BibTeX XML Cite \textit{İ. E. Büyüktahtakın} et al., Comput. Oper. Res. 91, 132--144 (2018; Zbl 1391.90215) Full Text: DOI OpenURL
Lauria, Massimo; Thapen, Neil On semantic cutting planes with very small coefficients. (English) Zbl 1477.03248 Inf. Process. Lett. 136, 70-75 (2018). MSC: 03F20 90C10 PDF BibTeX XML Cite \textit{M. Lauria} and \textit{N. Thapen}, Inf. Process. Lett. 136, 70--75 (2018; Zbl 1477.03248) Full Text: DOI OpenURL
Hong, Chun Yu; Köppe, Matthias; Zhou, Yuan Equivariant perturbation in Gomory and Johnson’s infinite group problem. V: Software for the continuous and discontinuous 1-row case. (English) Zbl 1397.90273 Optim. Methods Softw. 33, No. 3, 475-498 (2018). MSC: 90C10 90C11 PDF BibTeX XML Cite \textit{C. Y. Hong} et al., Optim. Methods Softw. 33, No. 3, 475--498 (2018; Zbl 1397.90273) Full Text: DOI arXiv OpenURL
Del Pia, Alberto; Khajavirad, Aida The multilinear polytope for acyclic hypergraphs. (English) Zbl 1396.90048 SIAM J. Optim. 28, No. 2, 1049-1076 (2018). MSC: 90C10 90C11 90C26 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} and \textit{A. Khajavirad}, SIAM J. Optim. 28, No. 2, 1049--1076 (2018; Zbl 1396.90048) Full Text: DOI OpenURL
Fairbrother, Jamie; Letchford, Adam N.; Briggs, Keith A two-level graph partitioning problem arising in mobile wireless communications. (English) Zbl 1397.90325 Comput. Optim. Appl. 69, No. 3, 653-676 (2018). MSC: 90C27 90C10 PDF BibTeX XML Cite \textit{J. Fairbrother} et al., Comput. Optim. Appl. 69, No. 3, 653--676 (2018; Zbl 1397.90325) Full Text: DOI arXiv OpenURL
Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund An improved cut-and-solve algorithm for the single-source capacitated facility location problem. (English) Zbl 1390.90008 EURO J. Comput. Optim. 6, No. 1, 1-27 (2018). MSC: 90-08 90C10 90C11 90B80 PDF BibTeX XML Cite \textit{S. L. Gadegaard} et al., EURO J. Comput. Optim. 6, No. 1, 1--27 (2018; Zbl 1390.90008) Full Text: DOI Link OpenURL
de Oliveira Oliveira, Mateus; Pudlák, Pavel 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 \textit{M. de Oliveira Oliveira} and \textit{P. Pudlák}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 3, 14 p. (2017; Zbl 1440.68078) Full Text: DOI OpenURL
Lauria, Massimo; Nordström, Jakob 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). MSC: 68Q17 03F20 05C15 13P10 PDF BibTeX XML Cite \textit{M. Lauria} and \textit{J. Nordström}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 2, 20 p. (2017; Zbl 1440.68105) Full Text: DOI OpenURL
Coniglio, Stefano; Gualandi, Stefano 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). MSC: 68R10 68Q17 90C27 90C57 PDF BibTeX XML Cite \textit{S. Coniglio} and \textit{S. Gualandi}, LIPIcs -- Leibniz Int. Proc. Inform. 75, Article 29, 13 p. (2017; Zbl 1433.68286) Full Text: DOI OpenURL
Behrends, Sönke Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming. (English) Zbl 1395.90002 Göttingen: Univ. Göttingen (Diss.). 189 p. (2017). MSC: 90-02 90C11 90C30 PDF BibTeX XML Cite \textit{S. Behrends}, Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming. Göttingen: Univ. Göttingen (Diss.) (2017; Zbl 1395.90002) Full Text: Link OpenURL
Renaud, Alexandre; Absi, Nabil; Feillet, Dominique The Stochastic Close-Enough Arc Routing Problem. (English) Zbl 1390.90083 Networks 69, No. 2, 205-221 (2017). MSC: 90B06 90C59 PDF BibTeX XML Cite \textit{A. Renaud} et al., Networks 69, No. 2, 205--221 (2017; Zbl 1390.90083) Full Text: DOI OpenURL
Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay A new lift-and-project operator. (English) Zbl 1394.90433 Eur. J. Oper. Res. 257, No. 2, 420-428 (2017). MSC: 90C11 90C27 90C60 PDF BibTeX XML Cite \textit{M. Bodur} et al., Eur. J. Oper. Res. 257, No. 2, 420--428 (2017; Zbl 1394.90433) Full Text: DOI OpenURL
Bansal, Manish; Kianfar, Kiavash Facets for continuous multi-mixing set with general coefficients and bounded integer variables. (English) Zbl 1387.90276 Discrete Optim. 26, 1-25 (2017). MSC: 90C57 90C11 52B12 PDF BibTeX XML Cite \textit{M. Bansal} and \textit{K. Kianfar}, Discrete Optim. 26, 1--25 (2017; Zbl 1387.90276) Full Text: DOI OpenURL
Yu, Jiajin; Ahmed, Shabbir Polyhedral results for a class of cardinality constrained submodular minimization problems. (English) Zbl 1387.90167 Discrete Optim. 24, 87-102 (2017). MSC: 90C11 90C30 90C57 PDF BibTeX XML Cite \textit{J. Yu} and \textit{S. Ahmed}, Discrete Optim. 24, 87--102 (2017; Zbl 1387.90167) Full Text: DOI OpenURL
Köppe, Matthias; Wang, Jiawei 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 \textit{M. Köppe} and \textit{J. Wang}, Electron. Notes Discrete Math. 62, 153--158 (2017; Zbl 1397.90274) Full Text: DOI arXiv OpenURL
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus A new general-purpose algorithm for mixed-integer bilevel linear programs. (English) Zbl 1386.90085 Oper. Res. 65, No. 6, 1615-1637 (2017). MSC: 90C11 90C57 PDF BibTeX XML Cite \textit{M. Fischetti} et al., Oper. Res. 65, No. 6, 1615--1637 (2017; Zbl 1386.90085) Full Text: DOI Link OpenURL
Razborov, Alexander On the width of semialgebraic proofs and algorithms. (English) Zbl 1386.90128 Math. Oper. Res. 42, No. 4, 1106-1134 (2017). MSC: 90C27 03F20 PDF BibTeX XML Cite \textit{A. Razborov}, Math. Oper. Res. 42, No. 4, 1106--1134 (2017; Zbl 1386.90128) Full Text: DOI Link OpenURL
Averkov, Gennadiy; Krümpelmann, Jan; Weltge, Stefan Notions of maximality for integral lattice-free polyhedra: the case of dimension three. (English) Zbl 1379.52010 Math. Oper. Res. 42, No. 4, 1035-1062 (2017). MSC: 52B10 52B20 52C07 90C11 PDF BibTeX XML Cite \textit{G. Averkov} et al., Math. Oper. Res. 42, No. 4, 1035--1062 (2017; Zbl 1379.52010) Full Text: DOI arXiv OpenURL
Rosat, Samuel; Elhallaoui, Issmail; Soumis, François; Lodi, Andrea Integral simplex using decomposition with primal cutting planes. (English) Zbl 1379.90015 Math. Program. 166, No. 1-2 (A), 327-367 (2017). MSC: 90C09 PDF BibTeX XML Cite \textit{S. Rosat} et al., Math. Program. 166, No. 1--2 (A), 327--367 (2017; Zbl 1379.90015) Full Text: DOI OpenURL
Davarnia, Danial; Richard, Jean-Philippe P.; Tawarmalani, Mohit Simultaneous convexification of bilinear functions over polytopes with application to network interdiction. (English) Zbl 1377.90066 SIAM J. Optim. 27, No. 3, 1801-1833 (2017). MSC: 90C26 90C30 90C35 90C57 90C90 91A43 PDF BibTeX XML Cite \textit{D. Davarnia} et al., SIAM J. Optim. 27, No. 3, 1801--1833 (2017; Zbl 1377.90066) Full Text: DOI OpenURL
Dash, Sanjeeb; Günlük, Oktay; Morán R., Diego A. On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width. (English) Zbl 1373.90081 SIAM J. Optim. 27, No. 3, 1340-1361 (2017). MSC: 90C11 PDF BibTeX XML Cite \textit{S. Dash} et al., SIAM J. Optim. 27, No. 3, 1340--1361 (2017; Zbl 1373.90081) Full Text: DOI OpenURL
Fomeni, Franklin Djeumou A new family of facet defining inequalities for the maximum edge-weighted clique problem. (English) Zbl 1398.90137 Optim. Lett. 11, No. 1, 47-54 (2017). MSC: 90C27 PDF BibTeX XML Cite \textit{F. D. Fomeni}, Optim. Lett. 11, No. 1, 47--54 (2017; Zbl 1398.90137) Full Text: DOI Link OpenURL
Izunaga, Yoichi; Yamamoto, Yoshitsugu A cutting plane algorithm for modularity maximization problem. (English) Zbl 1371.90033 J. Oper. Res. Soc. Japan 60, No. 1, 24-42 (2017). MSC: 90B10 90C05 90C27 PDF BibTeX XML Cite \textit{Y. Izunaga} and \textit{Y. Yamamoto}, J. Oper. Res. Soc. Japan 60, No. 1, 24--42 (2017; Zbl 1371.90033) Full Text: DOI OpenURL
Del Pia, Alberto; Khajavirad, Aida A polyhedral study of binary polynomial programs. (English) Zbl 1364.90225 Math. Oper. Res. 42, No. 2, 389-410 (2017). MSC: 90C11 90C26 90C30 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} and \textit{A. Khajavirad}, Math. Oper. Res. 42, No. 2, 389--410 (2017; Zbl 1364.90225) Full Text: DOI Link OpenURL
Castro, Jordi; Nasini, Stefano; Saldanha-da-Gama, Francisco A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. (English) Zbl 1365.90169 Math. Program. 163, No. 1-2 (A), 411-444 (2017). MSC: 90C06 90C11 90C51 90B80 PDF BibTeX XML Cite \textit{J. Castro} et al., Math. Program. 163, No. 1--2 (A), 411--444 (2017; Zbl 1365.90169) Full Text: DOI Link OpenURL
Basu, Amitabh; Hildebrand, Robert; Köppe, Matthias Equivariant perturbation in Gomory and Johnson’s infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\). (English) Zbl 1380.90190 Math. Program. 163, No. 1-2 (A), 301-358 (2017). Reviewer: Matthias Ehrgott (Lancaster) MSC: 90C10 90C57 39B52 39B62 PDF BibTeX XML Cite \textit{A. Basu} et al., Math. Program. 163, No. 1--2 (A), 301--358 (2017; Zbl 1380.90190) Full Text: DOI arXiv OpenURL