Gaar, Elisabeth; Puges, Diane; Wiegele, Angelika Strong SDP based bounds on the cutwidth of a graph. (English) Zbl 07765557 Comput. Oper. Res. 161, Article ID 106449, 11 p. (2024). MSC: 90Bxx PDFBibTeX XMLCite \textit{E. Gaar} et al., Comput. Oper. Res. 161, Article ID 106449, 11 p. (2024; Zbl 07765557) Full Text: DOI arXiv
Willemsen, Rick S. H.; van den Heuvel, Wilco; van de Velden, Michel A new mixed integer programming approach for inverse correspondence analysis. (English) Zbl 07764420 Comput. Oper. Res. 160, Article ID 106375, 16 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{R. S. H. Willemsen} et al., Comput. Oper. Res. 160, Article ID 106375, 16 p. (2023; Zbl 07764420) Full Text: DOI
Zhao, Yaqiong; Li, Dewei; Yin, Yonghao Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand. (English) Zbl 1520.90138 Comput. Oper. Res. 150, Article ID 106049, 19 p. (2023). MSC: 90B35 90C11 90C29 90C30 90C70 PDFBibTeX XMLCite \textit{Y. Zhao} et al., Comput. Oper. Res. 150, Article ID 106049, 19 p. (2023; Zbl 1520.90138) Full Text: DOI
Strusevich, Vitaly A. Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches. (English) Zbl 1520.90126 Comput. Oper. Res. 144, Article ID 105732, 33 p. (2022). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{V. A. Strusevich}, Comput. Oper. Res. 144, Article ID 105732, 33 p. (2022; Zbl 1520.90126) Full Text: DOI
Fomin, Artem; Goldengorin, Boris An exact algorithm for the preemptive single machine scheduling of equal-length jobs. (English) Zbl 1511.90174 Comput. Oper. Res. 142, Article ID 105742, 11 p. (2022). MSC: 90B35 90C57 90C59 PDFBibTeX XMLCite \textit{A. Fomin} and \textit{B. Goldengorin}, Comput. Oper. Res. 142, Article ID 105742, 11 p. (2022; Zbl 1511.90174) Full Text: DOI
Saghand, Payman Ghasemi; Charkhgard, Hadi Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization. (English) Zbl 1511.90382 Comput. Oper. Res. 137, Article ID 105549, 17 p. (2022). MSC: 90C29 90C05 90C10 90C11 91A12 PDFBibTeX XMLCite \textit{P. G. Saghand} and \textit{H. Charkhgard}, Comput. Oper. Res. 137, Article ID 105549, 17 p. (2022; Zbl 1511.90382) Full Text: DOI
Brito, Samuel Souza; Santos, Haroldo Gambini Preprocessing and cutting planes with conflict graphs. (English) Zbl 1510.90189 Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{S. S. Brito} and \textit{H. G. Santos}, Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021; Zbl 1510.90189) Full Text: DOI arXiv
Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano The stable set problem: clique and nodal inequalities revisited. (English) Zbl 1458.90550 Comput. Oper. Res. 123, Article ID 105024, 16 p. (2020). MSC: 90C27 90C10 90C35 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} et al., Comput. Oper. Res. 123, Article ID 105024, 16 p. (2020; Zbl 1458.90550) Full Text: DOI Link
San Segundo, Pablo; Furini, Fabio; Artieda, Jorge A new branch-and-bound algorithm for the maximum weighted clique problem. (English) Zbl 1458.90624 Comput. Oper. Res. 110, 18-33 (2019). MSC: 90C35 05C85 90C57 PDFBibTeX XMLCite \textit{P. San Segundo} et al., Comput. Oper. Res. 110, 18--33 (2019; Zbl 1458.90624) Full Text: DOI
Pinto, Leizer L.; Fernandes, Kátia C. C.; Cardoso, Kleber V.; Maculan, Nelson An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing. (English) Zbl 1458.90581 Comput. Oper. Res. 106, 28-35 (2019). MSC: 90C29 90C10 90C05 90C31 PDFBibTeX XMLCite \textit{L. L. Pinto} et al., Comput. Oper. Res. 106, 28--35 (2019; Zbl 1458.90581) Full Text: DOI
Ghasemi Saghand, Payman; Charkhgard, Hadi; Kwon, Changhyun A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach. (English) Zbl 1458.90573 Comput. Oper. Res. 101, 263-274 (2019). MSC: 90C29 90C11 90C57 PDFBibTeX XMLCite \textit{P. Ghasemi Saghand} et al., Comput. Oper. Res. 101, 263--274 (2019; Zbl 1458.90573) Full Text: DOI
Smeulders, Bart; Davis-Stober, Clintin; Regenwetter, Michel; Spieksma, Frits C. R. Testing probabilistic models of choice using column generation. (English) Zbl 1458.91069 Comput. Oper. Res. 95, 32-43 (2018). MSC: 91B06 90C10 90C59 PDFBibTeX XMLCite \textit{B. Smeulders} et al., Comput. Oper. Res. 95, 32--43 (2018; Zbl 1458.91069) Full Text: DOI Link
Fadda, Edoardo; Perboli, Guido; Tadei, Roberto Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT. (English) Zbl 1391.90126 Comput. Oper. Res. 93, 41-50 (2018). MSC: 90B15 90C10 90C15 90B80 PDFBibTeX XMLCite \textit{E. Fadda} et al., Comput. Oper. Res. 93, 41--50 (2018; Zbl 1391.90126) Full Text: DOI Link
Charkhgard, Hadi; Savelsbergh, Martin; Talebian, Masoud A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. (English) Zbl 1391.90406 Comput. Oper. Res. 89, 17-30 (2018). MSC: 90C05 90C25 90C29 PDFBibTeX XMLCite \textit{H. Charkhgard} et al., Comput. Oper. Res. 89, 17--30 (2018; Zbl 1391.90406) Full Text: DOI
Dollevoet, Twan; Huisman, Dennis; Kroon, Leo G.; Veelenturf, Lucas P.; Wagenaar, Joris C. Application of an iterative framework for real-time railway rescheduling. (English) Zbl 1391.90253 Comput. Oper. Res. 78, 203-217 (2017). MSC: 90B35 90B20 90C35 PDFBibTeX XMLCite \textit{T. Dollevoet} et al., Comput. Oper. Res. 78, 203--217 (2017; Zbl 1391.90253) Full Text: DOI Link
Conde, Eduardo A minimum expected regret model for the shortest path problem with solution-dependent probability distributions. (English) Zbl 1391.90509 Comput. Oper. Res. 77, 11-19 (2017). MSC: 90C27 90C35 90C15 PDFBibTeX XMLCite \textit{E. Conde}, Comput. Oper. Res. 77, 11--19 (2017; Zbl 1391.90509) Full Text: DOI
Gu, Hanyu Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities. (English) Zbl 1349.90712 Comput. Oper. Res. 71, 82-89 (2016). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{H. Gu}, Comput. Oper. Res. 71, 82--89 (2016; Zbl 1349.90712) Full Text: DOI
Marinelli, Fabrizio; Parente, Angelo A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem. (English) Zbl 1349.90819 Comput. Oper. Res. 69, 68-78 (2016). MSC: 90C35 05C85 90C59 PDFBibTeX XMLCite \textit{F. Marinelli} and \textit{A. Parente}, Comput. Oper. Res. 69, 68--78 (2016; Zbl 1349.90819) Full Text: DOI
Gorge, Agnès; Lisser, Abdel; Zorgati, Riadh Generating cutting planes for the semidefinite relaxation of quadratic programs. (English) Zbl 1348.90515 Comput. Oper. Res. 55, 65-75 (2015). MSC: 90C20 90C22 PDFBibTeX XMLCite \textit{A. Gorge} et al., Comput. Oper. Res. 55, 65--75 (2015; Zbl 1348.90515) Full Text: DOI
Göttlich, Simone; Herty, Michael; Ziegler, Ute Modeling and optimizing traffic light settings in road networks. (English) Zbl 1348.90186 Comput. Oper. Res. 55, 36-51 (2015). MSC: 90B20 90B10 90C11 PDFBibTeX XMLCite \textit{S. Göttlich} et al., Comput. Oper. Res. 55, 36--51 (2015; Zbl 1348.90186) Full Text: DOI
Cadarso, Luis; Marín, Ángel Improving robustness of rolling stock circulations in rapid transit networks. (English) Zbl 1348.90437 Comput. Oper. Res. 51, 146-159 (2014). MSC: 90B90 90B10 PDFBibTeX XMLCite \textit{L. Cadarso} and \textit{Á. Marín}, Comput. Oper. Res. 51, 146--159 (2014; Zbl 1348.90437) Full Text: DOI Link
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
Martins, Pedro Cliques with maximum/minimum edge neighborhood and neighborhood density. (English) Zbl 1250.05084 Comput. Oper. Res. 39, No. 3, 594-608 (2012). MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{P. Martins}, Comput. Oper. Res. 39, No. 3, 594--608 (2012; Zbl 1250.05084) Full Text: DOI
Wang, Ji-Bo; Wang, Ming-Zheng Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. (English) Zbl 1251.90197 Comput. Oper. Res. 39, No. 3, 492-497 (2012). MSC: 90B35 PDFBibTeX XMLCite \textit{J.-B. Wang} and \textit{M.-Z. Wang}, Comput. Oper. Res. 39, No. 3, 492--497 (2012; Zbl 1251.90197) Full Text: DOI
Létocart, Lucas; Nagih, Anass; Plateau, Gérard Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem. (English) Zbl 1251.90283 Comput. Oper. Res. 39, No. 1, 12-18 (2012). MSC: 90C10 90C20 90C27 PDFBibTeX XMLCite \textit{L. Létocart} et al., Comput. Oper. Res. 39, No. 1, 12--18 (2012; Zbl 1251.90283) Full Text: DOI
Wang, Haibo; Kochenberger, Gary; Glover, Fred A computational study on the quadratic knapsack problem with multiple constraints. (English) Zbl 1251.90291 Comput. Oper. Res. 39, No. 1, 3-11 (2012). MSC: 90C11 90C20 90C57 PDFBibTeX XMLCite \textit{H. Wang} et al., Comput. Oper. Res. 39, No. 1, 3--11 (2012; Zbl 1251.90291) Full Text: DOI
Wright, Stephen E. New linearizations of quadratic assignment problems. (English) Zbl 1251.90293 Comput. Oper. Res. 39, No. 11, 2858-2866 (2012). MSC: 90C11 90C27 90C20 PDFBibTeX XMLCite \textit{S. E. Wright}, Comput. Oper. Res. 39, No. 11, 2858--2866 (2012; Zbl 1251.90293) Full Text: DOI
Caimi, Gabrio; Fuchsberger, Martin; Laumanns, Marco; Lüthi, Marco A model predictive control approach for discrete-time rescheduling in complex central railway station areas. (English) Zbl 1251.90005 Comput. Oper. Res. 39, No. 11, 2578-2593 (2012). MSC: 90-04 90B35 PDFBibTeX XMLCite \textit{G. Caimi} et al., Comput. Oper. Res. 39, No. 11, 2578--2593 (2012; Zbl 1251.90005) Full Text: DOI
Adasme, Pablo; Lisser, Abdel; Soto, Ismael Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme. (English) Zbl 1208.90127 Comput. Oper. Res. 38, No. 10, 1377-1399 (2011). MSC: 90C20 90C22 90C31 PDFBibTeX XMLCite \textit{P. Adasme} et al., Comput. Oper. Res. 38, No. 10, 1377--1399 (2011; Zbl 1208.90127) Full Text: DOI
Pereira, Jordi; Averbakh, Igor Exact and heuristic algorithms for the interval data robust assignment problem. (English) Zbl 1208.90107 Comput. Oper. Res. 38, No. 8, 1153-1163 (2011). MSC: 90B80 90C11 90C59 PDFBibTeX XMLCite \textit{J. Pereira} and \textit{I. Averbakh}, Comput. Oper. Res. 38, No. 8, 1153--1163 (2011; Zbl 1208.90107) Full Text: DOI
Cadarso, Luis; Marín, Ángel Robust rolling stock in rapid transit networks. (English) Zbl 1208.90041 Comput. Oper. Res. 38, No. 8, 1131-1142 (2011). MSC: 90B20 PDFBibTeX XMLCite \textit{L. Cadarso} and \textit{Á. Marín}, Comput. Oper. Res. 38, No. 8, 1131--1142 (2011; Zbl 1208.90041) Full Text: DOI
Liang, Zhe; Chaovalitwongse, Wanpracha Art; Cha, Meeyoung; Moon, Sue B. Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms. (English) Zbl 1188.90063 Comput. Oper. Res. 37, No. 10, 1731-1739 (2010). MSC: 90B18 90C11 90C29 90C35 PDFBibTeX XMLCite \textit{Z. Liang} et al., Comput. Oper. Res. 37, No. 10, 1731--1739 (2010; Zbl 1188.90063) Full Text: DOI
Xu, Kailiang; Feng, Zuren; Jun, Keliang A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. (English) Zbl 1188.90088 Comput. Oper. Res. 37, No. 11, 1924-1938 (2010). MSC: 90B30 90B35 PDFBibTeX XMLCite \textit{K. Xu} et al., Comput. Oper. Res. 37, No. 11, 1924--1938 (2010; Zbl 1188.90088) Full Text: DOI
Martins, Pedro Extended and discretized formulations for the maximum clique problem. (English) Zbl 1192.90180 Comput. Oper. Res. 37, No. 7, 1348-1358 (2010). MSC: 90C27 PDFBibTeX XMLCite \textit{P. Martins}, Comput. Oper. Res. 37, No. 7, 1348--1358 (2010; Zbl 1192.90180) Full Text: DOI
Tuyttens, D.; Vandaele, A. Using a greedy random adaptative search procedure to solve the cover printing problem. (English) Zbl 1175.90343 Comput. Oper. Res. 37, No. 4, 640-648 (2010). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{D. Tuyttens} and \textit{A. Vandaele}, Comput. Oper. Res. 37, No. 4, 640--648 (2010; Zbl 1175.90343) Full Text: DOI
Irnich, Stefan Undirected postman problems with zigzagging option: a cutting-plane approach. (English) Zbl 1278.90341 Comput. Oper. Res. 35, No. 12, 3998-4009 (2008). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{S. Irnich}, Comput. Oper. Res. 35, No. 12, 3998--4009 (2008; Zbl 1278.90341) Full Text: DOI
Cavalcante, Victor F.; de Souza, Cid C.; Lucena, Abílio A relax-and-cut algorithm for the set partitioning problem. (English) Zbl 1139.90034 Comput. Oper. Res. 35, No. 6, 1963-1981 (2008). MSC: 90C57 PDFBibTeX XMLCite \textit{V. F. Cavalcante} et al., Comput. Oper. Res. 35, No. 6, 1963--1981 (2008; Zbl 1139.90034) Full Text: DOI
Peeters, Marc; Kroon, Leo Circulation of railway rolling stock: a branch-and-price approach. (English) Zbl 1141.90009 Comput. Oper. Res. 35, No. 2, 538-556 (2008). MSC: 90B10 90B50 90C55 90B35 90B06 PDFBibTeX XMLCite \textit{M. Peeters} and \textit{L. Kroon}, Comput. Oper. Res. 35, No. 2, 538--556 (2008; Zbl 1141.90009) Full Text: DOI Link
Berman, Oded; Huang, Rongbing The minimum weighted covering location problem with distance constraints. (English) Zbl 1141.90022 Comput. Oper. Res. 35, No. 2, 356-372 (2008). MSC: 90B80 90C35 PDFBibTeX XMLCite \textit{O. Berman} and \textit{R. Huang}, Comput. Oper. Res. 35, No. 2, 356--372 (2008; Zbl 1141.90022) Full Text: DOI
Guan, Xiucui; Zhang, Jianzhong Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm. (English) Zbl 1123.90060 Comput. Oper. Res. 34, No. 11, 3243-3254 (2007). MSC: 90C27 PDFBibTeX XMLCite \textit{X. Guan} and \textit{J. Zhang}, Comput. Oper. Res. 34, No. 11, 3243--3254 (2007; Zbl 1123.90060) Full Text: DOI
Riera-Ledesma, Jorge; Salazar-González, Juan-José A branch-and-cut algorithm for the continuous error localization problem in data cleaning. (English) Zbl 1141.90581 Comput. Oper. Res. 34, No. 9, 2790-2804 (2007). MSC: 90C57 90C10 68P99 PDFBibTeX XMLCite \textit{J. Riera-Ledesma} and \textit{J.-J. Salazar-González}, Comput. Oper. Res. 34, No. 9, 2790--2804 (2007; Zbl 1141.90581) Full Text: DOI
Riera-Ledesma, Jorge; Salazar-González, Juan-José A heuristic approach for the continuous error localization problem in data cleaning. (English) Zbl 1141.68403 Comput. Oper. Res. 34, No. 8, 2370-2383 (2007). MSC: 68P20 90C59 PDFBibTeX XMLCite \textit{J. Riera-Ledesma} and \textit{J.-J. Salazar-González}, Comput. Oper. Res. 34, No. 8, 2370--2383 (2007; Zbl 1141.68403) Full Text: DOI
Corberán, Angel; Mota, Enrique; Sanchis, José M. A comparison of two different formulations for arc routing problems on mixed graphs. (English) Zbl 1094.90037 Comput. Oper. Res. 33, No. 12, 3384-3402 (2006). MSC: 90C27 68R10 PDFBibTeX XMLCite \textit{A. Corberán} et al., Comput. Oper. Res. 33, No. 12, 3384--3402 (2006; Zbl 1094.90037) Full Text: DOI
Kaspi, Moshe; Shabtay, Dvir A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. (English) Zbl 1086.90024 Comput. Oper. Res. 33, No. 10, 3015-3033 (2006). MSC: 90B35 PDFBibTeX XMLCite \textit{M. Kaspi} and \textit{D. Shabtay}, Comput. Oper. Res. 33, No. 10, 3015--3033 (2006; Zbl 1086.90024) Full Text: DOI
van Hoeve, Willem-Jan Exploiting semidefinite relaxations in constraint programming. (English) Zbl 1086.90044 Comput. Oper. Res. 33, No. 10, 2787-2804 (2006). MSC: 90C22 PDFBibTeX XMLCite \textit{W.-J. van Hoeve}, Comput. Oper. Res. 33, No. 10, 2787--2804 (2006; Zbl 1086.90044) Full Text: DOI
Kwon, Sang-Ho; Kim, Hun-Tae; Kang, Maing-Kyu Determination of the candidate arc set for the asymmetric traveling salesman problem. (English) Zbl 1094.90048 Comput. Oper. Res. 32, No. 5, 1045-1057 (2005). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{S.-H. Kwon} et al., Comput. Oper. Res. 32, No. 5, 1045--1057 (2005; Zbl 1094.90048) Full Text: DOI
Shabtay, Dvir; Kaspi, Moshe Minimizing the total weighted flow time in a single machine with controllable processing times. (English) Zbl 1073.90017 Comput. Oper. Res. 31, No. 13, 2279-2289 (2004). MSC: 90B35 91B32 91B76 90C59 90C39 PDFBibTeX XMLCite \textit{D. Shabtay} and \textit{M. Kaspi}, Comput. Oper. Res. 31, No. 13, 2279--2289 (2004; Zbl 1073.90017) Full Text: DOI
Shabtay, Dvir Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. (English) Zbl 1073.90016 Comput. Oper. Res. 31, No. 8, 1303-1315 (2004). MSC: 90B35 PDFBibTeX XMLCite \textit{D. Shabtay}, Comput. Oper. Res. 31, No. 8, 1303--1315 (2004; Zbl 1073.90016) Full Text: DOI
Kaspi, Moshe; Shabtay, Dvir Convex resource allocation for minimizing the makespan in a single machine with job release dates. (English) Zbl 1076.68018 Comput. Oper. Res. 31, No. 9, 1481-1489 (2004). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{M. Kaspi} and \textit{D. Shabtay}, Comput. Oper. Res. 31, No. 9, 1481--1489 (2004; Zbl 1076.68018) Full Text: DOI
Vasko, Francis J.; Barbieri, Robert S.; Rieksts, Brian Q.; Reitmeyer, Kenneth L.; Stott, Kenneth L. jun. The cable trench problem: Combining the shortest path and minimum spanning tree problems. (English) Zbl 0994.90124 Comput. Oper. Res. 29, No. 5, 441-458 (2002). Reviewer: Thomas M.Liebling (Lausanne) MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{F. J. Vasko} et al., Comput. Oper. Res. 29, No. 5, 441--458 (2002; Zbl 0994.90124) Full Text: DOI
Boctor, Fayez F.; Renaud, Jacques The column-circular, subsets-selection problem: Complexity and solutions. (English) Zbl 0973.90017 Comput. Oper. Res. 27, No. 4, 383-398 (2000). MSC: 90B20 68Q25 PDFBibTeX XMLCite \textit{F. F. Boctor} and \textit{J. Renaud}, Comput. Oper. Res. 27, No. 4, 383--398 (2000; Zbl 0973.90017) Full Text: DOI
Klincewicz, John G.; Luss, Hanan; Yan, Dicky C. K. Designing tributary networks with multiple ring families. (English) Zbl 1042.90522 Comput. Oper. Res. 25, No. 12, 1145-1157 (1998). MSC: 90B18 90B06 PDFBibTeX XMLCite \textit{J. G. Klincewicz} et al., Comput. Oper. Res. 25, No. 12, 1145--1157 (1998; Zbl 1042.90522) Full Text: DOI
van der Veen, Jack A. A.; Zhang, Shuzhong Low-complexity algorithms for sequencing jobs with a fixed number of job-classes. (English) Zbl 0870.90073 Comput. Oper. Res. 23, No. 11, 1059-1067 (1996). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{J. A. A. van der Veen} and \textit{S. Zhang}, Comput. Oper. Res. 23, No. 11, 1059--1067 (1996; Zbl 0870.90073) Full Text: DOI Link
Liu, Ming-Long; Sahinidis, Nikolaos V. Long range planning in the process industries: A projection approach. (English) Zbl 0855.90078 Comput. Oper. Res. 23, No. 3, 237-253 (1996). MSC: 90B90 90C11 90C90 90C06 PDFBibTeX XMLCite \textit{M.-L. Liu} and \textit{N. V. Sahinidis}, Comput. Oper. Res. 23, No. 3, 237--253 (1996; Zbl 0855.90078) Full Text: DOI
Pardalos, Panos M.; Rodgers, Gregory P. A branch and bound algorithm for the maximum clique problem. (English) Zbl 0757.90082 Comput. Oper. Res. 19, No. 5, 363-375 (1992). MSC: 90C35 90C09 90C20 90-08 90C10 PDFBibTeX XMLCite \textit{P. M. Pardalos} and \textit{G. P. Rodgers}, Comput. Oper. Res. 19, No. 5, 363--375 (1992; Zbl 0757.90082) Full Text: DOI
De Serres, Yves Simultaneous optimization of flow-control and scheduling in a single server queue with two job classes: Numerical results and approximation. (English) Zbl 0717.90031 Comput. Oper. Res. 18, No. 4, 361-378 (1991). MSC: 90B22 60K25 90B35 PDFBibTeX XMLCite \textit{Y. De Serres}, Comput. Oper. Res. 18, No. 4, 361--378 (1991; Zbl 0717.90031) Full Text: DOI