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
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
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
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
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
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
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
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
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
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
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
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
Young, Ming Huei; Muroga, Saburo Minimal covering problem and PLA minimization. (English) Zbl 0599.94017 Int. J. Comput. Inform. Sci. 14, 337-364 (1985). MSC: 94C10 90C10 PDF BibTeX XML Cite \textit{M. H. Young} and \textit{S. Muroga}, Int. J. Comput. Inform. Sci. 14, 337--364 (1985; Zbl 0599.94017) Full Text: DOI OpenURL
Campello, R. E. Updating a hybrid algorithm for set partitioning problems. (English) Zbl 0599.90083 Mat. Apl. Comput. 4, 75-90 (1985). Reviewer: M.Frumkin MSC: 90C09 65K05 PDF BibTeX XML Cite \textit{R. E. Campello}, Mat. Apl. Comput. 4, 75--90 (1985; Zbl 0599.90083) OpenURL
Narula, Subhash C.; Wellington, John F. A branch and bound procedure for selection of variables in minimax regression. (English) Zbl 0583.62062 SIAM J. Sci. Stat. Comput. 6, 573-581 (1985). Reviewer: L.F.Pau MSC: 62J05 62J99 90C08 62C12 PDF BibTeX XML Cite \textit{S. C. Narula} and \textit{J. F. Wellington}, SIAM J. Sci. Stat. Comput. 6, 573--581 (1985; Zbl 0583.62062) Full Text: DOI OpenURL
Grabowski, Józef; Skubalska, Ewa Optimization of the transportation network structure with respect to the flow costs. (Polish. Russian, English summaries) Zbl 0576.90029 Arch. Autom. Telemech. 30, 3-21 (1985). MSC: 90B10 90C08 PDF BibTeX XML Cite \textit{J. Grabowski} and \textit{E. Skubalska}, Arch. Autom. Telemech. 30, 3--21 (1985; Zbl 0576.90029) OpenURL
Boronin, A. B.; Pershin, O. Yu. Decomposition of a network into minimally connected parts. (English. Russian original) Zbl 0553.90102 Autom. Remote Control 45, No. 4, 519-528 (1984); translation from Avtom. Telemekh. 1984, No. 4, 128-138 (1984). MSC: 90C35 90B10 65K05 90C10 PDF BibTeX XML Cite \textit{A. B. Boronin} and \textit{O. Yu. Pershin}, Autom. Remote Control 45, No. 4, 519--528 (1984; Zbl 0553.90102); translation from Avtom. Telemekh. 1984, No. 4, 128--138 (1984) OpenURL
Mehta, Cyrus R.; Patel, Nitin R. A network algorithm for performing Fisher’s exact test in r\(\times c\) contingency tables. (English) Zbl 0545.62039 J. Am. Stat. Assoc. 78, 427-434 (1983). Reviewer: K.T.Fang MSC: 62H17 65C99 PDF BibTeX XML Cite \textit{C. R. Mehta} and \textit{N. R. Patel}, J. Am. Stat. Assoc. 78, 427--434 (1983; Zbl 0545.62039) Full Text: DOI OpenURL
Kiziltan, Gülseren; Yucaoglu, Erkut An algorithm for multiobjective zero-one linear programming. (English) Zbl 0542.90065 Manage. Sci. 29, 1444-1453 (1983). Reviewer: H.Hamacher MSC: 90C09 90C31 65K05 90C05 PDF BibTeX XML Cite \textit{G. Kiziltan} and \textit{E. Yucaoglu}, Manage. Sci. 29, 1444--1453 (1983; Zbl 0542.90065) Full Text: DOI OpenURL
Hennet, J. C. Comparaison de deux méthodes de résolution d’un problème combinatoire quadratique. (French) Zbl 0525.90073 RAIRO, Rech. Opér. 17, 285-295 (1983). MSC: 90C10 90C20 90C39 PDF BibTeX XML Cite \textit{J. C. Hennet}, RAIRO, Rech. Opér. 17, 285--295 (1983; Zbl 0525.90073) Full Text: DOI EuDML OpenURL
Martinec, Ivan; Strnadova, Vlasta An exact algorithm for a class of fixed-cost transportation problems. (English) Zbl 0521.90082 Ehkon.-Mat. Obz. 19, 337-353 (1983). MSC: 90C11 90C08 65K05 68Q25 PDF BibTeX XML OpenURL
Aneja, Y. P.; Aggarwal, V.; Nair, K. P. K. Shortest chain subject to side constraints. (English) Zbl 0516.90028 Networks 13, 296-302 (1983). MSC: 90B10 90C35 05C35 PDF BibTeX XML Cite \textit{Y. P. Aneja} et al., Networks 13, 296--302 (1983; Zbl 0516.90028) Full Text: DOI OpenURL
Blog, B.; van der Hoek, G.; Rinnooy Kan, A. H. G.; Timmer, G. T. The optimal selection of small portfolios. (English) Zbl 0512.90013 Manage. Sci. 29, 792-798 (1983). MSC: 91B28 90B99 90C90 90C10 90C39 PDF BibTeX XML Cite \textit{B. Blog} et al., Manage. Sci. 29, 792--798 (1983; Zbl 0512.90013) Full Text: DOI OpenURL
Deckro, R. F.; Winkofsky, E. P. Solving zero-one multiple objective programs through implicit enumeration. (English) Zbl 0503.90086 Eur. J. Oper. Res. 12, 362-374 (1983). MSC: 90C31 90C09 65K05 PDF BibTeX XML Cite \textit{R. F. Deckro} and \textit{E. P. Winkofsky}, Eur. J. Oper. Res. 12, 362--374 (1983; Zbl 0503.90086) Full Text: DOI OpenURL
Bitran, Gabriel R.; Rivera, Jorge M. A combined approach to solve binary multicriteria problems. (English) Zbl 0536.90080 Nav. Res. Logist. Q. 29, 181-201 (1982). MSC: 90C31 90C09 65K05 90B05 90C90 PDF BibTeX XML Cite \textit{G. R. Bitran} and \textit{J. M. Rivera}, Nav. Res. Logist. Q. 29, 181--201 (1982; Zbl 0536.90080) Full Text: DOI OpenURL
Escudero, L. F. On maintenance scheduling of production units. (English) Zbl 0475.90036 Eur. J. Oper. Res. 9, 264-274 (1982). MSC: 90B25 90C90 90B30 90B35 90C11 90C30 65K05 PDF BibTeX XML Cite \textit{L. F. Escudero}, Eur. J. Oper. Res. 9, 264--274 (1982; Zbl 0475.90036) Full Text: DOI OpenURL
Fayard, D.; Plateau, G. An algorithm for the solution of the 0-1 knapsack problem. (English) Zbl 0468.90045 Computing 28, 269-287 (1982). MSC: 90C09 90C08 65K05 68Q25 90-04 PDF BibTeX XML Cite \textit{D. Fayard} and \textit{G. Plateau}, Computing 28, 269--287 (1982; Zbl 0468.90045) Full Text: DOI OpenURL
Trubin, V. A.; Vojtishin, Yu. V. An algorithm for the solution of the set partitioning problem. (Russian) Zbl 0508.90063 Investigation methods for extremal problems, Collect. Artic., Kiev 1981, 3-9 (1981). MSC: 90C09 65K05 90C05 PDF BibTeX XML OpenURL
Ciobanu, Gh. On feasible solutions for project scheduling problem. (English) Zbl 0488.90036 Methods Oper. Res. 40, 247-250 (1981). MSC: 90B35 90C10 90C90 PDF BibTeX XML Cite \textit{Gh. Ciobanu}, Methods Oper. Res. 40, 247--250 (1981; Zbl 0488.90036) OpenURL
Bruynooghe, M. An accelerated clustering algorithm based on the convex hull concept. (English) Zbl 0461.62054 Computational statistics, Proc. 4th Symp., Edinburgh 1980, 412-418 (1980). MSC: 62H30 62-07 PDF BibTeX XML OpenURL
Mehta, Cyrus R.; Patel, Nitin R. A network algorithm for the exact treatment of the 2xk contingency table. (English) Zbl 0452.62041 Commun. Stat., Simulation Comput. B9, 649-664 (1980). MSC: 62H17 65C99 90C39 90C35 PDF BibTeX XML Cite \textit{C. R. Mehta} and \textit{N. R. Patel}, Commun. Stat., Simulation Comput. B9, 649--664 (1980; Zbl 0452.62041) Full Text: DOI OpenURL
Albers, S. Implicit enumeration algorithms for the set-partitioning problem. (English) Zbl 0442.90059 OR Spektrum 2, 23-32 (1980). MSC: 90C09 65K05 68Q25 PDF BibTeX XML Cite \textit{S. Albers}, OR Spektrum 2, 23--32 (1980; Zbl 0442.90059) Full Text: DOI OpenURL
Shcherbina, O. A. Über einen lokalen Algorithmus für Probleme der ganzzahligen Optimierung. (Russian) Zbl 0437.90058 Zh. Vychisl. Mat. Mat. Fiz. 20, 802-804 (1980). MSC: 90C09 65K05 68Q60 PDF BibTeX XML Cite \textit{O. A. Shcherbina}, Zh. Vychisl. Mat. Mat. Fiz. 20, 802--804 (1980; Zbl 0437.90058) OpenURL
Smith, T. H. C. A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation. (English) Zbl 0435.90072 Math. Program. Study 12, 108-114 (1980). MSC: 90C10 65K05 68Q60 PDF BibTeX XML Cite \textit{T. H. C. Smith}, Math. Program. Study 12, 108--114 (1980; Zbl 0435.90072) Full Text: DOI OpenURL
Pegden, Claude Dennis; Peterson, Clifford C. An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions. (English) Zbl 0496.90061 Nav. Res. Logist. Q. 26, 595-609 (1979). MSC: 90C10 90C30 65K05 PDF BibTeX XML Cite \textit{C. D. Pegden} and \textit{C. C. Peterson}, Nav. Res. Logist. Q. 26, 595--609 (1979; Zbl 0496.90061) Full Text: DOI OpenURL
Grabowski, J.; Skubalska, E. The maximal flow problem in a network with a variable structure. (English) Zbl 0475.90085 Applications of mathematics in system theory, Proc. int. Symp., Brasov/Romania 1978, Vol. II, 209-222 (1979). MSC: 90C35 90B10 65K05 90C08 05C35 05C20 PDF BibTeX XML OpenURL
Dearing, P. M.; Newruck, F. C. A capacitated bottleneck facility location problem. (English) Zbl 0466.90022 Manage. Sci. 25, 1093-1104 (1979). MSC: 90B05 65K05 90C90 PDF BibTeX XML Cite \textit{P. M. Dearing} and \textit{F. C. Newruck}, Manage. Sci. 25, 1093--1104 (1979; Zbl 0466.90022) Full Text: DOI OpenURL
Rohde, Martin Set partitioning mit linearen Randbedingungen. (German) Zbl 0443.90065 OR Spektrum 1, 75-87 (1979). MSC: 90C09 65K05 PDF BibTeX XML Cite \textit{M. Rohde}, OR Spektrum 1, 75--87 (1979; Zbl 0443.90065) Full Text: DOI OpenURL
Narula, Subhash C.; Wellington, John F. Selection of variables in linear regression using the minimum sum of weighted absolute errors criterion. (English) Zbl 0424.90047 Technometrics 21, 299-306 (1979). MSC: 90C05 90C90 65C99 62M10 PDF BibTeX XML Cite \textit{S. C. Narula} and \textit{J. F. Wellington}, Technometrics 21, 299--306 (1979; Zbl 0424.90047) Full Text: DOI OpenURL
Harvey, Richard T.; Patterson, James H. An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. (English) Zbl 0424.90035 Found. Control Eng. 4, 107-117 (1979). MSC: 90B35 90C90 90C09 65K05 PDF BibTeX XML Cite \textit{R. T. Harvey} and \textit{J. H. Patterson}, Found. Control Eng. 4, 107--117 (1979; Zbl 0424.90035) OpenURL
Granot, Daniel; Granot, Frieda; Kallberg, Jerry Covering relaxation for positive 0-1 polynomial programs. (English) Zbl 0415.90058 Manage. Sci. 25, 264-273 (1979). MSC: 90C09 68Q60 PDF BibTeX XML Cite \textit{D. Granot} et al., Manage. Sci. 25, 264--273 (1979; Zbl 0415.90058) Full Text: DOI OpenURL
Martinec, Ivan A combinatorial algorithm for M-tour travelling salesman problems. (Czech) Zbl 0411.90069 Ehkon.-Mat. Obz. 15, 320-341 (1979). MSC: 90C35 68R10 05C35 PDF BibTeX XML OpenURL
Martello, Silvano; Toth, Paolo The 0-1 knapsack problem. (English) Zbl 0409.90063 Combinatorial optimization, Summer Sch., Sogesta, Urbino 1977, 237-279 (1979). MSC: 90C10 90C39 65K05 68Q60 PDF BibTeX XML OpenURL
Denardo, Eric V.; Fox, Bennett L. Shortest-route methods: 2. Group knapsacks, expanded networks, and branch-and-bound. (English) Zbl 0406.90053 Oper. Res. 27, 548-566 (1979). MSC: 90C10 90C35 05C35 PDF BibTeX XML Cite \textit{E. V. Denardo} and \textit{B. L. Fox}, Oper. Res. 27, 548--566 (1979; Zbl 0406.90053) Full Text: DOI OpenURL
Albers, S. Zur Lösung des quadratischen Set-Partitioning-Problems. (German) Zbl 0446.90054 Proc. Oper. Res. 7, Vortr. Jahrestag. DGOR, Kiel 1977, 19-28 (1978). MSC: 90C09 65K05 90B99 90C90 PDF BibTeX XML OpenURL
Hung, Ming S.; Brown, J. Randall An algorithm for a class of loading problems. (English) Zbl 0404.90057 Nav. Res. Logist. Q. 25, 289-297 (1978). MSC: 90C09 65K05 PDF BibTeX XML Cite \textit{M. S. Hung} and \textit{J. R. Brown}, Nav. Res. Logist. Q. 25, 289--297 (1978; Zbl 0404.90057) Full Text: DOI OpenURL
Jambekar, Anil B.; Steinberg, David I. Computational experience with an algorithm for 0-1 integer programming. (English) Zbl 0404.90056 Comput. Math. Appl. 4, 305-314 (1978). MSC: 90C09 65K05 PDF BibTeX XML Cite \textit{A. B. Jambekar} and \textit{D. I. Steinberg}, Comput. Math. Appl. 4, 305--314 (1978; Zbl 0404.90056) Full Text: DOI OpenURL
Talbot, F. Brian; Patterson, James H. An efficient integer programmig algorithm with network cuts for solving resource-constrained scheduling problems. (English) Zbl 0395.90036 Manage. Sci. 24, 1163-1174 (1978). MSC: 90B35 90C90 90C10 90C35 90B30 05C30 PDF BibTeX XML Cite \textit{F. B. Talbot} and \textit{J. H. Patterson}, Manage. Sci. 24, 1163--1174 (1978; Zbl 0395.90036) Full Text: DOI OpenURL