Muren; Hao, Lining; An, Qingxian Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis. (English) Zbl 07765561 Comput. Oper. Res. 161, Article ID 106457, 20 p. (2024). MSC: 90Bxx PDFBibTeX XMLCite \textit{Muren} et al., Comput. Oper. Res. 161, Article ID 106457, 20 p. (2024; Zbl 07765561) Full Text: DOI
Dell’Amico, Mauro; Jamal, Jafar; Montemanni, Roberto A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem. (English) Zbl 07706751 Comput. Oper. Res. 156, Article ID 106248, 9 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Dell'Amico} et al., Comput. Oper. Res. 156, Article ID 106248, 9 p. (2023; Zbl 07706751) Full Text: DOI
Chen, Rui; Qian, Xinwu; Miao, Lixin; Ukkusuri, Satish V. Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium. (English) Zbl 1458.90419 Comput. Oper. Res. 113, Article ID 104776, 18 p. (2020). MSC: 90B80 90C30 PDFBibTeX XMLCite \textit{R. Chen} et al., Comput. Oper. Res. 113, Article ID 104776, 18 p. (2020; Zbl 1458.90419) Full Text: DOI
Galligari, Alessandro; Sciandrone, Marco A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand. (English) Zbl 1458.90199 Comput. Oper. Res. 103, 158-166 (2019). MSC: 90B20 90B06 90C35 PDFBibTeX XMLCite \textit{A. Galligari} and \textit{M. Sciandrone}, Comput. Oper. Res. 103, 158--166 (2019; Zbl 1458.90199) Full Text: DOI
Morais, Vinicius; Gendron, Bernard; Mateus, Geraldo Robson The \(p\)-arborescence star problem: formulations and exact solution approaches. (English) Zbl 1458.90616 Comput. Oper. Res. 102, 91-101 (2019). MSC: 90C35 90B80 PDFBibTeX XMLCite \textit{V. Morais} et al., Comput. Oper. Res. 102, 91--101 (2019; Zbl 1458.90616) Full Text: DOI
Pereira, Dilson Lucas; Gendreau, Michel; da Cunha, Alexandre Salles Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. (English) Zbl 1349.90823 Comput. Oper. Res. 63, 149-160 (2015). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{D. L. Pereira} et al., Comput. Oper. Res. 63, 149--160 (2015; Zbl 1349.90823) Full Text: DOI
Ryu, Seungkyu; Chen, Anthony; Choi, Keechoo A modified gradient projection algorithm for solving the elastic demand traffic assignment problem. (English) Zbl 1348.90121 Comput. Oper. Res. 47, 61-71 (2014). MSC: 90B06 90C25 PDFBibTeX XMLCite \textit{S. Ryu} et al., Comput. Oper. Res. 47, 61--71 (2014; Zbl 1348.90121) Full Text: DOI
Sørensen, Matias; Dahms, Florian H. W. A two-stage decomposition of high school timetabling applied to cases in Denmark. (English) Zbl 1348.90313 Comput. Oper. Res. 43, 36-49 (2014). MSC: 90B35 90C10 90C35 PDFBibTeX XMLCite \textit{M. Sørensen} and \textit{F. H. W. Dahms}, Comput. Oper. Res. 43, 36--49 (2014; Zbl 1348.90313) Full Text: DOI Link
Jin, Wen; Chen, Shuiping; Jiang, Hai Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs. (English) Zbl 1348.90156 Comput. Oper. Res. 40, No. 12, 2975-2982 (2013). MSC: 90B10 68R10 90C60 PDFBibTeX XMLCite \textit{W. Jin} et al., Comput. Oper. Res. 40, No. 12, 2975--2982 (2013; Zbl 1348.90156) Full Text: DOI
Briskorn, Dirk; Horbach, Andrei A Lagrangian approach for minimum cost single round robin tournaments. (English) Zbl 1251.90275 Comput. Oper. Res. 39, No. 3, 718-727 (2012). MSC: 90C10 90B35 05C20 05C85 PDFBibTeX XMLCite \textit{D. Briskorn} and \textit{A. Horbach}, Comput. Oper. Res. 39, No. 3, 718--727 (2012; Zbl 1251.90275) Full Text: DOI
Tanaka, Yuma; Imahori, Shinji; Sasaki, Mihiro; Yagiura, Mutsunori An LP-based heuristic algorithm for the node capacitated in-tree packing problem. (English) Zbl 1251.90377 Comput. Oper. Res. 39, No. 3, 637-646 (2012). MSC: 90C35 05C85 90C59 PDFBibTeX XMLCite \textit{Y. Tanaka} et al., Comput. Oper. Res. 39, No. 3, 637--646 (2012; Zbl 1251.90377) Full Text: DOI
Kalcsics, Jörg The multi-facility median problem with Pos/Neg weights on general graphs. (English) Zbl 1201.90117 Comput. Oper. Res. 38, No. 3, 674-682 (2011). MSC: 90B80 90B10 PDFBibTeX XMLCite \textit{J. Kalcsics}, Comput. Oper. Res. 38, No. 3, 674--682 (2011; Zbl 1201.90117) Full Text: DOI
Durmaz, Engin; Aras, Necati; Altınel, İ. Kuban Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations. (English) Zbl 1158.90374 Comput. Oper. Res. 36, No. 7, 2139-2148 (2009). MSC: 90B85 90C59 PDFBibTeX XMLCite \textit{E. Durmaz} et al., Comput. Oper. Res. 36, No. 7, 2139--2148 (2009; Zbl 1158.90374) Full Text: DOI
Oulamara, Ammar Makespan minimization in a no-wait flow shop problem with two batching machines. (English) Zbl 1102.90051 Comput. Oper. Res. 34, No. 4, 1033-1050 (2007). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{A. Oulamara}, Comput. Oper. Res. 34, No. 4, 1033--1050 (2007; Zbl 1102.90051) Full Text: DOI
Ghiani, Gianpaolo; Laganà, Demetrio; Musmanno, Roberto A constructive heuristic for the undirected rural postman problem. (English) Zbl 1094.90040 Comput. Oper. Res. 33, No. 12, 3450-3457 (2006). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{G. Ghiani} et al., Comput. Oper. Res. 33, No. 12, 3450--3457 (2006; Zbl 1094.90040) Full Text: DOI
Bhadury, J.; Eiselt, H. A.; Jaramillo, J. H. An alternating heuristic for medianoid and centroid problems in the plane. (English) Zbl 1026.90053 Comput. Oper. Res. 30, No. 4, 553-565 (2003). MSC: 90B80 90C59 PDFBibTeX XMLCite \textit{J. Bhadury} et al., Comput. Oper. Res. 30, No. 4, 553--565 (2003; Zbl 1026.90053) Full Text: DOI
Gouveia, Luis Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints. (English) Zbl 0854.90139 Comput. Oper. Res. 22, No. 9, 959-970 (1995). MSC: 90C35 PDFBibTeX XMLCite \textit{L. Gouveia}, Comput. Oper. Res. 22, No. 9, 959--970 (1995; Zbl 0854.90139) Full Text: DOI
Austin, Larry M.; Ghandforoush, Parviz A surrogate cutting plane algorithm for all-integer programming. (English) Zbl 0608.90073 Comput. Oper. Res. 12, 241-250 (1985). MSC: 90C10 65K05 PDFBibTeX XMLCite \textit{L. M. Austin} and \textit{P. Ghandforoush}, Comput. Oper. Res. 12, 241--250 (1985; Zbl 0608.90073) Full Text: DOI