Choi, Junesang; Khan, Nabiullah; Usman, Talha Certain Laguerre-based generalized Apostol type polynomials. (English) Zbl 1479.33005 Tamkang J. Math. 53, No. 1, 59-74 (2022). MSC: 33C45 05A15 11B68 PDF BibTeX XML Cite \textit{J. Choi} et al., Tamkang J. Math. 53, No. 1, 59--74 (2022; Zbl 1479.33005) Full Text: DOI OpenURL
Malekian, Yaser; Mirmohammadi, S. Hamid; Bijari, Mehdi Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount. (English) Zbl 07486214 Comput. Oper. Res. 134, Article ID 105373, 14 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Malekian} et al., Comput. Oper. Res. 134, Article ID 105373, 14 p. (2021; Zbl 07486214) Full Text: DOI OpenURL
Aktaş, Fatih S.; Ekmekcioglu, Ömer; Pinar, Mustafa Ç. Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration. (English) Zbl 1478.65028 Optim. Eng. 22, No. 4, 2505-2535 (2021). MSC: 65F20 65F22 65K05 90C26 PDF BibTeX XML Cite \textit{F. S. Aktaş} et al., Optim. Eng. 22, No. 4, 2505--2535 (2021; Zbl 1478.65028) Full Text: DOI OpenURL
Glover, J.; Quan, V.; Zolfaghari, S. Some new perspectives for solving 0–1 integer programming problems using balas method. (English) Zbl 07432765 Comput. Manag. Sci. 18, No. 2, 177-193 (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Glover} et al., Comput. Manag. Sci. 18, No. 2, 177--193 (2021; Zbl 07432765) Full Text: DOI OpenURL
Jansen, Sabine; Kuna, Tobias; Tsagkarogiannis, Dimitrios Lagrange inversion and combinatorial species with uncountable color palette. (English) Zbl 1464.32001 Ann. Henri Poincaré 22, No. 5, 1499-1534 (2021). MSC: 32A05 47J07 05A15 82B21 81T15 PDF BibTeX XML Cite \textit{S. Jansen} et al., Ann. Henri Poincaré 22, No. 5, 1499--1534 (2021; Zbl 1464.32001) Full Text: DOI arXiv OpenURL
Mitze, Ruth; Mönnigmann, Martin A dynamic programming approach to solving constrained linear-quadratic optimal control problems. (English) Zbl 1448.49039 Automatica 120, Article ID 109132, 6 p. (2020). MSC: 49N10 90C39 PDF BibTeX XML Cite \textit{R. Mitze} and \textit{M. Mönnigmann}, Automatica 120, Article ID 109132, 6 p. (2020; Zbl 1448.49039) Full Text: DOI arXiv OpenURL
Ascher, Kenneth; Dubé, Connor; Gershenson, Daniel; Hou, Elaine Enumerating Hassett’s wall and chamber decomposition of the moduli space of weighted stable curves. (English) Zbl 1445.14022 Exp. Math. 29, No. 1, 36-53 (2020). Reviewer: Dawei Chen (Chestnut Hill) MSC: 14D20 14H10 05A15 03D15 PDF BibTeX XML Cite \textit{K. Ascher} et al., Exp. Math. 29, No. 1, 36--53 (2020; Zbl 1445.14022) Full Text: DOI arXiv OpenURL
Hackl, Benjamin; Heuberger, Clemens; Prodinger, Helmut Counting ascents in generalized Dyck paths. (English) Zbl 1482.05012 Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 26, 15 p. (2018). MSC: 05A15 PDF BibTeX XML Cite \textit{B. Hackl} et al., LIPIcs -- Leibniz Int. Proc. Inform. 110, Article 26, 15 p. (2018; Zbl 1482.05012) Full Text: DOI arXiv OpenURL
Correia, Pedro; Paquete, Luís; Figueira, José Rui Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems. (English) Zbl 1391.90545 Comput. Oper. Res. 89, 82-93 (2018). MSC: 90C29 90C10 90C27 PDF BibTeX XML Cite \textit{P. Correia} et al., Comput. Oper. Res. 89, 82--93 (2018; Zbl 1391.90545) Full Text: DOI OpenURL
Ghaffarinasab, Nader; Atayi, Reza An implicit enumeration algorithm for the hub interdiction median problem with fortification. (English) Zbl 1403.90112 Eur. J. Oper. Res. 267, No. 1, 23-39 (2018). MSC: 90B06 90B10 90B18 91A80 90C11 PDF BibTeX XML Cite \textit{N. Ghaffarinasab} and \textit{R. Atayi}, Eur. J. Oper. Res. 267, No. 1, 23--39 (2018; Zbl 1403.90112) Full Text: DOI OpenURL
Zamani, Reza An evolutionary implicit enumeration procedure for solving the resource-constrained project scheduling problem. (English) Zbl 1386.90066 Int. Trans. Oper. Res. 24, No. 6, 1525-1547 (2017). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{R. Zamani}, Int. Trans. Oper. Res. 24, No. 6, 1525--1547 (2017; Zbl 1386.90066) Full Text: DOI OpenURL
Chen, Juan; Liu, Guijuan; Liu, Jianbo; Feng, Zengzhe Health service center location model based on integer programming. (Chinese. English summary) Zbl 1363.90168 Math. Pract. Theory 46, No. 11, 292-296 (2016). MSC: 90B80 90C10 PDF BibTeX XML Cite \textit{J. Chen} et al., Math. Pract. Theory 46, No. 11, 292--296 (2016; Zbl 1363.90168) OpenURL
Bunin, Gene A. Extended reverse-convex programming: an approximate enumeration approach to global optimization. (English) Zbl 1370.90187 J. Glob. Optim. 65, No. 2, 191-229 (2016). MSC: 90C26 PDF BibTeX XML Cite \textit{G. A. Bunin}, J. Glob. Optim. 65, No. 2, 191--229 (2016; Zbl 1370.90187) Full Text: DOI arXiv OpenURL
Zolda, Michael; Kirner, Raimund Calculating WCET estimates from timed traces. (English) Zbl 1351.68046 Real-Time Syst. 52, No. 1, 38-87 (2016). MSC: 68M20 PDF BibTeX XML Cite \textit{M. Zolda} and \textit{R. Kirner}, Real-Time Syst. 52, No. 1, 38--87 (2016; Zbl 1351.68046) Full Text: DOI OpenURL
Yeh, Wei-Chang A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network. (English) Zbl 1360.90055 Inf. Sci. 297, 283-292 (2015). MSC: 90B10 90B25 PDF BibTeX XML Cite \textit{W.-C. Yeh}, Inf. Sci. 297, 283--292 (2015; Zbl 1360.90055) Full Text: DOI OpenURL
Lin, Cheng-Chang; Lee, Shwu-Chiou Zone pricing for time-definite LTL freight transportation with elastic demand. (English) Zbl 1348.90110 Comput. Oper. Res. 62, 51-60 (2015). MSC: 90B06 90B90 PDF BibTeX XML Cite \textit{C.-C. Lin} and \textit{S.-C. Lee}, Comput. Oper. Res. 62, 51--60 (2015; Zbl 1348.90110) Full Text: DOI OpenURL
Bendali, Fatiha; Mailfert, Jean; Memeri, Djelloul On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm. (English) Zbl 1314.05145 RAIRO, Oper. Res. 49, No. 2, 313-334 (2015). Reviewer: Sandi Klavžar (Ljubljana) MSC: 05C69 05C40 05C85 05C82 05C35 68Q25 68Q17 PDF BibTeX XML Cite \textit{F. Bendali} et al., RAIRO, Oper. Res. 49, No. 2, 313--334 (2015; Zbl 1314.05145) Full Text: DOI Link OpenURL
Lin, Dung-Ying; Ku, Yu-Hsiung An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line. (English) Zbl 1338.90235 Eur. J. Oper. Res. 238, No. 3, 863-875 (2014). MSC: 90B90 90B35 PDF BibTeX XML Cite \textit{D.-Y. Lin} and \textit{Y.-H. Ku}, Eur. J. Oper. Res. 238, No. 3, 863--875 (2014; Zbl 1338.90235) Full Text: DOI OpenURL
Nathanson, Melvyn B. Cantor polynomials for semigroup sectors. (English) Zbl 1290.05010 J. Algebra Appl. 13, No. 5, Article ID 1350165, 14 p. (2014). MSC: 05A15 11B34 11B75 03D15 03D20 PDF BibTeX XML Cite \textit{M. B. Nathanson}, J. Algebra Appl. 13, No. 5, Article ID 1350165, 14 p. (2014; Zbl 1290.05010) Full Text: DOI arXiv OpenURL
Badillo, Liliana; Harris, Charles M. Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees. (English) Zbl 1351.03030 Ann. Pure Appl. Logic 165, No. 9, 1355-1379 (2014). MSC: 03D30 03D15 03D25 03D55 PDF BibTeX XML Cite \textit{L. Badillo} and \textit{C. M. Harris}, Ann. Pure Appl. Logic 165, No. 9, 1355--1379 (2014; Zbl 1351.03030) Full Text: DOI OpenURL
Aparicio Monforte, Ainhoa; Kauers, Manuel Formal Laurent series in several variables. (English) Zbl 1283.13018 Expo. Math. 31, No. 4, 350-367 (2013). Reviewer: Ali Benhissi (Monastir) MSC: 13F25 05A15 PDF BibTeX XML Cite \textit{A. Aparicio Monforte} and \textit{M. Kauers}, Expo. Math. 31, No. 4, 350--367 (2013; Zbl 1283.13018) Full Text: DOI OpenURL
Prince, Mike; Smith, J. Cole; Geunes, Joseph Designing fair 8- and 16-team knockout tournaments. (English) Zbl 1273.90129 IMA J. Manag. Math. 24, No. 3, 321-336 (2013). MSC: 90C11 90C90 PDF BibTeX XML Cite \textit{M. Prince} et al., IMA J. Manag. Math. 24, No. 3, 321--336 (2013; Zbl 1273.90129) Full Text: DOI OpenURL
Li, Zhi-Chun; Lam, William H. K.; Wong, S. C. Optimization of number of operators and allocation of new lines in an oligopolistic transit market. (English) Zbl 1332.91077 Netw. Spat. Econ. 12, No. 1, 1-20 (2012). MSC: 91B54 91A80 90C08 91B52 PDF BibTeX XML Cite \textit{Z.-C. Li} et al., Netw. Spat. Econ. 12, No. 1, 1--20 (2012; Zbl 1332.91077) Full Text: DOI Link OpenURL
Muntingh, Georg Implicit divided differences, little Schröder numbers, and Catalan numbers. (English) Zbl 1292.05031 J. Integer Seq. 15, No. 6, Article 12.6.5, 11 p. (2012). MSC: 05A15 26A24 PDF BibTeX XML Cite \textit{G. Muntingh}, J. Integer Seq. 15, No. 6, Article 12.6.5, 11 p. (2012; Zbl 1292.05031) Full Text: arXiv EMIS OpenURL
Smith, J. Cole; Ulusal, Elif; Hicks, Illya V. A combinatorial optimization algorithm for solving the branchwidth problem. (English) Zbl 1241.90121 Comput. Optim. Appl. 51, No. 3, 1211-1229 (2012). MSC: 90C27 PDF BibTeX XML Cite \textit{J. C. Smith} et al., Comput. Optim. Appl. 51, No. 3, 1211--1229 (2012; Zbl 1241.90121) Full Text: DOI OpenURL
Sokal, Alan D. The leading root of the partial theta function. (English) Zbl 1239.05018 Adv. Math. 229, No. 5, 2603-2621 (2012). MSC: 05A15 05A19 05A20 05A30 05C30 11B65 11P84 30D20 33D15 33D65 PDF BibTeX XML Cite \textit{A. D. Sokal}, Adv. Math. 229, No. 5, 2603--2621 (2012; Zbl 1239.05018) Full Text: DOI arXiv OpenURL
Durand, Arnaud; Strozecki, Yann Enumeration complexity of logical query problems with second-order variables. (English) Zbl 1247.68073 Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12–15, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPIcs – Leibniz International Proceedings in Informatics 12, 189-202, electronic only (2011). MSC: 68P15 03D15 68Q19 PDF BibTeX XML Cite \textit{A. Durand} and \textit{Y. Strozecki}, LIPIcs -- Leibniz Int. Proc. Inform. 12, 189--202 (2011; Zbl 1247.68073) Full Text: DOI Link OpenURL
Caramia, Massimiliano; Dell’Olmo, Paolo Evaluating the effects of the clique selection in exact graph colouring algorithms. (English) Zbl 1234.05079 Int. J. Oper. Res. 11, No. 2, 179-192 (2011). MSC: 05C15 05C35 05C80 05C85 PDF BibTeX XML Cite \textit{M. Caramia} and \textit{P. Dell'Olmo}, Int. J. Oper. Res. 11, No. 2, 179--192 (2011; Zbl 1234.05079) Full Text: DOI OpenURL
Gondran, Michel; Minoux, Michel Graphs and algorithms. 4th revised and enlarged ed. (Graphes et algorithmes.) (French) Zbl 1172.05001 Paris: Editions TEC & DOC (ISBN 978-2-7430-1035-5/hbk). xxxi, 784 p. (2009). Reviewer: Reinhardt Euler (Brest) MSC: 05-01 68-01 90-01 05C85 90C10 PDF BibTeX XML Cite \textit{M. Gondran} and \textit{M. Minoux}, Graphes et algorithmes. 4th revised and enlarged ed. Paris: Editions TEC \& DOC (2009; Zbl 1172.05001) OpenURL
Chen, Jiaqiong; Askin, Ronald G. Project selection, scheduling and resource allocation with time dependent returns. (English) Zbl 1152.90483 Eur. J. Oper. Res. 193, No. 1, 23-34 (2009). MSC: 90B50 90B35 91B32 PDF BibTeX XML Cite \textit{J. Chen} and \textit{R. G. Askin}, Eur. J. Oper. Res. 193, No. 1, 23--34 (2009; Zbl 1152.90483) Full Text: DOI OpenURL
Rönnberg, Elina; Larsson, Torbjörn Column generation in the integral simplex method. (English) Zbl 1180.90202 Eur. J. Oper. Res. 192, No. 1, 333-342 (2009). MSC: 90C10 PDF BibTeX XML Cite \textit{E. Rönnberg} and \textit{T. Larsson}, Eur. J. Oper. Res. 192, No. 1, 333--342 (2009; Zbl 1180.90202) Full Text: DOI Link OpenURL
Miao, Y.; Khan, S. H. Strong convergence of an implicit iterative algorithm in Hilbert spaces. (English) Zbl 1166.05303 Commun. Math. Anal. 4, No. 2, 54-60 (2008). MSC: 05C38 15A15 05A15 15A18 PDF BibTeX XML Cite \textit{Y. Miao} and \textit{S. H. Khan}, Commun. Math. Anal. 4, No. 2, 54--60 (2008; Zbl 1166.05303) OpenURL
Vimont, Yannick; Boussier, Sylvain; Vasquez, Michel Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. (English) Zbl 1138.90014 J. Comb. Optim. 15, No. 2, 165-178 (2008). MSC: 90C09 PDF BibTeX XML Cite \textit{Y. Vimont} et al., J. Comb. Optim. 15, No. 2, 165--178 (2008; Zbl 1138.90014) Full Text: DOI OpenURL
Cameron, Frank Enumeration results for Runge-Kutta methods for index 2 DAEs. (English) Zbl 1131.65070 J. Comput. Appl. Math. 213, No. 1, 294-299 (2008). MSC: 65L80 34A09 65L06 PDF BibTeX XML Cite \textit{F. Cameron}, J. Comput. Appl. Math. 213, No. 1, 294--299 (2008; Zbl 1131.65070) Full Text: DOI OpenURL
Klose, Andreas Algorithms for solving the single-sink fixed-charge transportation problem. (English) Zbl 1139.90008 Comput. Oper. Res. 35, No. 6, 2079-2092 (2008). MSC: 90B06 90C39 90C57 PDF BibTeX XML Cite \textit{A. Klose}, Comput. Oper. Res. 35, No. 6, 2079--2092 (2008; Zbl 1139.90008) Full Text: DOI OpenURL
Durand, Arnaud; Grandjean, Etienne First-order queries on structures of bounded degree are computable with constant delay. (English) Zbl 1367.68086 ACM Trans. Comput. Log. 8, No. 4, Article No. 21, 19 p. (2007). MSC: 68P15 03B70 03C10 03D15 68Q15 68Q25 68Q60 PDF BibTeX XML Cite \textit{A. Durand} and \textit{E. Grandjean}, ACM Trans. Comput. Log. 8, No. 4, Article No. 21, 19 p. (2007; Zbl 1367.68086) Full Text: DOI OpenURL
Wang, J.; Li, Duan; Sun, Xiaoling A revised Taha’s algorithm for polynomial 0-1 programming. (English) Zbl 1172.90444 Optimization 56, No. 5-6, 699-713 (2007). MSC: 90C09 90C10 65K05 PDF BibTeX XML Cite \textit{J. Wang} et al., Optimization 56, No. 5--6, 699--713 (2007; Zbl 1172.90444) Full Text: DOI OpenURL
Amen, Matthias Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds. (English) Zbl 1083.90012 Eur. J. Oper. Res. 168, No. 3, 747-770 (2006). MSC: 90B30 90B80 PDF BibTeX XML Cite \textit{M. Amen}, Eur. J. Oper. Res. 168, No. 3, 747--770 (2006; Zbl 1083.90012) Full Text: DOI OpenURL
Bao, Xinli; Bozdogan, Hamparsum; Chatpattanan, Vuttichai; Gilbert, Kenneth An implicit enumeration algorithm for mining high dimensional data. (English) Zbl 1100.68017 Int. J. Oper. Res. 1, No. 1-2, 123-144 (2005). MSC: 68P15 68P20 68T05 PDF BibTeX XML Cite \textit{X. Bao} et al., Int. J. Oper. Res. 1, No. 1--2, 123--144 (2005; Zbl 1100.68017) OpenURL
Bouguima, S. M.; Fekih, S. Multiplicity results for an elliptic system. (English) Zbl 1339.05203 Akça, Haydar (ed.) et al., Proceedings of the international conference: 2004 – Dynamical systems and applications. Papers based on talks given at the conference, Antalya, Turkey, July 5–10, 2004. Dhahran: King Fahd University of Petroleum and Minerals, Department of Mathematical Sciences. 189-192, electronic only (2004). MSC: 05C38 15A15 05A15 15A18 PDF BibTeX XML Cite \textit{S. M. Bouguima} and \textit{S. Fekih}, in: Proceedings of the international conference: 2004 -- Dynamical systems and applications. Papers based on talks given at the conference, Antalya, Turkey, July 5--10, 2004. Dhahran: King Fahd University of Petroleum and Minerals, Department of Mathematical Sciences. 189--192 (2004; Zbl 1339.05203) Full Text: Link OpenURL
Brusco, Michael J.; Cradit, J. Dennis Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices. (English) Zbl 1059.05082 J. Math. Psychol. 48, No. 5, 301-309 (2004). MSC: 05C70 05C15 68R10 PDF BibTeX XML Cite \textit{M. J. Brusco} and \textit{J. D. Cradit}, J. Math. Psychol. 48, No. 5, 301--309 (2004; Zbl 1059.05082) Full Text: DOI OpenURL
Lins, Lauro; Lins, Sóstenes; Melo, Sílvio Phorma: perfectly hashable order restricted multidimensional arrays. (English) Zbl 1064.05002 Discrete Appl. Math. 141, No. 1-3, 209-223 (2004). MSC: 05A05 05C90 06F99 PDF BibTeX XML Cite \textit{L. Lins} et al., Discrete Appl. Math. 141, No. 1--3, 209--223 (2004; Zbl 1064.05002) Full Text: DOI OpenURL
Yamada, Takeo Max-min optimization of the multiple knapsack problem: an implicit enumeration approach. (English) Zbl 1070.90535 Kozan, Erhan (ed.) et al., Operations research/management science at work. Boston, MA: Kluwer Academic Publishers (ISBN 0-7923-7588-2/hbk). Int. Ser. Oper. Res. Manag. Sci. 43, 351-362 (2002). MSC: 90C27 90C47 PDF BibTeX XML Cite \textit{T. Yamada}, Int. Ser. Oper. Res. Manag. Sci. 43, 351--362 (2002; Zbl 1070.90535) OpenURL
Ogihara, Mitsunori; Toda, Seinosuke The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs. (English) Zbl 0999.68088 Sgall, Jiří(ed.) et al., Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2136, 585-597 (2001). MSC: 68Q25 03D15 05C30 PDF BibTeX XML Cite \textit{M. Ogihara} and \textit{S. Toda}, Lect. Notes Comput. Sci. 2136, 585--597 (2001; Zbl 0999.68088) Full Text: Link OpenURL
Wu, Qimiao The branch and bound of implicit enumeration method solution (BIP). (Chinese. English summary) Zbl 1005.90558 J. Shaoxing Coll. Arts Sci., Nat. Sci. 21, No. 2, 18-21 (2001). MSC: 90C57 PDF BibTeX XML Cite \textit{Q. Wu}, J. Shaoxing Coll. Arts Sci., Nat. Sci. 21, No. 2, 18--21 (2001; Zbl 1005.90558) OpenURL
Audet, Charles; Hansen, Pierre; Jaumard, Brigitte; Savard, Gilles Enumeration of all extreme equilibria of bimatrix games. (English) Zbl 0996.91004 SIAM J. Sci. Comput. 23, No. 1, 323-338 (2001). MSC: 91A10 91A05 90C31 PDF BibTeX XML Cite \textit{C. Audet} et al., SIAM J. Sci. Comput. 23, No. 1, 323--338 (2001; Zbl 0996.91004) Full Text: DOI OpenURL
Agnetis, A.; Smriglio, S. Optimal assignment of high multiplicity flight plans to dispatchers. (English) Zbl 1012.90025 Nav. Res. Logist. 47, No. 5, 359-376 (2000). MSC: 90B80 90B35 PDF BibTeX XML Cite \textit{A. Agnetis} and \textit{S. Smriglio}, Nav. Res. Logist. 47, No. 5, 359--376 (2000; Zbl 1012.90025) Full Text: DOI OpenURL
Bankston, James Boyd; Harnett, R. Michael An heuristic algorithm for a multi-product, single machine capacitated production scheduling problem. (English) Zbl 0999.90015 Comput. Oper. Res. 27, No. 1, 77-92 (2000). Reviewer: I.N.Lushchakova (Minsk) MSC: 90B30 90B90 90C59 PDF BibTeX XML Cite \textit{J. B. Bankston} and \textit{R. M. Harnett}, Comput. Oper. Res. 27, No. 1, 77--92 (2000; Zbl 0999.90015) Full Text: DOI OpenURL
Odifreddi, P. G. Classical recursion theory. Vol. II. (English) Zbl 0931.03057 Studies in Logic and the Foundations of Mathematics. 143. Amsterdam: Elsevier. xvi, 949 p. (1999). Reviewer: C.Calude (Auckland) MSC: 03Dxx 03-02 03-01 03-00 03D15 03D20 03D25 03D28 03D30 03D55 68Q15 PDF BibTeX XML Cite \textit{P. G. Odifreddi}, Classical recursion theory. Vol. II. Amsterdam: Elsevier (1999; Zbl 0931.03057) OpenURL
Niggl, Karl-Heinz A restricted computation model on Scott domains and its partial primitive recursive functionals. (English) Zbl 0924.03088 Arch. Math. Logic 37, No. 7, 443-481 (1998). Reviewer: U.Schöning (Ulm) MSC: 03D65 03D20 03D15 68Q05 68Q10 68Q15 68Q55 PDF BibTeX XML Cite \textit{K.-H. Niggl}, Arch. Math. Logic 37, No. 7, 443--481 (1998; Zbl 0924.03088) Full Text: DOI OpenURL
Sherali, H. D.; Krishnamurthy, R. S.; Al-Khayyal, F. A. Enumeration approach for linear complementarity problems based on a reformulation-linearization technique. (English) Zbl 0911.90328 J. Optimization Theory Appl. 99, No. 2, 481-507 (1998). MSC: 90C33 90C11 PDF BibTeX XML Cite \textit{H. D. Sherali} et al., J. Optim. Theory Appl. 99, No. 2, 481--507 (1998; Zbl 0911.90328) Full Text: DOI OpenURL
Chvátal, V. Resolution search. (English) Zbl 0869.90055 Discrete Appl. Math. 73, No. 1, 81-99 (1997). MSC: 90C11 90C09 PDF BibTeX XML Cite \textit{V. Chvátal}, Discrete Appl. Math. 73, No. 1, 81--99 (1997; Zbl 0869.90055) Full Text: DOI Link OpenURL
Drmota, Michael Systems of functional equations. (English) Zbl 0869.39010 Random Struct. Algorithms 10, No. 1-2, 103-124 (1997). Reviewer: J.Aczel (Waterloo/Ontario) MSC: 39B62 41A60 41A63 05A15 26B10 05C30 68Q45 39B32 41A58 PDF BibTeX XML Cite \textit{M. Drmota}, Random Struct. Algorithms 10, No. 1--2, 103--124 (1997; Zbl 0869.39010) Full Text: DOI OpenURL
Davydov, G. V.; Davydova, I. M. Number representation of satisfiability. (English. Russian original) Zbl 0946.03014 J. Math. Sci., New York 98, No. 4, 464-478 (2000); translation from Zap. Nauchn. Semin. POMI 241, 72-96 (1997). MSC: 03B35 03B05 90C27 PDF BibTeX XML Full Text: DOI OpenURL
Chen, Senfa; Deng, Xuejun; Wang, Wei Optimization of selecting measuremental links for estimating the OD matrix. (Chinese. English summary) Zbl 0941.90049 Acta Autom. Sin. 23, No. 6, 831-834 (1997). MSC: 90B99 PDF BibTeX XML Cite \textit{S. Chen} et al., Acta Autom. Sin. 23, No. 6, 831--834 (1997; Zbl 0941.90049) OpenURL
Popescu, Mihai Florin Lipschitzian effort measures on subclasses of implicit enumeration algorithms. (Romanian. English summary) Zbl 0893.90134 Stud. Cercet. Mat. 49, No. 3-4, 245-256 (1997). MSC: 90C10 PDF BibTeX XML Cite \textit{M. F. Popescu}, Stud. Cercet. Mat. 49, No. 3--4, 245--256 (1997; Zbl 0893.90134) OpenURL
Copestake, Kate On nondeterminism, enumeration reducibility and polynomial bounds. (English) Zbl 0882.03042 Math. Log. Q. 43, No. 3, 287-310 (1997). Reviewer: Tao Renji (Beijing) MSC: 03D30 03D10 03D15 68Q05 68Q10 68Q15 PDF BibTeX XML Cite \textit{K. Copestake}, Math. Log. Q. 43, No. 3, 287--310 (1997; Zbl 0882.03042) Full Text: DOI OpenURL
Chand, Suresh; Traub, Rodney; Uzsoy, Reha Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm. (English) Zbl 0868.90062 Nav. Res. Logist. 43, No. 5, 709-719 (1996). MSC: 90B35 PDF BibTeX XML Cite \textit{S. Chand} et al., Nav. Res. Logist. 43, No. 5, 709--719 (1996; Zbl 0868.90062) Full Text: DOI OpenURL
Al-Sultan, K. S.; Hussain, M. F.; Nizami, J. S. A genetic algorithm for the set covering problem. (English) Zbl 0863.90114 J. Oper. Res. Soc. 47, No. 5, 702-709 (1996). MSC: 90C09 68T05 PDF BibTeX XML Cite \textit{K. S. Al-Sultan} et al., J. Oper. Res. Soc. 47, No. 5, 702--709 (1996; Zbl 0863.90114) Full Text: DOI OpenURL
Bisschop, J. J.; Fourer, Robert New constructs for the description of combinatorial optimization problems in algebraic modeling languages. (English) Zbl 0852.90114 Comput. Optim. Appl. 6, No. 1, 83-116 (1996). MSC: 90C27 68N15 90C10 PDF BibTeX XML Cite \textit{J. J. Bisschop} and \textit{R. Fourer}, Comput. Optim. Appl. 6, No. 1, 83--116 (1996; Zbl 0852.90114) Full Text: DOI OpenURL
Fréville, Arnaud; Plateau, Gérard The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool. (English) Zbl 0870.90084 J. Heuristics 2, No. 2, 147-167 (1996). MSC: 90C09 PDF BibTeX XML Cite \textit{A. Fréville} and \textit{G. Plateau}, J. Heuristics 2, No. 2, 147--167 (1996; Zbl 0870.90084) Full Text: DOI OpenURL
Karabati, Selcuk; Kouvelis, Panagiotis; Yu, Gang The discrete resource allocation problem in flow lines. (English) Zbl 0861.90074 Manage. Sci. 41, No. 9, 1417-1430 (1995). MSC: 90B35 90C10 PDF BibTeX XML Cite \textit{S. Karabati} et al., Manage. Sci. 41, No. 9, 1417--1430 (1995; Zbl 0861.90074) Full Text: DOI Link OpenURL
Popescu, Mihai Florin Efficiency of implicit enumeration algorithms with respect to the enumeration function. (Romanian. English summary) Zbl 0840.90105 Stud. Cercet. Mat. 47, No. 2, 205-216 (1995). MSC: 90C10 PDF BibTeX XML Cite \textit{M. F. Popescu}, Stud. Cercet. Mat. 47, No. 2, 205--216 (1995; Zbl 0840.90105) OpenURL
Marcotte, P.; Marquis, G.; Savard, G. A new implicit enumeration scheme for the discriminant analysis problem. (English) Zbl 0827.90137 Comput. Oper. Res. 22, No. 6, 625-639 (1995). MSC: 90C90 62H30 90C11 PDF BibTeX XML Cite \textit{P. Marcotte} et al., Comput. Oper. Res. 22, No. 6, 625--639 (1995; Zbl 0827.90137) Full Text: DOI OpenURL
Fayard, Didier; Plateau, Gérard An exact algorithm for the 0-1 collapsing knapsack problem. (English) Zbl 0806.90089 Discrete Appl. Math. 49, No. 1-3, 175-187 (1994). MSC: 90C09 PDF BibTeX XML Cite \textit{D. Fayard} and \textit{G. Plateau}, Discrete Appl. Math. 49, No. 1--3, 175--187 (1994; Zbl 0806.90089) Full Text: DOI OpenURL
Van den Bussche, Jan On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula. (English) Zbl 0814.03004 Acta Inf. 30, No. 5, 489-502 (1993). Reviewer: D.Skvortsov (Moskva) MSC: 03B10 03D15 68Q25 68P15 PDF BibTeX XML Cite \textit{J. Van den Bussche}, Acta Inf. 30, No. 5, 489--502 (1993; Zbl 0814.03004) Full Text: DOI OpenURL
Diaby, Moustapha Implicit enumeration for the pure integer 0/1 minimax programming problem. (English) Zbl 0791.90035 Oper. Res. 41, No. 6, 1172-1176 (1993). MSC: 90C09 90C11 90B80 PDF BibTeX XML Cite \textit{M. Diaby}, Oper. Res. 41, No. 6, 1172--1176 (1993; Zbl 0791.90035) Full Text: DOI OpenURL
Mason, Francesco; Tomasin, Elena Moretti A model for the assignment of candidates to constituencies in a mixed election system. (English) Zbl 0782.90023 Eur. J. Oper. Res. 70, No. 2, 254-262 (1993). MSC: 91B12 90B80 PDF BibTeX XML Cite \textit{F. Mason} and \textit{E. M. Tomasin}, Eur. J. Oper. Res. 70, No. 2, 254--262 (1993; Zbl 0782.90023) Full Text: DOI OpenURL
Adams, Warren P.; Sherali, Hanif D. Mixed-integer bilinear programming problems. (English) Zbl 0801.90085 Math. Program. 59, No. 3 (A), 279-305 (1993). Reviewer: H.T.Lau (Verdun / Quebec) MSC: 90C11 PDF BibTeX XML Cite \textit{W. P. Adams} and \textit{H. D. Sherali}, Math. Program. 59, No. 3 (A), 279--305 (1993; Zbl 0801.90085) Full Text: DOI OpenURL
Popescu, Mihai Florin Efficiency of implicit enumeration algorithms and the power of the skip functions. (Romanian. English summary) Zbl 0800.68363 Stud. Cercet. Mat. 45, No. 2, 161-173 (1993). MSC: 68P10 68W10 PDF BibTeX XML Cite \textit{M. F. Popescu}, Stud. Cercet. Mat. 45, No. 2, 161--173 (1993; Zbl 0800.68363) OpenURL
Leon, V. Jorge; Wu, S. David On scheduling with ready-times, due-dates and vacations. (English) Zbl 0764.90049 Nav. Res. Logist. 39, No. 1, 53-65 (1992). Reviewer: G.Schulz (Magdeburg) MSC: 90B35 90-08 PDF BibTeX XML Cite \textit{V. J. Leon} and \textit{S. D. Wu}, Nav. Res. Logist. 39, No. 1, 53--65 (1992; Zbl 0764.90049) Full Text: DOI OpenURL
Bard, Jonathan F.; Moore, James T. An algorithm for the discrete bilevel programming problem. (English) Zbl 0751.90111 Nav. Res. Logist. 39, No. 3, 419-435 (1992). Reviewer: J.F.Bard MSC: 91A65 90-08 90C10 90C05 PDF BibTeX XML Cite \textit{J. F. Bard} and \textit{J. T. Moore}, Nav. Res. Logist. 39, No. 3, 419--435 (1992; Zbl 0751.90111) Full Text: DOI OpenURL
Erkut, Erhan; Neuman, Susan Comparison or four models for dispersing facilities. (English) Zbl 0732.90054 INFOR 29, No. 2, 68-86 (1991). MSC: 90B80 90-08 90C90 PDF BibTeX XML Cite \textit{E. Erkut} and \textit{S. Neuman}, INFOR 29, No. 2, 68--86 (1991; Zbl 0732.90054) Full Text: DOI OpenURL
Klein, Gary; Aronson, Jay E. Optimal clustering: A model and method. (English) Zbl 0721.92031 Nav. Res. Logist. 38, No. 3, 447-461 (1991). MSC: 91C20 90C90 90C11 PDF BibTeX XML Cite \textit{G. Klein} and \textit{J. E. Aronson}, Nav. Res. Logist. 38, No. 3, 447--461 (1991; Zbl 0721.92031) Full Text: DOI OpenURL
Ašić, Miroslav D.; Kovačević-Vujčić, Vera V. An implicit enumeration method for global optimization problems. (English) Zbl 0721.65037 Comput. Math. Appl. 21, No. 6-7, 191-201 (1991). Reviewer: H.T.Lau (Verdun/Quebec) MSC: 65K05 90C30 90C25 PDF BibTeX XML Cite \textit{M. D. Ašić} and \textit{V. V. Kovačević-Vujčić}, Comput. Math. Appl. 21, No. 6--7, 191--201 (1991; Zbl 0721.65037) Full Text: DOI OpenURL
Moore, James T.; Bard, Jonathan F. The mixed integer linear bilevel programming problem. (English) Zbl 0723.90090 Oper. Res. 38, No. 5, 911-921 (1990). MSC: 91A05 90C11 90-08 91A65 PDF BibTeX XML Cite \textit{J. T. Moore} and \textit{J. F. Bard}, Oper. Res. 38, No. 5, 911--921 (1990; Zbl 0723.90090) Full Text: DOI OpenURL
Jenkins, Larry Parametric methods in integer linear programming. (English) Zbl 0718.90088 Ann. Oper. Res. 27, 77-96 (1990). Reviewer: J.Piehler (Merseburg) MSC: 90C31 90C10 90-02 90C05 90-08 PDF BibTeX XML Cite \textit{L. Jenkins}, Ann. Oper. Res. 27, 77--96 (1990; Zbl 0718.90088) Full Text: DOI OpenURL
Friden, C.; Hertz, A.; de Werra, Dominique TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph. (English) Zbl 0713.90087 Comput. Oper. Res. 17, No. 5, 437-445 (1990). Reviewer: H.-J.Presia (Ilmenau) MSC: 90C35 90-08 05C75 90C27 90C06 65K05 PDF BibTeX XML Cite \textit{C. Friden} et al., Comput. Oper. Res. 17, No. 5, 437--445 (1990; Zbl 0713.90087) Full Text: DOI OpenURL
Sofianopoulou, Stella Optimum allocation of processes in a distributed environment: A process- to-process approach. (English) Zbl 0707.90033 J. Oper. Res. Soc. 41, No. 4, 329-337 (1990). MSC: 90B18 68M10 90C09 90C90 90-08 90C05 65K05 PDF BibTeX XML Cite \textit{S. Sofianopoulou}, J. Oper. Res. Soc. 41, No. 4, 329--337 (1990; Zbl 0707.90033) Full Text: DOI OpenURL
Serafini, Paolo; Ukovich, Walter A mathematical model for periodic scheduling problems. (English) Zbl 0676.90030 SIAM J. Discrete Math. 2, No. 4, 550-581 (1989). MSC: 90B35 90C35 68Q25 90B10 PDF BibTeX XML Cite \textit{P. Serafini} and \textit{W. Ukovich}, SIAM J. Discrete Math. 2, No. 4, 550--581 (1989; Zbl 0676.90030) Full Text: DOI OpenURL
Raman, Narayan; Rachamadugu, Ram V.; Talbot, F. Brian Real-time scheduling of an automated manufacturing center. (English) Zbl 0665.90047 Eur. J. Oper. Res. 40, No. 2, 222-242 (1989). MSC: 90B35 90B30 PDF BibTeX XML Cite \textit{N. Raman} et al., Eur. J. Oper. Res. 40, No. 2, 222--242 (1989; Zbl 0665.90047) Full Text: DOI Link OpenURL
Barceló, Jaume; Fernández, Eduardo \(0\)-\(1\) knapsack problems with a side constraint. (Problemas de knapsack 0-1 con una restricción adicional.) (Spanish) Zbl 1167.90592 Qüestiió 12, No. 2, 175-208 (1988). MSC: 90C10 PDF BibTeX XML Cite \textit{J. Barceló} and \textit{E. Fernández}, Qüestiió 12, No. 2, 175--208 (1988; Zbl 1167.90592) Full Text: EuDML Link OpenURL
Groppen, V. O. Principles for the optimization of combinatorial procedures. Ed. by T. K. Shulikina. (Принципы оптимизации комбинаторых процедур.) (Russian) Zbl 0738.90062 Rostov-na-Donu: Izdatel’stvo Rostovskogo Universitete. 198 p. (1988). Reviewer: Nicola I. Yanev (Sofia) MSC: 90C27 90-02 90-08 90C10 90C35 90C57 90C60 PDF BibTeX XML Cite \textit{V. O. Groppen}, Принципы оптимизации комбинаторых процедур (Russian). Ed. by T. K. Shulikina. Rostov-na-Donu: Izdatel'stvo Rostovskogo Universiteta (1988; Zbl 0738.90062) OpenURL
Madu, Christian N. A closed queueing maintenance network with two repair centres. (English) Zbl 0656.90040 J. Oper. Res. Soc. 39, No. 10, 959-967 (1988). MSC: 90B25 60K20 90B22 60K25 PDF BibTeX XML Cite \textit{C. N. Madu}, J. Oper. Res. Soc. 39, No. 10, 959--967 (1988; Zbl 0656.90040) Full Text: DOI OpenURL
Gendreau, Michel; Picard, Jean-Claude; Zubieta, Lourdes An efficient implicit enumeration algorithm for the maximum clique problem. (English) Zbl 0648.90083 Advances in optimization and control, Proc. Conf., Optimization Days, Montreal/Can. 1986, Lect. Notes Econ. Math. Syst. 302, 79-91 (1988). MSC: 90C35 PDF BibTeX XML OpenURL
Fiala, Petr; Kurtevová, Sylva; Vopálková, Eliška Solution approaches to multicriteria single-machine scheduling problems. (English) Zbl 0648.90044 Ekon.-Mat. Obz. 24, No. 3, 320-333 (1988). MSC: 90B35 90C09 90C31 PDF BibTeX XML Cite \textit{P. Fiala} et al., Ekon.-Mat. Obz. 24, No. 3, 320--333 (1988; Zbl 0648.90044) OpenURL
Wilson, George R.; Jain, Hemant K. An approach to postoptimality and sensitivity analysis of zero-one goal programs. (English) Zbl 0645.90055 Nav. Res. Logist. 35, No. 1, 73-84 (1988). Reviewer: J.Terno MSC: 90C10 90C31 65K05 PDF BibTeX XML Cite \textit{G. R. Wilson} and \textit{H. K. Jain}, Nav. Res. Logist. 35, No. 1, 73--84 (1988; Zbl 0645.90055) Full Text: DOI OpenURL
Forgó, Ferenc Nonconvex programming. (Based on the first part of the Hungarian “Nemkonvex és diszkrét programozás”, Közgazdasági és Jogi Könyvkiadó, Budapest). (English) Zbl 0655.90046 Budapest: Akadémiai Kiadó. 188 p.; DM 45.00 (1988). Reviewer: H.Tuy MSC: 90C30 49M37 90-02 PDF BibTeX XML Cite \textit{F. Forgó}, Nonconvex programming. (Based on the first part of the Hungarian ``Nemkonvex és diszkrét programozás'', Közgazdasági és Jogi Könyvkiadó, Budapest). Budapest: Akadémiai Kiadó (1988; Zbl 0655.90046) OpenURL
Skorin-Kapov, Jadranka; Granot, Frieda Non-linear integer programming: Sensitivity analysis for branch and bound. (English) Zbl 0637.90066 Oper. Res. Lett. 6, 269-280 (1987). MSC: 90C10 90C30 90C31 PDF BibTeX XML Cite \textit{J. Skorin-Kapov} and \textit{F. Granot}, Oper. Res. Lett. 6, 269--280 (1987; Zbl 0637.90066) Full Text: DOI OpenURL
Wolter, H. Lösungsverfahren für eine Klasse diskreter Optimierungsaufgaben spezieller Struktur. (Solution methods for a class of specially structured optimization problems). (German) Zbl 0628.90052 Optimization 18, 561-572 (1987). MSC: 90C10 90C31 PDF BibTeX XML Cite \textit{H. Wolter}, Optimization 18, 561--572 (1987; Zbl 0628.90052) Full Text: DOI OpenURL
Martinec, Ivan An algorithm for \(\epsilon\)-optimal solution of discrete location problem. (Czech. English summary) Zbl 0627.90031 Ekon.-Mat. Obz. 23, 332-348 (1987). MSC: 90B05 90C10 PDF BibTeX XML Cite \textit{I. Martinec}, Ekon.-Mat. Obz. 23, 332--348 (1987; Zbl 0627.90031) OpenURL
Al-Khayyal, Faiz A. An implicit enumeration procedure for the general linear complementarity problem. (English) Zbl 0623.90079 Math. Program. Study 31, 1-20 (1987). MSC: 90C33 90C20 65K05 PDF BibTeX XML Cite \textit{F. A. Al-Khayyal}, Math. Program. Study 31, 1--20 (1987; Zbl 0623.90079) Full Text: DOI OpenURL
Saltzman, Matthew J.; Baybars, Ilker A two-process implicit enumeration algorithm for the simple assembly line balancing problem. (English) Zbl 0622.90043 Eur. J. Oper. Res. 32, 118-129 (1987). MSC: 90B35 90C10 90B30 PDF BibTeX XML Cite \textit{M. J. Saltzman} and \textit{I. Baybars}, Eur. J. Oper. Res. 32, 118--129 (1987; Zbl 0622.90043) Full Text: DOI OpenURL
Ozan, Turgut Applied mathematical programming for engineering and production management. (English) Zbl 0708.90091 A Reston Book. Englewood Cliffs, NJ: Prentice-Hall. xv, 638 p. (1986). MSC: 90-01 90C90 90C05 90C08 90C10 90C29 90B35 90B50 91B32 90B30 PDF BibTeX XML Cite \textit{T. Ozan}, Applied mathematical programming for engineering and production management. Englewood Cliffs, NJ: Prentice-Hall (1986; Zbl 0708.90091) OpenURL
Lavallée, Ivan Contribution à l’algorithmique parallèle et distribuée. Application à l’optimisation combinatoire. (Thèse). (Contribution to parallel and distributed algorithms. Application to combinatorial optimization). (French) Zbl 0635.68022 L’Université Paris XI. 314 p. (1986). MSC: 68W99 68Q25 90C27 68R99 PDF BibTeX XML OpenURL
Kabulov, A. V.; Bajzhumanov, A. A. Local methods for solving systems of Boolean equations. (Russian) Zbl 0624.90069 Dokl. Akad. Nauk UzSSR 1986, No. 3, 3-5 (1986). Reviewer: I.G.Belinskaya MSC: 90C09 PDF BibTeX XML Cite \textit{A. V. Kabulov} and \textit{A. A. Bajzhumanov}, Dokl. Akad. Nauk UzSSR 1986, No. 3, 3--5 (1986; Zbl 0624.90069) OpenURL
Adams, Warren P.; Sherali, Hanif D. A tight linearization and an algorithm for zero-one quadratic programming problems. (English) Zbl 0623.90054 Manage. Sci. 32, 1274-1290 (1986). Reviewer: P.Stavre MSC: 90C09 90C20 65K05 90C90 90C11 90C10 PDF BibTeX XML Cite \textit{W. P. Adams} and \textit{H. D. Sherali}, Manage. Sci. 32, 1274--1290 (1986; Zbl 0623.90054) Full Text: DOI OpenURL
Balas, Egon; Yu, Changsung Finding a maximum clique in an arbitrary graph. (English) Zbl 0604.05024 SIAM J. Comput. 15, 1054-1068 (1986). MSC: 05C35 68R10 05-04 PDF BibTeX XML Cite \textit{E. Balas} and \textit{C. Yu}, SIAM J. Comput. 15, 1054--1068 (1986; Zbl 0604.05024) Full Text: DOI OpenURL
Mathur, Kamlesh; Salkin, Harvey M.; Mohanty, Bidhu B. A note on a general nonlinear knapsack problem. (English) Zbl 0601.90114 Oper. Res. Lett. 5, 79-81 (1986). Reviewer: Tian Feng MSC: 90C10 PDF BibTeX XML Cite \textit{K. Mathur} et al., Oper. Res. Lett. 5, 79--81 (1986; Zbl 0601.90114) Full Text: DOI OpenURL
Körkel, Manfred Clustering algorithms for the within-class scatter criterion with a restricted number of elements per cluster. (English) Zbl 0587.62129 Classification as a tool of research, Proc. 9th Annu. Meet. Classif. Soc. F.R.G., Karlsruhe/Ger. 1985, 241-247 (1986). MSC: 62H30 PDF BibTeX XML OpenURL