Solomon, Marius M. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. (English) Zbl 0642.90058 Networks 16, No. 2, 161-174 (1986). MSC: 90B35 PDFBibTeX XMLCite \textit{M. M. Solomon}, Networks 16, No. 2, 161--174 (1986; Zbl 0642.90058) Full Text: DOI
Rappaport, David A linear algorithm for eliminating hidden-lines from a polygonal cylinder. (English) Zbl 0639.68040 Visual Comput. 2, 44-53 (1986). MSC: 68Q25 68U99 PDFBibTeX XMLCite \textit{D. Rappaport}, Visual Comput. 2, 44--53 (1986; Zbl 0639.68040) Full Text: DOI
Edelsbrunner, Herbert; Welzl, Emo Halfplanar range search in linear space and \(O(n^{0.695})\) query time. (English) Zbl 0634.68064 Inf. Process. Lett. 23, 289-293 (1986). Reviewer: E.P.Mücke MSC: 68P10 68Q25 52A37 PDFBibTeX XMLCite \textit{H. Edelsbrunner} and \textit{E. Welzl}, Inf. Process. Lett. 23, 289--293 (1986; Zbl 0634.68064) Full Text: DOI
Blum, Lenore Towards an asymptotic analysis of Karmarkar’s algorithm. (English) Zbl 0625.90050 Inf. Process. Lett. 23, 189-194 (1986). Reviewer: R.Beedgen MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{L. Blum}, Inf. Process. Lett. 23, 189--194 (1986; Zbl 0625.90050) Full Text: DOI
Györi, E. Oracle technique in lower estimation of complexity. (English) Zbl 0623.68048 Algebra, combinatorics and logic in computer science, Colloq. Györ/Hung. 1983, Vol. 1, Colloq. Math. Soc. János Bolyai 42, 433-441 (1986). Reviewer: R.Klette MSC: 68Q25 PDFBibTeX XML
Brinck, Keith Computing parent nodes in threaded binary trees. (English) Zbl 0621.68027 BIT 26, 402-409 (1986). MSC: 68Q25 68R10 05C05 PDFBibTeX XMLCite \textit{K. Brinck}, BIT 26, 402--409 (1986; Zbl 0621.68027) Full Text: DOI
Kawaguchi, Tsuyoshi; Kyan, Seiki Worst case bound of an LRF schedule for the mean weighted flow-time problem. (English) Zbl 0621.68024 SIAM J. Comput. 15, 1119-1129 (1986). MSC: 68M20 68Q25 90B35 PDFBibTeX XMLCite \textit{T. Kawaguchi} and \textit{S. Kyan}, SIAM J. Comput. 15, 1119--1129 (1986; Zbl 0621.68024) Full Text: DOI
Fischetti, Matteo Worst-case analysis of an approximation scheme for the subset-sum problem. (English) Zbl 0618.90080 Oper. Res. Lett. 5, 283-284 (1986). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{M. Fischetti}, Oper. Res. Lett. 5, 283--284 (1986; Zbl 0618.90080) Full Text: DOI
Kacewicz, B.; Wasilkowski, G. W. How powerful is continuous nonlinear information for linear problems? (English) Zbl 0618.65043 J. Complexity 2, 306-316 (1986). Reviewer: A.Neumaier MSC: 65J05 41A46 PDFBibTeX XMLCite \textit{B. Kacewicz} and \textit{G. W. Wasilkowski}, J. Complexity 2, 306--316 (1986; Zbl 0618.65043) Full Text: DOI
Novak, Erich On average case errors in numerical analysis. (English) Zbl 0618.65042 J. Complexity 2, 229-238 (1986). MSC: 65J05 PDFBibTeX XMLCite \textit{E. Novak}, J. Complexity 2, 229--238 (1986; Zbl 0618.65042) Full Text: DOI
Wasilkowski, G. W. Information of varying cardinality. (English) Zbl 0615.94004 J. Complexity 2, 204-228 (1986). MSC: 94A15 68Q25 PDFBibTeX XMLCite \textit{G. W. Wasilkowski}, J. Complexity 2, 204--228 (1986; Zbl 0615.94004) Full Text: DOI
Jaromczyk, J. W. Complexity bounds and Euclidean space partitioning. (English) Zbl 0615.68038 Algebra, combinatorics and logic in computer science, Colloq. Györ/Hung. 1983, Vol. 2, Colloq. Math. Soc. János Bolyai 42, 491-499 (1986). Reviewer: J. W. Jaromczyk MSC: 68Q25 52-04 68U05 PDFBibTeX XML
Krarup, Jakob; Pruzan, Peter Assessment of approximate algorithms: The error measure’s crucial role. (English) Zbl 0614.90031 BIT 26, 284-294 (1986). MSC: 90B05 90C90 PDFBibTeX XMLCite \textit{J. Krarup} and \textit{P. Pruzan}, BIT 26, 284--294 (1986; Zbl 0614.90031) Full Text: DOI
Baker, Brenda S. A provably good algorithm for the two module routing problem. (English) Zbl 0612.68062 SIAM J. Comput. 15, 162-188 (1986). MSC: 68R10 68Q25 94C15 PDFBibTeX XMLCite \textit{B. S. Baker}, SIAM J. Comput. 15, 162--188 (1986; Zbl 0612.68062) Full Text: DOI
Werschulz, Arthur G. What is the complexity of related elliptic, parabolic, and hyperbolic problems? (English) Zbl 0608.65079 Math. Comput. 47, 461-472 (1986). Reviewer: D.A.Quinney MSC: 65Z05 65M15 65N15 35J40 35K25 35L25 65M60 65N30 68Q25 PDFBibTeX XMLCite \textit{A. G. Werschulz}, Math. Comput. 47, 461--472 (1986; Zbl 0608.65079) Full Text: DOI
Kun, I. A worst case analysis for the optimal gradient method. (English) Zbl 0605.90103 System modelling and optimization, Proc. 12th IFIP Conf., Budapest/Hung. 1985, Lect. Notes Control Inf. Sci. 84, 461-467 (1986). MSC: 90C30 65K05 49M37 PDFBibTeX XML
Sedgewick, Robert A new upper bound for Shellsort. (English) Zbl 0605.68051 J. Algorithms 7, 159-173 (1986). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{R. Sedgewick}, J. Algorithms 7, 159--173 (1986; Zbl 0605.68051) Full Text: DOI
Marcotte, P. Network design problem with congestion effects: A case of bilevel programming. (English) Zbl 0604.90053 Math. Program. 34, 142-162 (1986). Reviewer: A.Girard MSC: 90B10 90C35 65K10 90C30 90C08 PDFBibTeX XMLCite \textit{P. Marcotte}, Math. Program. 34, 142--162 (1986; Zbl 0604.90053) Full Text: DOI
Weiss, N.; Wasilkowski, G. W.; Woźniakowski, H.; Shub, M. Average condition number for solving linear equations. (English) Zbl 0603.65025 Linear Algebra Appl. 83, 79-102 (1986). Reviewer: N.Köckler MSC: 65F35 15A12 15A60 PDFBibTeX XMLCite \textit{N. Weiss} et al., Linear Algebra Appl. 83, 79--102 (1986; Zbl 0603.65025) Full Text: DOI
Petković, Miodrag S. Some applications of interval arithmetic: Analysis of linear electrical circuits. (English) Zbl 0602.65041 Applied mathematics, 5th Conf., Ljubljana/Yugosl. 1986, 109-116 (1986). Reviewer: H.Ratschek MSC: 65K10 65G30 93C15 94C05 PDFBibTeX XML
Chand, Suresh; Schneeberger, Hans A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness. (English) Zbl 0601.90079 Nav. Res. Logist. Q. 33, 551-557 (1986). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{S. Chand} and \textit{H. Schneeberger}, Nav. Res. Logist. Q. 33, 551--557 (1986; Zbl 0601.90079) Full Text: DOI
Queyranne, Maurice Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. (English) Zbl 0599.90085 Oper. Res. Lett. 4, 231-234 (1986). Reviewer: F.Plastria MSC: 90C10 90B05 68Q25 90C20 PDFBibTeX XMLCite \textit{M. Queyranne}, Oper. Res. Lett. 4, 231--234 (1986; Zbl 0599.90085) Full Text: DOI
Kalantari, B. Quadratic functions with exponential number of local maxima. (English) Zbl 0597.90067 Oper. Res. Lett. 5, 47-49 (1986). Reviewer: O.A.Shcherbina MSC: 90C20 90C09 68Q25 PDFBibTeX XMLCite \textit{B. Kalantari}, Oper. Res. Lett. 5, 47--49 (1986; Zbl 0597.90067) Full Text: DOI
Jeromin, B.; Körner, F. Sharp bounds for Karp’s ”patching”-algorithm for the approximate solution of the traveling salesman problem. (English) Zbl 0596.90096 Optimization 17, 85-92 (1986). Reviewer: Li Weixuan MSC: 90C35 90C08 05C35 PDFBibTeX XMLCite \textit{B. Jeromin} and \textit{F. Körner}, Optimization 17, 85--92 (1986; Zbl 0596.90096) Full Text: DOI
Balinski, M. L. A competitive (dual) simplex method for the assignment problem. (English) Zbl 0596.90064 Math. Program. 34, 125-141 (1986). Reviewer: M.Bastian MSC: 90C08 90C05 68Q25 65K05 PDFBibTeX XMLCite \textit{M. L. Balinski}, Math. Program. 34, 125--141 (1986; Zbl 0596.90064) Full Text: DOI
Bitran, Gabriel R.; Matsuo, Hirofumi The multi-item capacitated lot size problem: Error bounds of Manne’s formulations. (English) Zbl 0596.90043 Manage. Sci. 32, 350-359 (1986). Reviewer: S.K.Goyal MSC: 90B30 90C90 90C05 PDFBibTeX XMLCite \textit{G. R. Bitran} and \textit{H. Matsuo}, Manage. Sci. 32, 350--359 (1986; Zbl 0596.90043) Full Text: DOI
Aggarwal, Alok; Carter, J. Lawrence; Kosaraju, S. Rao Optimal tradeoffs for addition on systolic arrays. (English) Zbl 0595.68046 VLSI algorithms and architectures, Proc. Aegean Workshop Comput., Loutraki/Greece 1986, Lect. Notes Comput. Sci. 227, 57-69 (1986). MSC: 68Q25 68Q80 PDFBibTeX XML
Imai, Hiroshi Worst-case analysis for planar matching and tour heuristics with bucketing techniques and spacefilling curves. (English) Zbl 0594.90063 J. Oper. Res. Soc. Japan 29, 43-68 (1986). MSC: 90C10 68Q25 05C70 52A37 90C35 PDFBibTeX XMLCite \textit{H. Imai}, J. Oper. Res. Soc. Japan 29, 43--68 (1986; Zbl 0594.90063) Full Text: DOI
Galambos, G. Parametric lower bound for on-line bin-packing. (English) Zbl 0593.90051 SIAM J. Algebraic Discrete Methods 7, 362-367 (1986). Reviewer: H.T.Lau MSC: 90C09 PDFBibTeX XMLCite \textit{G. Galambos}, SIAM J. Algebraic Discrete Methods 7, 362--367 (1986; Zbl 0593.90051) Full Text: DOI
Frigessi, A.; Vercellis, C. A probabilistic analysis of Monte Carlo algorithms for a class of counting problems. (English) Zbl 0593.65004 Stochastic programming, Conf. Gargnano/Italy 1983, Lect. Notes Control Inf. Sci. 76, 53-68 (1986). Reviewer: M.Cugiani MSC: 65C05 68Q25 PDFBibTeX XML
Milanov, P. B. On the worst behaviour of the greedy procedure. (English) Zbl 0591.90064 C. R. Acad. Bulg. Sci. 39, No. 2, 43-45 (1986). MSC: 90C10 68Q25 65K05 PDFBibTeX XMLCite \textit{P. B. Milanov}, C. R. Acad. Bulg. Sci. 39, No. 2, 43--45 (1986; Zbl 0591.90064)
Friesen, D. K.; Langston, M. A. Variable sized bin packing. (English) Zbl 0589.68036 SIAM J. Comput. 15, 222-230 (1986). MSC: 68R99 68Q25 PDFBibTeX XMLCite \textit{D. K. Friesen} and \textit{M. A. Langston}, SIAM J. Comput. 15, 222--230 (1986; Zbl 0589.68036) Full Text: DOI
Grigoriadis, M. D.; Kalantari, B. A lower bound to the complexity of Euclidean and rectilinear matching algorithms. (English) Zbl 0587.68062 Inf. Process. Lett. 22, 73-76 (1986). MSC: 68R10 68Q25 05C70 68P10 PDFBibTeX XMLCite \textit{M. D. Grigoriadis} and \textit{B. Kalantari}, Inf. Process. Lett. 22, 73--76 (1986; Zbl 0587.68062) Full Text: DOI