Hu, Qian; Zhang, Zhenzhen; Baldacci, Roberto; Tarantilis, Christos D.; Zachariadis, Emmanouil The bus sightseeing problem. (English) Zbl 07745355 Int. Trans. Oper. Res. 30, No. 6, 4026-4060 (2023). MSC: 90-XX PDFBibTeX XMLCite \textit{Q. Hu} et al., Int. Trans. Oper. Res. 30, No. 6, 4026--4060 (2023; Zbl 07745355) Full Text: DOI OA License
Baldacci, Roberto; Hoshino, Edna A.; Hill, Alessandro New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems. (English) Zbl 07706798 Eur. J. Oper. Res. 307, No. 2, 538-553 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{R. Baldacci} et al., Eur. J. Oper. Res. 307, No. 2, 538--553 (2023; Zbl 07706798) Full Text: DOI
Jozefiak, Adam; Shepherd, F. Bruce; Weninger, Noah A knapsack intersection hierarchy. (English) Zbl 1525.90278 Oper. Res. Lett. 51, No. 1, 72-78 (2023). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{A. Jozefiak} et al., Oper. Res. Lett. 51, No. 1, 72--78 (2023; Zbl 1525.90278) Full Text: DOI
Chen, Wei-Kun; Chen, Liang; Dai, Yu-Hong Lifting for the integer knapsack cover polyhedron. (English) Zbl 1518.90051 J. Glob. Optim. 86, No. 1, 205-249 (2023). MSC: 90C11 90C27 PDFBibTeX XMLCite \textit{W.-K. Chen} et al., J. Glob. Optim. 86, No. 1, 205--249 (2023; Zbl 1518.90051) Full Text: DOI
Del Pia, Alberto; Linderoth, Jeff; Zhu, Haoran Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. (English) Zbl 1515.90073 Math. Program. 197, No. 2 (B), 847-875 (2023). MSC: 90C10 90C11 90C27 PDFBibTeX XMLCite \textit{A. Del Pia} et al., Math. Program. 197, No. 2 (B), 847--875 (2023; Zbl 1515.90073) Full Text: DOI
Del Pia, Alberto; Linderoth, Jeff; Zhu, Haoran New classes of facets for complementarity knapsack problems. (English) Zbl 1528.90212 Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 3-21 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Del Pia} et al., Lect. Notes Comput. Sci. 13526, 3--21 (2022; Zbl 1528.90212) Full Text: DOI arXiv
Letchford, Adam N. The Boolean quadric polytope. (English) Zbl 1506.90195 Punnen, Abraham P. (ed.), The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications. Cham: Springer. 97-120 (2022). MSC: 90C20 90C09 PDFBibTeX XMLCite \textit{A. N. Letchford}, in: The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications. Cham: Springer. 97--120 (2022; Zbl 1506.90195) Full Text: DOI
Pashkovich, Kanstantsin; Poirrier, Laurent; Pulyassary, Haripriya The aggregation closure is polyhedral for packing and covering integer programs. (English) Zbl 1504.90075 Math. Program. 195, No. 1-2 (A), 1135-1147 (2022). MSC: 90C10 PDFBibTeX XMLCite \textit{K. Pashkovich} et al., Math. Program. 195, No. 1--2 (A), 1135--1147 (2022; Zbl 1504.90075) Full Text: DOI arXiv
Rodrigues de Sousa, Vilmar Jefté; Anjos, Miguel F.; Le Digabel, Sébastien Computational study of a branching algorithm for the maximum \(k\)-cut problem. (English) Zbl 1506.90233 Discrete Optim. 44, Part 2, Article ID 100656, 20 p. (2022). MSC: 90C27 90C22 90C57 PDFBibTeX XMLCite \textit{V. J. Rodrigues de Sousa} et al., Discrete Optim. 44, Part 2, Article ID 100656, 20 p. (2022; Zbl 1506.90233) Full Text: DOI
Djeumou Fomeni, Franklin; Kaparis, Konstantinos; Letchford, Adam N. A cut-and-branch algorithm for the quadratic knapsack problem. (English) Zbl 1510.90224 Discrete Optim. 44, Part 2, Article ID 100579, 18 p. (2022). MSC: 90C27 90C10 90C09 90C20 90C57 PDFBibTeX XMLCite \textit{F. Djeumou Fomeni} et al., Discrete Optim. 44, Part 2, Article ID 100579, 18 p. (2022; Zbl 1510.90224) Full Text: DOI Link
Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen On a generalization of the Chvátal-Gomory closure. (English) Zbl 1489.90063 Math. Program. 192, No. 1-2 (B), 149-175 (2022). MSC: 90C10 90C11 90C27 90C57 PDFBibTeX XMLCite \textit{S. Dash} et al., Math. Program. 192, No. 1--2 (B), 149--175 (2022; Zbl 1489.90063) Full Text: DOI
Catanzaro, Daniele; Coniglio, Stefano; Furini, Fabio On the exact separation of cover inequalities of maximum-depth. (English) Zbl 1487.90544 Optim. Lett. 16, No. 2, 449-469 (2022). MSC: 90C27 90C39 90C11 PDFBibTeX XMLCite \textit{D. Catanzaro} et al., Optim. Lett. 16, No. 2, 449--469 (2022; Zbl 1487.90544) Full Text: DOI
Simanchëv, Ruslan Yur’evich; Solov’ëva, Polina Vyacheslavovna; Urazova, Inna Vladimirovna The affine hull of the schedule polytope for servicing identical requests by parallel devices. (Russian. English summary) Zbl 1497.90100 Diskretn. Anal. Issled. Oper. 28, No. 1, 48-67 (2021). MSC: 90B35 52B12 PDFBibTeX XMLCite \textit{R. Y. Simanchëv} et al., Diskretn. Anal. Issled. Oper. 28, No. 1, 48--67 (2021; Zbl 1497.90100) Full Text: DOI MNR
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 PDFBibTeX XMLCite \textit{A. Del Pia} et al., Lect. Notes Comput. Sci. 12707, 193--207 (2021; Zbl 1482.90180) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{S. Dash} et al., Math. Program. 190, No. 1--2 (A), 393--425 (2021; Zbl 1478.90059) Full Text: DOI
Shapoval, Andriy; Lee, Eva K. Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization. (English) Zbl 1527.90132 J. Glob. Optim. 80, No. 4, 805-840 (2021). MSC: 90C10 PDFBibTeX XMLCite \textit{A. Shapoval} and \textit{E. K. Lee}, J. Glob. Optim. 80, No. 4, 805--840 (2021; Zbl 1527.90132) Full Text: DOI
Chen, Wei-Kun; Dai, Yu-Hong On the complexity of sequentially lifting cover inequalities for the knapsack polytope. (English) Zbl 1467.90022 Sci. China, Math. 64, No. 1, 211-220 (2021). MSC: 90C11 90C27 PDFBibTeX XMLCite \textit{W.-K. Chen} and \textit{Y.-H. Dai}, Sci. China, Math. 64, No. 1, 211--220 (2021; Zbl 1467.90022) Full Text: DOI arXiv
Hojny, Christopher Strong IP formulations need large coefficients. (English) Zbl 1474.90293 Discrete Optim. 39, Article ID 100624, 25 p. (2021). MSC: 90C10 90C57 PDFBibTeX XMLCite \textit{C. Hojny}, Discrete Optim. 39, Article ID 100624, 25 p. (2021; Zbl 1474.90293) Full Text: DOI
Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen On a generalization of the Chvátal-Gomory closure. (English) Zbl 1503.90074 Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 117-129 (2020). MSC: 90C10 PDFBibTeX XMLCite \textit{S. Dash} et al., Lect. Notes Comput. Sci. 12125, 117--129 (2020; Zbl 1503.90074) Full Text: DOI arXiv
Letchford, Adam N.; Souli, Georgia Lifting the knapsack cover inequalities for the knapsack polytope. (English) Zbl 1479.90140 Oper. Res. Lett. 48, No. 5, 607-611 (2020). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{G. Souli}, Oper. Res. Lett. 48, No. 5, 607--611 (2020; Zbl 1479.90140) Full Text: DOI Link
Gemander, Patrick; Chen, Wei-Kun; Weninger, Dieter; Gottwald, Leona; Gleixner, Ambros; Martin, Alexander Two-row and two-column mixed-integer presolve using hashing-based pairing methods. (English) Zbl 1452.90215 EURO J. Comput. Optim. 8, No. 3-4, 205-240 (2020). MSC: 90C05 90C10 90C11 65Y05 PDFBibTeX XMLCite \textit{P. Gemander} et al., EURO J. Comput. Optim. 8, No. 3--4, 205--240 (2020; Zbl 1452.90215) Full Text: DOI
Achterberg, Tobias; Bixby, Robert E.; Gu, Zonghao; Rothberg, Edward; Weninger, Dieter Presolve reductions in mixed integer programming. (English) Zbl 07290858 INFORMS J. Comput. 32, No. 2, 473-506 (2020). MSC: 90C11 PDFBibTeX XMLCite \textit{T. Achterberg} et al., INFORMS J. Comput. 32, No. 2, 473--506 (2020; Zbl 07290858) Full Text: DOI
Hojny, Christopher; Gally, Tristan; Habeck, Oliver; Lüthen, Hendrik; Matter, Frederic; Pfetsch, Marc E.; Schmitt, Andreas Knapsack polytopes: a survey. (English) Zbl 1456.90133 Ann. Oper. Res. 292, No. 1, 469-517 (2020). MSC: 90C27 90-02 PDFBibTeX XMLCite \textit{C. Hojny} et al., Ann. Oper. Res. 292, No. 1, 469--517 (2020; Zbl 1456.90133) Full Text: DOI
Letchford, Adam N.; Souli, Georgia On lifted cover inequalities: a new lifting procedure with unusual properties. (English) Zbl 1476.90285 Oper. Res. Lett. 47, No. 2, 83-87 (2019). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{G. Souli}, Oper. Res. Lett. 47, No. 2, 83--87 (2019; Zbl 1476.90285) Full Text: DOI Link
Dey, Santanu S.; Santana, Asteroide; Wang, Yang New SOCP relaxation and branching rule for bipartite bilinear programs. (English) Zbl 1431.90148 Optim. Eng. 20, No. 2, 307-336 (2019). MSC: 90C30 49M37 65K05 PDFBibTeX XMLCite \textit{S. S. Dey} et al., Optim. Eng. 20, No. 2, 307--336 (2019; Zbl 1431.90148) Full Text: DOI arXiv
Conforti, Michele; Wolsey, Laurence A. “Facet” separation with one linear program. (English) Zbl 1431.90126 Math. Program. 178, No. 1-2 (A), 361-380 (2019). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{M. Conforti} and \textit{L. A. Wolsey}, Math. Program. 178, No. 1--2 (A), 361--380 (2019; Zbl 1431.90126) Full Text: DOI Link
Hojny, Christopher; Pfetsch, Marc E. Polytopes associated with symmetry handling. (English) Zbl 1421.90088 Math. Program. 175, No. 1-2 (A), 197-240 (2019). MSC: 90C09 90C11 90C57 PDFBibTeX XMLCite \textit{C. Hojny} and \textit{M. E. Pfetsch}, Math. Program. 175, No. 1--2 (A), 197--240 (2019; Zbl 1421.90088) Full Text: DOI
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 PDFBibTeX XMLCite \textit{S. S. Dey} et al., Math. Oper. Res. 43, No. 1, 304--332 (2018; Zbl 1432.90090) Full Text: DOI arXiv
Dey, Santanu S.; Iroume, Andres; Wang, Guanyi The strength of multi-row aggregation cuts for sign-pattern integer programs. (English) Zbl 1476.90197 Oper. Res. Lett. 46, No. 6, 611-615 (2018). MSC: 90C10 PDFBibTeX XMLCite \textit{S. S. Dey} et al., Oper. Res. Lett. 46, No. 6, 611--615 (2018; Zbl 1476.90197) Full Text: DOI arXiv
Ben Salem, Mariem; Taktak, Raouia; Mahjoub, A. Ridha; Ben-Abdallah, Hanêne Optimization algorithms for the disjunctively constrained knapsack problem. (English) Zbl 1398.90131 Soft Comput. 22, No. 6, 2025-2043 (2018). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Ben Salem} et al., Soft Comput. 22, No. 6, 2025--2043 (2018; Zbl 1398.90131) Full Text: DOI
Dey, Santanu S.; Molinaro, Marco Theoretical challenges towards cutting-plane selection. (English) Zbl 1391.90427 Math. Program. 170, No. 1 (B), 237-266 (2018). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{S. S. Dey} and \textit{M. Molinaro}, Math. Program. 170, No. 1 (B), 237--266 (2018; Zbl 1391.90427) Full Text: DOI arXiv
Kılınç, Mustafa R.; Sahinidis, Nikolaos V. Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON. (English) Zbl 1398.90110 Optim. Methods Softw. 33, No. 3, 540-562 (2018). MSC: 90C11 90C26 90C59 PDFBibTeX XMLCite \textit{M. R. Kılınç} and \textit{N. V. Sahinidis}, Optim. Methods Softw. 33, No. 3, 540--562 (2018; Zbl 1398.90110) Full Text: DOI
Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong Generalized coefficient strengthening cuts for mixed integer programming. (English) Zbl 1394.90434 J. Glob. Optim. 70, No. 1, 289-306 (2018). MSC: 90C11 PDFBibTeX XMLCite \textit{W.-K. Chen} et al., J. Glob. Optim. 70, No. 1, 289--306 (2018; Zbl 1394.90434) Full Text: DOI
Simanchev, R. Yu. On facet-inducing inequalities for combinatorial polytopes. (Russian, English) Zbl 1399.90224 Diskretn. Anal. Issled. Oper. 24, No. 4, 95-110 (2017); translation in J. Appl. Ind. Math. 11, No. 4, 564-571 (2017). MSC: 90C27 52B12 90C35 PDFBibTeX XMLCite \textit{R. Yu. Simanchev}, Diskretn. Anal. Issled. Oper. 24, No. 4, 95--110 (2017; Zbl 1399.90224); translation in J. Appl. Ind. Math. 11, No. 4, 564--571 (2017) Full Text: DOI
Puranik, Yash; Sahinidis, Nikolaos V. Domain reduction techniques for global NLP and MINLP optimization. (English) Zbl 1387.90164 Constraints 22, No. 3, 338-376 (2017). MSC: 90C11 90C26 PDFBibTeX XMLCite \textit{Y. Puranik} and \textit{N. V. Sahinidis}, Constraints 22, No. 3, 338--376 (2017; Zbl 1387.90164) Full Text: DOI arXiv
Morrison, David R.; Jacobson, Sheldon H.; Sauppe, Jason J.; Sewell, Edward C. Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. (English) Zbl 1387.90010 Discrete Optim. 19, 79-102 (2016). MSC: 90-02 90C57 90C10 90C27 PDFBibTeX XMLCite \textit{D. R. Morrison} et al., Discrete Optim. 19, 79--102 (2016; Zbl 1387.90010) Full Text: DOI
Zhang, Qi; Grossmann, Ignacio E.; Sundaramoorthy, Arul; Pinto, Jose M. Data-driven construction of convex region surrogate models. (English) Zbl 1364.90231 Optim. Eng. 17, No. 2, 289-332 (2016). MSC: 90C11 90B90 90C25 62H30 62-07 PDFBibTeX XMLCite \textit{Q. Zhang} et al., Optim. Eng. 17, No. 2, 289--332 (2016; Zbl 1364.90231) Full Text: DOI Link
Agra, Agostinho; Requejo, Cristina; Santos, Eulália Implicit cover inequalities. (English) Zbl 1364.90283 J. Comb. Optim. 31, No. 3, 1111-1129 (2016). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Agra} et al., J. Comb. Optim. 31, No. 3, 1111--1129 (2016; Zbl 1364.90283) Full Text: DOI
Gokce, Elif Ilke; Wilhelm, Wilbert E. Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem. (English) Zbl 1387.90217 Discrete Optim. 17, 25-54 (2015). MSC: 90C27 52B12 90C57 90C09 90C11 PDFBibTeX XMLCite \textit{E. I. Gokce} and \textit{W. E. Wilhelm}, Discrete Optim. 17, 25--54 (2015; Zbl 1387.90217) Full Text: DOI
Alfandari, Laurent; Plateau, Agnès; Schepler, Xavier A branch-and-price-and-cut approach for sustainable crop rotation planning. (English) Zbl 1339.90349 Eur. J. Oper. Res. 241, No. 3, 872-879 (2015). MSC: 90C90 90B30 90C10 90C57 PDFBibTeX XMLCite \textit{L. Alfandari} et al., Eur. J. Oper. Res. 241, No. 3, 872--879 (2015; Zbl 1339.90349) Full Text: DOI Link
Gamrath, Gerald; Koch, Thorsten; Martin, Alexander; Miltenberger, Matthias; Weninger, Dieter Progress in presolving for mixed integer programming. (English) Zbl 1329.90089 Math. Program. Comput. 7, No. 4, 367-398 (2015). MSC: 90C11 90C10 90-04 90-08 90C90 PDFBibTeX XMLCite \textit{G. Gamrath} et al., Math. Program. Comput. 7, No. 4, 367--398 (2015; Zbl 1329.90089) Full Text: DOI
Chaleshtarti, Ali Shirzadeh; Shadrokh, Shahram A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement. (English) Zbl 1401.90088 Arab. J. Sci. Eng. 39, No. 11, 8359-8369 (2014). MSC: 90B50 90B35 90C57 PDFBibTeX XMLCite \textit{A. S. Chaleshtarti} and \textit{S. Shadrokh}, Arab. J. Sci. Eng. 39, No. 11, 8359--8369 (2014; Zbl 1401.90088) Full Text: DOI
Detienne, Boris A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints. (English) Zbl 1305.90179 Eur. J. Oper. Res. 235, No. 3, 540-552 (2014). MSC: 90B35 90C11 PDFBibTeX XMLCite \textit{B. Detienne}, Eur. J. Oper. Res. 235, No. 3, 540--552 (2014; Zbl 1305.90179) Full Text: DOI
Qiu, Feng; Ahmed, Shabbir; Dey, Santanu S.; Wolsey, Laurence A. Covering linear programming with violations. (English) Zbl 1304.90139 INFORMS J. Comput. 26, No. 3, 531-546 (2014). MSC: 90C05 90C10 90C11 PDFBibTeX XMLCite \textit{F. Qiu} et al., INFORMS J. Comput. 26, No. 3, 531--546 (2014; Zbl 1304.90139) Full Text: DOI
de Farias, I. R. jun.; Kozyreff, E.; Zhao, M. Branch-and-cut for complementarity-constrained optimization. (English) Zbl 1305.90308 Math. Program. Comput. 6, No. 4, 365-403 (2014). MSC: 90C10 90C11 90C27 90C33 90C57 PDFBibTeX XMLCite \textit{I. R. de Farias jun.} et al., Math. Program. Comput. 6, No. 4, 365--403 (2014; Zbl 1305.90308) Full Text: DOI
Zhao, Ming; de Farias, Ismael Regis jun. The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints. (English) Zbl 1274.90331 Math. Program. 141, No. 1-2 (A), 217-255 (2013). MSC: 90C27 90C57 90C05 90C11 PDFBibTeX XMLCite \textit{M. Zhao} and \textit{I. R. de Farias jun.}, Math. Program. 141, No. 1--2 (A), 217--255 (2013; Zbl 1274.90331) Full Text: DOI
Beheshti, Zahra; Shamsuddin, Siti Mariyam; Yuhaniz, Siti Sophiayati Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems. (English) Zbl 1315.90033 J. Glob. Optim. 57, No. 2, 549-573 (2013). MSC: 90C27 PDFBibTeX XMLCite \textit{Z. Beheshti} et al., J. Glob. Optim. 57, No. 2, 549--573 (2013; Zbl 1315.90033) Full Text: DOI
Chvátal, Vašek; Cook, William; Espinoza, Daniel Local cuts for mixed-integer programming. (English) Zbl 1275.90043 Math. Program. Comput. 5, No. 2, 171-200 (2013). MSC: 90C11 90C57 65K05 PDFBibTeX XMLCite \textit{V. Chvátal} et al., Math. Program. Comput. 5, No. 2, 171--200 (2013; Zbl 1275.90043) Full Text: DOI Link
De Farias, I. R. jun.; Kozyreff, E.; Gupta, R.; Zhao, M. Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints. (English) Zbl 1267.90076 Math. Program. Comput. 5, No. 1, 75-112 (2013). MSC: 90C11 90C57 90C27 PDFBibTeX XMLCite \textit{I. R. De Farias jun.} et al., Math. Program. Comput. 5, No. 1, 75--112 (2013; Zbl 1267.90076) Full Text: DOI
Li, Xiangyong; Aneja, Y. P. A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks. (English) Zbl 1460.90058 INFORMS J. Comput. 24, No. 3, 443-456 (2012). MSC: 90B18 90C57 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. P. Aneja}, INFORMS J. Comput. 24, No. 3, 443--456 (2012; Zbl 1460.90058) Full Text: DOI
Yang, Zhen; Chu, Feng; Chen, Haoxun A cut-and-solve based algorithm for the single-source capacitated facility location problem. (English) Zbl 1253.90143 Eur. J. Oper. Res. 221, No. 3, 521-532 (2012). MSC: 90B80 90C10 90C57 PDFBibTeX XMLCite \textit{Z. Yang} et al., Eur. J. Oper. Res. 221, No. 3, 521--532 (2012; Zbl 1253.90143) Full Text: DOI
Codas, Andrés; Camponogara, Eduardo Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing. (English) Zbl 1244.90263 Eur. J. Oper. Res. 217, No. 1, 222-231 (2012). MSC: 90C90 90C11 PDFBibTeX XMLCite \textit{A. Codas} and \textit{E. Camponogara}, Eur. J. Oper. Res. 217, No. 1, 222--231 (2012; Zbl 1244.90263) Full Text: DOI
Klopfenstein, Olivier; Nace, Dritan Cover inequalities for robust knapsack sets – application to the robust bandwidth packing problem. (English) Zbl 1241.90113 Networks 59, No. 1, 59-72 (2012). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{O. Klopfenstein} and \textit{D. Nace}, Networks 59, No. 1, 59--72 (2012; Zbl 1241.90113) Full Text: DOI
Büsing, Christina; Koster, Arie M. C. A.; Kutschka, Manuel Recoverable robust knapsacks: the discrete scenario case. (English) Zbl 1262.90142 Optim. Lett. 5, No. 3, 379-392 (2011). MSC: 90C27 PDFBibTeX XMLCite \textit{C. Büsing} et al., Optim. Lett. 5, No. 3, 379--392 (2011; Zbl 1262.90142) Full Text: DOI
Goldengorin, B.; Krushinsky, D. Complexity evaluation of benchmark instances for the \(p\)-median problem. (English) Zbl 1219.05186 Math. Comput. Modelling 53, No. 9-10, 1719-1736 (2011). MSC: 05C85 90B80 PDFBibTeX XMLCite \textit{B. Goldengorin} and \textit{D. Krushinsky}, Math. Comput. Modelling 53, No. 9--10, 1719--1736 (2011; Zbl 1219.05186) Full Text: DOI
Fukasawa, Ricardo; Goycoolea, Marcos On the exact separation of mixed integer knapsack cuts. (English) Zbl 1218.90126 Math. Program. 128, No. 1-2 (A), 19-41 (2011). MSC: 90C10 90C11 90C57 PDFBibTeX XMLCite \textit{R. Fukasawa} and \textit{M. Goycoolea}, Math. Program. 128, No. 1--2 (A), 19--41 (2011; Zbl 1218.90126) Full Text: DOI
Albareda-Sambola, Maria; Fernández, Elena; Laporte, Gilbert A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. (English) Zbl 1208.90097 Comput. Oper. Res. 38, No. 8, 1109-1116 (2011). MSC: 90B80 PDFBibTeX XMLCite \textit{M. Albareda-Sambola} et al., Comput. Oper. Res. 38, No. 8, 1109--1116 (2011; Zbl 1208.90097) Full Text: DOI
Basu, Amitabh; Bonami, Pierre; Cornuéjols, Gérard; Margot, François On the relative strength of split, triangle and quadrilateral cuts. (English) Zbl 1206.90103 Math. Program. 126, No. 2 (A), 281-314 (2011). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{A. Basu} et al., Math. Program. 126, No. 2 (A), 281--314 (2011; Zbl 1206.90103) Full Text: DOI arXiv
Espinoza, Daniel; Fukasawa, Ricardo; Goycoolea, Marcos Lifting, tilting and fractional programming revisited. (English) Zbl 1202.90199 Oper. Res. Lett. 38, No. 6, 559-563 (2010). MSC: 90C11 90C32 PDFBibTeX XMLCite \textit{D. Espinoza} et al., Oper. Res. Lett. 38, No. 6, 559--563 (2010; Zbl 1202.90199) Full Text: DOI Link
Kaparis, Konstantinos; Letchford, Adam N. Separation algorithms for 0-1 knapsack polytopes. (English) Zbl 1198.90297 Math. Program. 124, No. 1-2 (B), 69-91 (2010). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} and \textit{A. N. Letchford}, Math. Program. 124, No. 1--2 (B), 69--91 (2010; Zbl 1198.90297) Full Text: DOI Link
Konno, Hiroshi; Takaya, Yoshihiro Multi-step methods for choosing the best set of variables in regression analysis. (English) Zbl 1200.62076 Comput. Optim. Appl. 46, No. 3, 417-426 (2010). MSC: 62J05 65C60 90C09 90C10 PDFBibTeX XMLCite \textit{H. Konno} and \textit{Y. Takaya}, Comput. Optim. Appl. 46, No. 3, 417--426 (2010; Zbl 1200.62076) Full Text: DOI
Oguz, Osman Cutting plane algorithms for \(0-1\) programming based on cardinality cuts. (English) Zbl 1188.90173 Eur. J. Oper. Res. 205, No. 2, 273-279 (2010). MSC: 90C09 PDFBibTeX XMLCite \textit{O. Oguz}, Eur. J. Oper. Res. 205, No. 2, 273--279 (2010; Zbl 1188.90173) Full Text: DOI
Gottlieb, Elsie Sterbin Generalized cover facet inequalities for the generalized assignment problem. (English) Zbl 1184.90087 Optimization 59, No. 1-2, 223-233 (2010). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{E. S. Gottlieb}, Optimization 59, No. 1--2, 223--233 (2010; Zbl 1184.90087) Full Text: DOI
Andersen, Kent; Pochet, Yves Coefficient strengthening: a tool for reformulating mixed-integer programs. (English) Zbl 1184.90111 Math. Program. 122, No. 1 (A), 121-154 (2010). MSC: 90C11 PDFBibTeX XMLCite \textit{K. Andersen} and \textit{Y. Pochet}, Math. Program. 122, No. 1 (A), 121--154 (2010; Zbl 1184.90111) Full Text: DOI
Richard, Jean-Philippe P.; Tawarmalani, Mohit Lifting inequalities: a framework for generating strong cuts for nonlinear programs. (English) Zbl 1184.90130 Math. Program. 121, No. 1 (A), 61-104 (2010). MSC: 90C26 90C30 90C11 PDFBibTeX XMLCite \textit{J.-P. P. Richard} and \textit{M. Tawarmalani}, Math. Program. 121, No. 1 (A), 61--104 (2010; Zbl 1184.90130) Full Text: DOI
Achterberg, Tobias SCIP: solving constraint integer programs. (English) Zbl 1171.90476 Math. Program. Comput. 1, No. 1, 1-41 (2009). MSC: 90C11 68T20 90C27 90-04 90-08 PDFBibTeX XMLCite \textit{T. Achterberg}, Math. Program. Comput. 1, No. 1, 1--41 (2009; Zbl 1171.90476) Full Text: DOI
Catalán, Jaime; Epstein, Rafael; Guajardo, Mario; Yung, Daniel; Martınez, Cristian Solving multiple scenarios in a combinatorial auction. (English) Zbl 1160.91339 Comput. Oper. Res. 36, No. 10, 2752-2758 (2009). MSC: 91B26 90C27 90C10 PDFBibTeX XMLCite \textit{J. Catalán} et al., Comput. Oper. Res. 36, No. 10, 2752--2758 (2009; Zbl 1160.91339) Full Text: DOI Link
Håkansson, Anne An event-driven algorithm for agents on the web. (English) Zbl 1171.68309 Jain, Lakhmi C. (ed.) et al., Knowledge processing and decision making in agent-based systems. Berlin: Springer (ISBN 978-3-540-88048-6/hbk; 978-3-540-88049-3/ebook). Studies in Computational Intelligence 170, 147-174 (2009). MSC: 68M10 68P10 68W05 68R10 PDFBibTeX XMLCite \textit{A. Håkansson}, Stud. Comput. Intell. 170, 147--174 (2009; Zbl 1171.68309) Full Text: DOI
Caprara, Alberto; Monaci, Michele Bidimensional packing by bilinear programming. (English) Zbl 1169.90428 Math. Program. 118, No. 1 (A), 75-108 (2009). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Caprara} and \textit{M. Monaci}, Math. Program. 118, No. 1 (A), 75--108 (2009; Zbl 1169.90428) Full Text: DOI
Sherali, Hanif D.; Glover, Fred Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities. (English) Zbl 1151.90496 Discrete Optim. 5, No. 2, 270-289 (2008). MSC: 90C09 90C27 PDFBibTeX XMLCite \textit{H. D. Sherali} and \textit{F. Glover}, Discrete Optim. 5, No. 2, 270--289 (2008; Zbl 1151.90496) Full Text: DOI
Lin, Tin-Chi; Vandenbussche, Dieter Box-constrained quadratic programs with fixed charge variables. (English) Zbl 1176.90426 J. Glob. Optim. 41, No. 1, 75-102 (2008). Reviewer: Joachim Piehler (Merseburg) MSC: 90C11 90C20 90C57 PDFBibTeX XMLCite \textit{T.-C. Lin} and \textit{D. Vandenbussche}, J. Glob. Optim. 41, No. 1, 75--102 (2008; Zbl 1176.90426) Full Text: DOI
Glover, Fred; Sherali, Hanif D. Second-order cover inequalities. (English) Zbl 1145.90042 Math. Program. 114, No. 2 (A), 207-234 (2008). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{F. Glover} and \textit{H. D. Sherali}, Math. Program. 114, No. 2 (A), 207--234 (2008; Zbl 1145.90042) Full Text: DOI
Kaparis, Konstantinos; Letchford, Adam N. Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. (English) Zbl 1138.90016 Eur. J. Oper. Res. 186, No. 1, 91-103 (2008). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{K. Kaparis} and \textit{A. N. Letchford}, Eur. J. Oper. Res. 186, No. 1, 91--103 (2008; Zbl 1138.90016) Full Text: DOI
Balev, Stefan; Yanev, Nicola; Fréville, Arnaud; Andonov, Rumen A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem. (English) Zbl 1138.90015 Eur. J. Oper. Res. 186, No. 1, 63-76 (2008). MSC: 90C10 90C39 90C59 PDFBibTeX XMLCite \textit{S. Balev} et al., Eur. J. Oper. Res. 186, No. 1, 63--76 (2008; Zbl 1138.90015) Full Text: DOI
Spielberg, Kurt IP over 40+ years at IBM scientific centers and marketing. (English) Zbl 1213.90030 Ann. Oper. Res. 149, 195-208 (2007). MSC: 90-03 01A60 90C10 PDFBibTeX XMLCite \textit{K. Spielberg}, Ann. Oper. Res. 149, 195--208 (2007; Zbl 1213.90030) Full Text: DOI
Schrage, Linus; Cunningham, Kevin Broadening the integer programming audience, the LINDO perspective. (English) Zbl 1213.90028 Ann. Oper. Res. 149, 177-183 (2007). MSC: 90-03 01A60 90C10 PDFBibTeX XMLCite \textit{L. Schrage} and \textit{K. Cunningham}, Ann. Oper. Res. 149, 177--183 (2007; Zbl 1213.90028) Full Text: DOI
Nemhauser, George L. Hooked on IP. (English) Zbl 1213.90025 Ann. Oper. Res. 149, 157-161 (2007). MSC: 90-03 01A60 90C10 PDFBibTeX XMLCite \textit{G. L. Nemhauser}, Ann. Oper. Res. 149, 157--161 (2007; Zbl 1213.90025) Full Text: DOI
Johnson, Ellis My experiences as a student and researcher in OR during the 1960’s and 70’s. (English) Zbl 1213.90022 Ann. Oper. Res. 149, 121-135 (2007). MSC: 90-03 01A60 PDFBibTeX XMLCite \textit{E. Johnson}, Ann. Oper. Res. 149, 121--135 (2007; Zbl 1213.90022) Full Text: DOI
Dietrich, Brenda Some of my favorite integer programming applications at IBM. (English) Zbl 1213.90017 Ann. Oper. Res. 149, 75-80 (2007). MSC: 90-03 01A60 90C10 PDFBibTeX XMLCite \textit{B. Dietrich}, Ann. Oper. Res. 149, 75--80 (2007; Zbl 1213.90017) Full Text: DOI
Bixby, Robert; Rothberg, Edward Progress in computational mixed integer programming – a look back from the other side of the tipping point. (English) Zbl 1213.90011 Ann. Oper. Res. 149, 37-41 (2007). MSC: 90-03 01A60 90C11 PDFBibTeX XMLCite \textit{R. Bixby} and \textit{E. Rothberg}, Ann. Oper. Res. 149, 37--41 (2007; Zbl 1213.90011) Full Text: DOI
Louveaux, Quentin; Wolsey, Laurence A. Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. (English) Zbl 1157.90488 Ann. Oper. Res. 153, 47-77 (2007). MSC: 90C11 90C35 PDFBibTeX XMLCite \textit{Q. Louveaux} and \textit{L. A. Wolsey}, Ann. Oper. Res. 153, 47--77 (2007; Zbl 1157.90488) Full Text: DOI
Hanafi, Saïd; Glover, Fred Exploiting nested inequalities and surrogate constraints. (English) Zbl 1275.90040 Eur. J. Oper. Res. 179, No. 1, 50-63 (2007). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{S. Hanafi} and \textit{F. Glover}, Eur. J. Oper. Res. 179, No. 1, 50--63 (2007; Zbl 1275.90040) Full Text: DOI
Bektas, Tolga; Oğuz, Osman On separating cover inequalities for the multidimensional knapsack problem. (English) Zbl 1159.90460 Comput. Oper. Res. 34, No. 6, 1771-1776 (2007). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{T. Bektas} and \textit{O. Oğuz}, Comput. Oper. Res. 34, No. 6, 1771--1776 (2007; Zbl 1159.90460) Full Text: DOI Link
Gopalakrishnan, Balaji; Johnson, Ellis L. Airline crew scheduling: state-of-the-art. (English) Zbl 1091.90019 Ann. Oper. Res. 140, 305-337 (2005). MSC: 90B35 90B90 90-02 PDFBibTeX XMLCite \textit{B. Gopalakrishnan} and \textit{E. L. Johnson}, Ann. Oper. Res. 140, 305--337 (2005; Zbl 1091.90019) Full Text: DOI
Guignard, Monique; Johnson, Ellis L.; Spielberg, Kurt Logical processing for integer programming. (English) Zbl 1091.90050 Ann. Oper. Res. 140, 263-304 (2005). MSC: 90C10 90-04 PDFBibTeX XMLCite \textit{M. Guignard} et al., Ann. Oper. Res. 140, 263--304 (2005; Zbl 1091.90050) Full Text: DOI
Atamtürk, Alper; Savelsbergh, Martin W. P. Integer-programming software systems. (English) Zbl 1091.90046 Ann. Oper. Res. 140, 67-124 (2005). MSC: 90C10 90-04 PDFBibTeX XMLCite \textit{A. Atamtürk} and \textit{M. W. P. Savelsbergh}, Ann. Oper. Res. 140, 67--124 (2005; Zbl 1091.90046) Full Text: DOI
Padberg, Manfred Classical cuts for mixed-integer programming and branch-and-cut. (English) Zbl 1135.90369 Ann. Oper. Res. 139, 321-352 (2005). MSC: 90C11 90C57 90C08 PDFBibTeX XMLCite \textit{M. Padberg}, Ann. Oper. Res. 139, 321--352 (2005; Zbl 1135.90369) Full Text: DOI
Lougee-Heimer, R.; Adams, W. A conditional logic approach for strengthening mixed 0-1 linear programs. (English) Zbl 1091.90057 Ann. Oper. Res. 139, 289-320 (2005). MSC: 90C11 90C09 PDFBibTeX XMLCite \textit{R. Lougee-Heimer} and \textit{W. Adams}, Ann. Oper. Res. 139, 289--320 (2005; Zbl 1091.90057) Full Text: DOI
Lee, Sangbum; Grossmann, Ignacio E. Logic-based modeling and solution of nonlinear discrete/continuous optimization problems. (English) Zbl 1091.90056 Ann. Oper. Res. 139, 267-288 (2005). MSC: 90C11 90C26 90-02 PDFBibTeX XMLCite \textit{S. Lee} and \textit{I. E. Grossmann}, Ann. Oper. Res. 139, 267--288 (2005; Zbl 1091.90056) Full Text: DOI
Fréville, Arnaud; Hanafi, Saïd The multidimensional 0-1 knapsack problem – bounds and computational aspects. (English) Zbl 1091.90042 Ann. Oper. Res. 139, 195-227 (2005). MSC: 90C09 90C59 PDFBibTeX XMLCite \textit{A. Fréville} and \textit{S. Hanafi}, Ann. Oper. Res. 139, 195--227 (2005; Zbl 1091.90042) Full Text: DOI
Atamtürk, Alper Cover and pack inequalities for (mixed) integer programming. (English) Zbl 1091.90053 Ann. Oper. Res. 139, 21-38 (2005). MSC: 90C11 90C27 PDFBibTeX XMLCite \textit{A. Atamtürk}, Ann. Oper. Res. 139, 21--38 (2005; Zbl 1091.90053) Full Text: DOI
López, F. J. Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull. (English) Zbl 1084.65008 J. Math. Model. Algorithms 4, No. 2, 219-234 (2005). MSC: 65C10 52B11 52B55 65D18 PDFBibTeX XMLCite \textit{F. J. López}, J. Math. Model. Algorithms 4, No. 2, 219--234 (2005; Zbl 1084.65008) Full Text: DOI
Vandenbussche, Dieter; Nemhauser, George L. A polyhedral study of nonconvex quadratic programs with box constraints. (English) Zbl 1137.90009 Math. Program. 102, No. 3 (A), 531-557 (2005). MSC: 90C20 90C57 PDFBibTeX XMLCite \textit{D. Vandenbussche} and \textit{G. L. Nemhauser}, Math. Program. 102, No. 3 (A), 531--557 (2005; Zbl 1137.90009) Full Text: DOI
Sherali, Hanif D.; Lee, Youngho; Kim, Youngjin Partial convexification cuts for 0–1 mixed-integer programs. (English) Zbl 1062.90040 Eur. J. Oper. Res. 165, No. 3, 625-648 (2005). MSC: 90C11 90C57 90C09 PDFBibTeX XMLCite \textit{H. D. Sherali} et al., Eur. J. Oper. Res. 165, No. 3, 625--648 (2005; Zbl 1062.90040) Full Text: DOI
Boland, Natashia; Krishnamoorthy, Mohan; Ernst, Andreas T.; Ebery, Jamie Preprocessing and cutting for multiple allocation hub location problems. (English) Zbl 1049.90034 Eur. J. Oper. Res. 155, No. 3, 638-653 (2004). MSC: 90B80 90C10 PDFBibTeX XMLCite \textit{N. Boland} et al., Eur. J. Oper. Res. 155, No. 3, 638--653 (2004; Zbl 1049.90034) Full Text: DOI
Glover, Fred; Sherali, Hanif D. Foundation-penalty cuts for mixed-integer programs. (English) Zbl 1041.90032 Oper. Res. Lett. 31, No. 4, 245-253 (2003). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{F. Glover} and \textit{H. D. Sherali}, Oper. Res. Lett. 31, No. 4, 245--253 (2003; Zbl 1041.90032) Full Text: DOI
Escudero, L. F.; Muñoz, S. On identifying dominant cliques. (English) Zbl 1035.90095 Eur. J. Oper. Res. 149, No. 1, 65-76 (2003). MSC: 90C35 90C10 90C09 PDFBibTeX XMLCite \textit{L. F. Escudero} and \textit{S. Muñoz}, Eur. J. Oper. Res. 149, No. 1, 65--76 (2003; Zbl 1035.90095) Full Text: DOI
Beraldi, Patrizia; Ruszczyński, Andrzej A branch and bound method for stochastic integer problems under probabilistic constraints. (English) Zbl 1064.90030 Optim. Methods Softw. 17, No. 3, 359-382 (2002). MSC: 90C15 90C57 90C05 PDFBibTeX XMLCite \textit{P. Beraldi} and \textit{A. Ruszczyński}, Optim. Methods Softw. 17, No. 3, 359--382 (2002; Zbl 1064.90030) Full Text: DOI
Gabrel, V.; Minoux, M. A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. (English) Zbl 1049.90074 Oper. Res. Lett. 30, No. 4, 252-264 (2002). MSC: 90C27 PDFBibTeX XMLCite \textit{V. Gabrel} and \textit{M. Minoux}, Oper. Res. Lett. 30, No. 4, 252--264 (2002; Zbl 1049.90074) Full Text: DOI
Marchand, Hugues; Martin, Alexander; Weismantel, Robert; Wolsey, Laurence Cutting planes in integer and mixed integer programming. (English) Zbl 1130.90370 Discrete Appl. Math. 123, No. 1-3, 397-446 (2002). MSC: 90C11 90C57 90C10 PDFBibTeX XMLCite \textit{H. Marchand} et al., Discrete Appl. Math. 123, No. 1--3, 397--446 (2002; Zbl 1130.90370) Full Text: DOI