Ordozgoiti, Bruno; Mozo, Alberto; López de Lacalle, Jesús García Regularized greedy column subset selection. (English) Zbl 1451.68250 Inf. Sci. 486, 393-418 (2019). MSC: 68T20 68T05 90C27 PDF BibTeX XML Cite \textit{B. Ordozgoiti} et al., Inf. Sci. 486, 393--418 (2019; Zbl 1451.68250) Full Text: DOI
Wang, Kevin YX; Tarr, Garth; Yang, Jean Yh; Mueller, Samuel Fast and approximate exhaustive variable selection for generalised linear models with APES. (English) Zbl 1440.62290 Aust. N. Z. J. Stat. 61, No. 4, 445-465 (2019). MSC: 62J12 62-08 62F07 PDF BibTeX XML Cite \textit{K. Y. Wang} et al., Aust. N. Z. J. Stat. 61, No. 4, 445--465 (2019; Zbl 1440.62290) Full Text: DOI
Einarsson, Hafsteinn; Gauy, Marcelo Matheus; Lengler, Johannes; Meier, Florian; Mujika, Asier; Steger, Angelika; Weissenberger, Felix The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates. (English) Zbl 1425.68387 Theor. Comput. Sci. 785, 150-170 (2019). MSC: 68T20 PDF BibTeX XML Cite \textit{H. Einarsson} et al., Theor. Comput. Sci. 785, 150--170 (2019; Zbl 1425.68387) Full Text: DOI
Yang, Yang; Liu, Ximeng; Deng, Robert Expressive query over outsourced encrypted data. (English) Zbl 1440.68066 Inf. Sci. 442-443, 33-53 (2018). MSC: 68P20 68P25 68P27 PDF BibTeX XML Cite \textit{Y. Yang} et al., Inf. Sci. 442--443, 33--53 (2018; Zbl 1440.68066) Full Text: DOI
Shenmaĭer, V. V. Approximability of the problem of finding a vector subset with the longest sum. (Russian, English) Zbl 1438.90402 Diskretn. Anal. Issled. Oper. 25, No. 4, 131-148 (2018); translation in J. Appl. Ind. Math. 12, No. 4, 749-758 (2018). MSC: 90C59 90C27 90C60 PDF BibTeX XML Cite \textit{V. V. Shenmaĭer}, Diskretn. Anal. Issled. Oper. 25, No. 4, 131--148 (2018; Zbl 1438.90402); translation in J. Appl. Ind. Math. 12, No. 4, 749--758 (2018) Full Text: DOI
Shenmaĭer, V. V. An exact algorithm for finding a vector subset with the longest sum. (Russian, English) Zbl 1399.90223 Diskretn. Anal. Issled. Oper. 24, No. 4, 111-129 (2017); translation in J. Appl. Ind. Math. 11, No. 4, 584-593 (2017). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{V. V. Shenmaĭer}, Diskretn. Anal. Issled. Oper. 24, No. 4, 111--129 (2017; Zbl 1399.90223); translation in J. Appl. Ind. Math. 11, No. 4, 584--593 (2017) Full Text: DOI
Devadas, Srinivas; Ren, Ling; Xiao, Hanshen On iterative collision search for LPN and subset sum. (English) Zbl 1416.68143 Kalai, Yael (ed.) et al., Theory of cryptography. 15th international conference, TCC 2017, Baltimore, MD, USA, November 12–15, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10678, 729-746 (2017). MSC: 68T05 68T20 68W40 94A60 PDF BibTeX XML Cite \textit{S. Devadas} et al., Lect. Notes Comput. Sci. 10678, 729--746 (2017; Zbl 1416.68143) Full Text: DOI
Sviridenko, Maxim; Vondrák, Jan; Ward, Justin Optimal approximation for submodular and supermodular optimization with bounded curvature. (English) Zbl 1386.90129 Math. Oper. Res. 42, No. 4, 1197-1218 (2017). MSC: 90C27 68W25 PDF BibTeX XML Cite \textit{M. Sviridenko} et al., Math. Oper. Res. 42, No. 4, 1197--1218 (2017; Zbl 1386.90129) Full Text: DOI
Eremeev, A. V.; Tarasenko, È. A. Algorithms for solving the hub construction problem with given number of hub nodes. (Russian. English summary) Zbl 1399.90299 Mat. Strukt. Model. 38, 43-59 (2016). MSC: 90C59 90C90 90C27 90C11 PDF BibTeX XML Cite \textit{A. V. Eremeev} and \textit{È. A. Tarasenko}, Mat. Strukt. Model. 38, 43--59 (2016; Zbl 1399.90299) Full Text: Link
Bliem, Bernhard; Charwat, Günther; Hecher, Markus; Woltran, Stefan D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy. (English) Zbl 1374.68490 Fundam. Inform. 147, No. 1, 27-61 (2016). MSC: 68T20 90C39 PDF BibTeX XML Cite \textit{B. Bliem} et al., Fundam. Inform. 147, No. 1, 27--61 (2016; Zbl 1374.68490) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket Exact algorithms via monotone local search. (English) Zbl 1375.68185 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 764-775 (2016). MSC: 68W05 68Q25 68T20 68W20 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 764--775 (2016; Zbl 1375.68185) Full Text: DOI arXiv
Eremeev, A. V.; Kel’manov, A. V.; Pyatkin, A. V. On the complexity and approximability of some Euclidean optimal summing problems. (English. Russian original) Zbl 1400.68248 Comput. Math. Math. Phys. 56, No. 10, 1813-1817 (2016); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 10, 1831-1836 (2016). MSC: 68U05 68Q17 68Q25 90C27 PDF BibTeX XML Cite \textit{A. V. Eremeev} et al., Comput. Math. Math. Phys. 56, No. 10, 1813--1817 (2016; Zbl 1400.68248); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 10, 1831--1836 (2016) Full Text: DOI
Gimadi, È. Kh.; Rykov, I. A. A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum. (Russian, English) Zbl 1349.90881 Diskretn. Anal. Issled. Oper. 22, No. 3, 5-17 (2015); translation in J. Appl. Ind. Math. 9, No. 3, 351-357 (2015). MSC: 90C60 68W20 PDF BibTeX XML Cite \textit{È. Kh. Gimadi} and \textit{I. A. Rykov}, Diskretn. Anal. Issled. Oper. 22, No. 3, 5--17 (2015; Zbl 1349.90881); translation in J. Appl. Ind. Math. 9, No. 3, 351--357 (2015) Full Text: DOI
Tibshirani, Ryan J. Degrees of freedom and model search. (English) Zbl 1415.62058 Stat. Sin. 25, No. 3, 1265-1296 (2015). MSC: 62J99 62F10 62J07 PDF BibTeX XML Cite \textit{R. J. Tibshirani}, Stat. Sin. 25, No. 3, 1265--1296 (2015; Zbl 1415.62058) Full Text: DOI arXiv
Kundu, Suprateek; Dunson, David B. Bayes variable selection in semiparametric linear models. (English) Zbl 1367.62069 J. Am. Stat. Assoc. 109, No. 505, 437-447 (2014). MSC: 62F15 62G05 62F12 62J05 PDF BibTeX XML Cite \textit{S. Kundu} and \textit{D. B. Dunson}, J. Am. Stat. Assoc. 109, No. 505, 437--447 (2014; Zbl 1367.62069) Full Text: DOI arXiv
Eremin, I. I.; Gimadi, E. K.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu. 2-approximation algorithm for finding a clique with minimum weight of vertices and edges. (English. Russian original) Zbl 1302.90175 Proc. Steklov Inst. Math. 284, Suppl. 1, S87-S95 (2014); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 19, No. 2, 134-143 (2013). MSC: 90C27 90C35 05C85 PDF BibTeX XML Cite \textit{I. I. Eremin} et al., Proc. Steklov Inst. Math. 284, S87--S95 (2014; Zbl 1302.90175); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 19, No. 2, 134--143 (2013) Full Text: DOI
Verwaeren, Jan; Scheerlinck, Karolien; De Baets, Bernard Countering the negative search bias of ant colony optimization in subset selection problems. (English) Zbl 1349.90872 Comput. Oper. Res. 40, No. 4, 931-942 (2013). MSC: 90C59 PDF BibTeX XML Cite \textit{J. Verwaeren} et al., Comput. Oper. Res. 40, No. 4, 931--942 (2013; Zbl 1349.90872) Full Text: DOI
Kel’manov, A. V.; Khandeev, V. I. A 2-approximation polynomial algorithm for a clustering problem. (Russian, English) Zbl 1324.68244 Diskretn. Anal. Issled. Oper. 20, No. 4, 36-45 (2013); translation in J. Appl. Ind. Math. 7, No. 4, 515-521 (2013). MSC: 68W25 68Q17 68T05 PDF BibTeX XML Cite \textit{A. V. Kel'manov} and \textit{V. I. Khandeev}, Diskretn. Anal. Issled. Oper. 20, No. 4, 36--45 (2013; Zbl 1324.68244); translation in J. Appl. Ind. Math. 7, No. 4, 515--521 (2013) Full Text: DOI
Klein, Shmuel T. On the connection between Hamming codes, Heapsort and other methods. (English) Zbl 1284.68225 Inf. Process. Lett. 113, No. 17, 617-620 (2013). MSC: 68P10 94B25 68W05 PDF BibTeX XML Cite \textit{S. T. Klein}, Inf. Process. Lett. 113, No. 17, 617--620 (2013; Zbl 1284.68225) Full Text: DOI
Bernstein, Daniel J.; Jeffery, Stacey; Lange, Tanja; Meurer, Alexander Quantum algorithms for the subset-sum problem. (English) Zbl 1295.68127 Gaborit, Philippe (ed.), Post-quantum cryptography. 5th international workshop, PQCrypto 2013, Limoges, France, June 4–7, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38615-2/pbk). Lecture Notes in Computer Science 7932, 16-33 (2013). MSC: 68Q25 68P05 68Q12 68Q17 94A60 PDF BibTeX XML Cite \textit{D. J. Bernstein} et al., Lect. Notes Comput. Sci. 7932, 16--33 (2013; Zbl 1295.68127) Full Text: DOI
Acid, Silvia; De Campos, Luis M.; Fernández, Moisés Score-based methods for learning Markov boundaries by searching in constrained spaces. (English) Zbl 1260.68318 Data Min. Knowl. Discov. 26, No. 1, 174-212 (2013). MSC: 68T05 PDF BibTeX XML Cite \textit{S. Acid} et al., Data Min. Knowl. Discov. 26, No. 1, 174--212 (2013; Zbl 1260.68318) Full Text: DOI
Mattos Ribeiro, Glaydston; Desaulniers, Guy; Desrosiers, Jacques A branch-price-and-cut algorithm for the workover rig routing problem. (English) Zbl 1349.90112 Comput. Oper. Res. 39, No. 12, 3305-3315 (2012). MSC: 90B06 90C57 90B80 PDF BibTeX XML Cite \textit{G. Mattos Ribeiro} et al., Comput. Oper. Res. 39, No. 12, 3305--3315 (2012; Zbl 1349.90112) Full Text: DOI
Kel’manov, A. V.; Romanchenko, S. M.; Khamidullin, S. A. Approximation algorithms for some intractable problems of choosing a vector subsequence. (Russian, English) Zbl 1324.68246 Diskretn. Anal. Issled. Oper. 19, No. 3, 27-38 (2012); translation in J. Appl. Ind. Math. 6, No. 4, 443-450 (2012). MSC: 68W25 68Q17 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Diskretn. Anal. Issled. Oper. 19, No. 3, 27--38 (2012; Zbl 1324.68246); translation in J. Appl. Ind. Math. 6, No. 4, 443--450 (2012) Full Text: DOI
Kong, Lifang; Zhang, Hong An asynchronous parallel particle swarm optimizer for feature subset selection. (Chinese. English summary) Zbl 1274.68426 Control Decis. 27, No. 7, 967-974 (2012). MSC: 68T20 68T10 68T05 68W10 PDF BibTeX XML Cite \textit{L. Kong} and \textit{H. Zhang}, Control Decis. 27, No. 7, 967--974 (2012; Zbl 1274.68426)
Dolgushev, A. V.; Kel’manov, A. V. An approximation algorithm for a problem of cluster analysis. (Russian) Zbl 1249.90186 Diskretn. Anal. Issled. Oper. 18, No. 2, 29-40 (2011). MSC: 90C20 PDF BibTeX XML Cite \textit{A. V. Dolgushev} and \textit{A. V. Kel'manov}, Diskretn. Anal. Issled. Oper. 18, No. 2, 29--40 (2011; Zbl 1249.90186)
Brusco, Michael J.; Steinley, Douglas Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression. (English) Zbl 1183.62110 Nav. Res. Logist. 57, No. 1, 33-44 (2010). MSC: 62J02 62J05 90C59 65C60 PDF BibTeX XML Cite \textit{M. J. Brusco} and \textit{D. Steinley}, Nav. Res. Logist. 57, No. 1, 33--44 (2010; Zbl 1183.62110) Full Text: DOI
Ris, Marcelo; Barrera, Junior; Martins, David C. jun. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. (English) Zbl 1178.90296 Pattern Recognition 43, No. 3, 557-568 (2010). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{M. Ris} et al., Pattern Recognition 43, No. 3, 557--568 (2010; Zbl 1178.90296) Full Text: DOI
Perrier, Eric; Imoto, Seiya; Miyano, Satoru Finding optimal Bayesian network given a super-structure. (English) Zbl 1225.68206 J. Mach. Learn. Res. 9, 2251-2286 (2008). MSC: 68T05 62M45 PDF BibTeX XML Cite \textit{E. Perrier} et al., J. Mach. Learn. Res. 9, 2251--2286 (2008; Zbl 1225.68206) Full Text: Link
Tahir, Muhammad A.; Smith, James E. Feature selection for heterogeneous ensembles of nearest-neighbour classifiers using hybrid tabu search. (English) Zbl 1211.90317 Siarry, Patrick (ed.) et al., Advances in metaheuristics for hard optimization. Berlin: Springer (ISBN 978-3-540-72959-4/hbk). Natural Computing Series, 69-85 (2008). MSC: 90C59 PDF BibTeX XML Cite \textit{M. A. Tahir} and \textit{J. E. Smith}, in: Advances in metaheuristics for hard optimization. Berlin: Springer. 69--85 (2008; Zbl 1211.90317) Full Text: DOI
Beausoleil, Ricardo P. “MOSS-II” tabu/scatter search for nonlinear multiobjective optimization. (English) Zbl 1211.90204 Siarry, Patrick (ed.) et al., Advances in metaheuristics for hard optimization. Berlin: Springer (ISBN 978-3-540-72959-4/hbk). Natural Computing Series, 40-67 (2008). MSC: 90C29 90C59 PDF BibTeX XML Cite \textit{R. P. Beausoleil}, in: Advances in metaheuristics for hard optimization. Berlin: Springer. 40--67 (2008; Zbl 1211.90204) Full Text: DOI
Liffiton, Mark H.; Sakallah, Karem A. Algorithms for computing minimal unsatisfiable subsets of constraints. (English) Zbl 1154.68510 J. Autom. Reasoning 40, No. 1, 1-33 (2008). MSC: 68T20 PDF BibTeX XML Cite \textit{M. H. Liffiton} and \textit{K. A. Sakallah}, J. Autom. Reasoning 40, No. 1, 1--33 (2008; Zbl 1154.68510) Full Text: DOI
Darras, Sylvain; Dequen, Gilles; Devendeville, Laure; Li, Chu-Min On inconsistent clause-subsets for Max-SAT solving. (English) Zbl 1145.68509 Bessière, Christian (ed.), Principles and practice of constraint programming – CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74969-1/pbk). Lecture Notes in Computer Science 4741, 225-240 (2007). MSC: 68T20 PDF BibTeX XML Cite \textit{S. Darras} et al., Lect. Notes Comput. Sci. 4741, 225--240 (2007; Zbl 1145.68509) Full Text: DOI
García López, Félix; García Torres, Miguel; Melián Batista, Belén; Moreno Pérez, José A.; Moreno-Vega, J. Marcos Solving feature subset selection problem by a parallel scatter search. (English) Zbl 1079.90174 Eur. J. Oper. Res. 169, No. 2, 477-489 (2006). MSC: 90C59 90B99 PDF BibTeX XML Cite \textit{F. García López} et al., Eur. J. Oper. Res. 169, No. 2, 477--489 (2006; Zbl 1079.90174) Full Text: DOI
Somol, Petr; Pudil, Pavel; Grim, Jiří On prediction mechanisms in fast branch & bound algorithms. (English) Zbl 1104.68694 Fred, Ana (ed.) et al., Structural, syntactic, and statistical pattern recognition. Joint IAPR international workshops SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18–20, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22570-6/pbk). Lecture Notes in Computer Science 3138, 716-724 (2004). MSC: 68T10 68T20 PDF BibTeX XML Cite \textit{P. Somol} et al., Lect. Notes Comput. Sci. 3138, 716--724 (2004; Zbl 1104.68694) Full Text: DOI
Grossi, Luigi; Riani, Marco Robust time series analysis through the forward search. (English) Zbl 1444.62012 Härdle, Wolfgang (ed.) et al., COMPSTAT. Proceedings in computational statistics. 15th symposium, Berlin, Germany, August 24–28, 2002. Heidelberg: Physica-Verlag. 521-526 (2002). MSC: 62-08 62J20 62M10 PDF BibTeX XML Cite \textit{L. Grossi} and \textit{M. Riani}, in: COMPSTAT. Proceedings in computational statistics. 15th symposium, Berlin, Germany, August 24--28, 2002. Heidelberg: Physica-Verlag. 521--526 (2002; Zbl 1444.62012) Full Text: DOI
Fishburn, Peter C.; Pekeč, Aleksandar; Reeds, James A. Subset comparisons for additive linear orders. (English) Zbl 1082.06002 Math. Oper. Res. 27, No. 1, 227-243 (2002). MSC: 06A07 06E25 68R05 91B06 91C05 PDF BibTeX XML Cite \textit{P. C. Fishburn} et al., Math. Oper. Res. 27, No. 1, 227--243 (2002; Zbl 1082.06002) Full Text: DOI
Somol, P.; Pudil, P. Feature selection toolbox. (English) Zbl 1007.68934 Pattern Recognition 35, No. 12, 2749-2759 (2002). MSC: 68U99 68T10 PDF BibTeX XML Cite \textit{P. Somol} and \textit{P. Pudil}, Pattern Recognition 35, No. 12, 2749--2759 (2002; Zbl 1007.68934) Full Text: DOI
Przydatek, Bartosz A fast approximation algorithm for the subset-sum problem. (English) Zbl 1022.90009 Int. Trans. Oper. Res. 9, No. 4, 437-459 (2002). MSC: 90C10 90B40 90C59 PDF BibTeX XML Cite \textit{B. Przydatek}, Int. Trans. Oper. Res. 9, No. 4, 437--459 (2002; Zbl 1022.90009) Full Text: DOI
Zhang, Hongbin; Sun, Guangyu Optimal reference subset selection for nearest neighbor classification by tabu search. (English) Zbl 1016.68089 Pattern Recognition 35, No. 7, 1481-1490 (2002). MSC: 68T10 68P10 PDF BibTeX XML Cite \textit{H. Zhang} and \textit{G. Sun}, Pattern Recognition 35, No. 7, 1481--1490 (2002; Zbl 1016.68089) Full Text: DOI
Somol, Petr; Pudil, Pavel; Grim, Jirí Branch & Bound algorithm with partial prediction for use with recursive and non-recursive criterion forms. (English) Zbl 0977.68855 Singh, Sameer (ed.) et al., Advances in pattern recognition - ICAPR 2001. 2nd international conference, rio de Janeiro, Brazil, March 11-14, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2013, 230-239 (2001). MSC: 68U99 68T10 PDF BibTeX XML Cite \textit{P. Somol} et al., Lect. Notes Comput. Sci. 2013, 230--239 (2001; Zbl 0977.68855) Full Text: Link
Ghosh, Diptesh; Chakravarti, Nilotpal A competitive local search heuristic for the subset sum problem. (English) Zbl 0947.90053 Comput. Oper. Res. 26, No. 3, 271-279 (1999). MSC: 90B40 PDF BibTeX XML Cite \textit{D. Ghosh} and \textit{N. Chakravarti}, Comput. Oper. Res. 26, No. 3, 271--279 (1999; Zbl 0947.90053) Full Text: DOI
Biró, M. The interval subset sum problem. (English) Zbl 0735.90047 Optimization 21, No. 2, 255-264 (1990). Reviewer: U.Zimmermann (Braunschweig) MSC: 90C10 90C60 PDF BibTeX XML Cite \textit{M. Biró}, Optimization 21, No. 2, 255--264 (1990; Zbl 0735.90047) Full Text: DOI
Lunnon, W. F. Integer sets with distinct subset-sums. (English) Zbl 0654.10016 Math. Comput. 50, No. 181, 297-320 (1988). Reviewer: M.D.Hendy MSC: 11B75 11B99 05A99 PDF BibTeX XML Cite \textit{W. F. Lunnon}, Math. Comput. 50, No. 181, 297--320 (1988; Zbl 0654.10016) Full Text: DOI
Erickson, Gary J. (ed.); Smith, C. Ray (ed.) Maximum-entropy and Bayesian methods in science and engineering. Vol. I: Foundations. Vol II: Applications. (Proceedings of the 5th, 6th and 7th workshops held at the University of Wyoming, August 5-8, 1985, and at Seattle University, August 5-8, 1986, and August 4-7, 1987). (English) Zbl 0665.62006 Fundamental Theories of Physics, 31-32. Dordrecht etc.: Kluwer Academic Publishers. x, 316 p./Vol. I; ix, 436 p./Vol II, £98.00/set (1988). Reviewer: K.Piasecki MSC: 62-06 62A01 68T05 62N99 62P99 94A15 62B10 68T99 PDF BibTeX XML Cite \textit{G. J. Erickson} (ed.) and \textit{C. R. Smith} (ed.), Maximum-entropy and Bayesian methods in science and engineering. Vol. I: Foundations. Vol II: Applications. (Proceedings of the 5th, 6th and 7th workshops held at the University of Wyoming, August 5-8, 1985, and at Seattle University, August 5-8, 1986, and August 4-7, 1987). Dordrecht etc.: Kluwer Academic Publishers (1988; Zbl 0665.62006)
Broersen, P. M. T. Subset regression with stepwise directed search. (English) Zbl 0614.62091 J. R. Stat. Soc., Ser. C 35, 168-177 (1986). MSC: 62J99 68P10 62-04 PDF BibTeX XML Cite \textit{P. M. T. Broersen}, J. R. Stat. Soc., Ser. C 35, 168--177 (1986; Zbl 0614.62091) Full Text: DOI
Miller, Alan J. Selection of subsets of regression variables. (English) Zbl 0584.62106 J. R. Stat. Soc., Ser. A 147, 389-425 (1984). Reviewer: A.C.Tamhane MSC: 62J05 65C99 62F03 62F07 PDF BibTeX XML Cite \textit{A. J. Miller}, J. R. Stat. Soc., Ser. A 147, 389--425 (1984; Zbl 0584.62106) Full Text: DOI
Martello, Silvano; Toth, Paolo A mixture of dynamic programming and branch-and-bound for the subset-sum problem. (English) Zbl 0555.90073 Manage. Sci. 30, 765-771 (1984). Reviewer: H.Suzuki MSC: 90C09 65K05 90C39 90C10 PDF BibTeX XML Cite \textit{S. Martello} and \textit{P. Toth}, Manage. Sci. 30, 765--771 (1984; Zbl 0555.90073) Full Text: DOI
Kantsendal, S. A. Algorithm to speed up the search for solutions in a network scheduling problem. (English. Russian original) Zbl 0504.90041 Autom. Remote Control 43, 485-490 (1982); translation from Avtom. Telemekh. 1982, No. 4, 72-77 (1982). MSC: 90B35 65K05 PDF BibTeX XML Cite \textit{S. A. Kantsendal}, Autom. Remote Control 43, 485--490 (1982; Zbl 0504.90041); translation from Avtom. Telemekh. 1982, No. 4, 72--77 (1982)
Seboe, Andras Sequential search using question-sets with bounded intersections. (English) Zbl 0493.90045 J. Stat. Plann. Inference 7, 139-150 (1982). MSC: 90B40 PDF BibTeX XML Cite \textit{A. Seboe}, J. Stat. Plann. Inference 7, 139--150 (1982; Zbl 0493.90045) Full Text: DOI