Poljak, Svatopluk; Turzík, Daniel On pre-periods of discrete influence systems. (English) Zbl 0611.93046 Discrete Appl. Math. 13, 33-39 (1986). MSC: 93C55 26B25 68Q80 94C10 33E99 PDF BibTeX XML Cite \textit{S. Poljak} and \textit{D. Turzík}, Discrete Appl. Math. 13, 33--39 (1986; Zbl 0611.93046) Full Text: DOI
Granot, Frieda; Hassin, Refael Multi-terminal maximum flows in node-capacitated networks. (English) Zbl 0607.90030 Discrete Appl. Math. 13, 157-163 (1986). Reviewer: E.Ciurea MSC: 90B10 05C35 PDF BibTeX XML Cite \textit{F. Granot} and \textit{R. Hassin}, Discrete Appl. Math. 13, 157--163 (1986; Zbl 0607.90030) Full Text: DOI
Shing, M. T.; Hu, T. C. A decomposition algorithm for multi-terminal network flows. (English) Zbl 0606.90046 Discrete Appl. Math. 13, 165-181 (1986). Reviewer: A.Girard MSC: 90B10 90C35 68Q25 90C08 PDF BibTeX XML Cite \textit{M. T. Shing} and \textit{T. C. Hu}, Discrete Appl. Math. 13, 165--181 (1986; Zbl 0606.90046) Full Text: DOI
Ali, A. Iqbal; Kennington, Jeff L. The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm. (English) Zbl 0603.90132 Discrete Appl. Math. 13, 259-276 (1986). Reviewer: K.Mosler MSC: 90C35 90C10 65K05 90C27 PDF BibTeX XML Cite \textit{A. I. Ali} and \textit{J. L. Kennington}, Discrete Appl. Math. 13, 259--276 (1986; Zbl 0603.90132) Full Text: DOI
Hung, M. S.; Rom, W. O.; Waren, A. D. Degeneracy in transportation problems. (English) Zbl 0602.90095 Discrete Appl. Math. 13, 223-237 (1986). Reviewer: I.Maros MSC: 90C08 65K05 PDF BibTeX XML Cite \textit{M. S. Hung} et al., Discrete Appl. Math. 13, 223--237 (1986; Zbl 0602.90095) Full Text: DOI
Aalbersberg, Ijsbrand Jan; Rozenberg, G.; Ehrenfeucht, A. On the membership problem for regular DNLC grammars. (English) Zbl 0602.68064 Discrete Appl. Math. 13, 79-85 (1986). MSC: 68Q45 PDF BibTeX XML Cite \textit{I. J. Aalbersberg} et al., Discrete Appl. Math. 13, 79--85 (1986; Zbl 0602.68064) Full Text: DOI
Vlach, Milan Conditions for the existence of solutions of the three-dimensional planar transportation problem. (English) Zbl 0601.90105 Discrete Appl. Math. 13, 61-78 (1986). Reviewer: L.Mihalyffy MSC: 90C08 PDF BibTeX XML Cite \textit{M. Vlach}, Discrete Appl. Math. 13, 61--78 (1986; Zbl 0601.90105) Full Text: DOI
Atallah, Mikhail J.; Frederickson, Greg N. A note on finding a maximum empty rectangle. (English) Zbl 0598.05018 Discrete Appl. Math. 13, 87-91 (1986). MSC: 05B25 68R99 68Q25 PDF BibTeX XML Cite \textit{M. J. Atallah} and \textit{G. N. Frederickson}, Discrete Appl. Math. 13, 87--91 (1986; Zbl 0598.05018) Full Text: DOI
Barahona, Francisco A solvable case of quadratic 0-1 programming. (English) Zbl 0597.90059 Discrete Appl. Math. 13, 23-26 (1986). Reviewer: O.A.Shcherbina MSC: 90C09 90C20 05C35 68Q25 PDF BibTeX XML Cite \textit{F. Barahona}, Discrete Appl. Math. 13, 23--26 (1986; Zbl 0597.90059) Full Text: DOI
Glover, Fred; Novick, Beth The 2-quasi-greedy algorithm for cardinality constrained matroid bases. (English) Zbl 0596.90094 Discrete Appl. Math. 13, 277-286 (1986). Reviewer: W.Stańczak MSC: 90C35 90C10 05B35 05C35 68R10 PDF BibTeX XML Cite \textit{F. Glover} and \textit{B. Novick}, Discrete Appl. Math. 13, 277--286 (1986; Zbl 0596.90094) Full Text: DOI
Hedetniemi, S. T.; Laskar, Renu; Pfaff, John A linear algorithm for finding a minimum dominating set in a cactus. (English) Zbl 0596.05051 Discrete Appl. Math. 13, 287-292 (1986). Reviewer: M.M.Sysło MSC: 05C70 68Q25 68R10 PDF BibTeX XML Cite \textit{S. T. Hedetniemi} et al., Discrete Appl. Math. 13, 287--292 (1986; Zbl 0596.05051) Full Text: DOI
Jones, Philip C.; Saigal, Romesh; Schneider, Michael H. A variable-dimension homotopy on networks for computing linear spatial equilibria. (English) Zbl 0594.90084 Discrete Appl. Math. 13, 131-156 (1986). Reviewer: P.J.Deschamps MSC: 90C33 90C35 91B50 65K05 PDF BibTeX XML Cite \textit{P. C. Jones} et al., Discrete Appl. Math. 13, 131--156 (1986; Zbl 0594.90084) Full Text: DOI
Mote, John The family constrained network problem. (English) Zbl 0593.90080 Discrete Appl. Math. 13, 249-257 (1986). MSC: 90C35 90C08 90B30 90B05 90C90 65K05 PDF BibTeX XML Cite \textit{J. Mote}, Discrete Appl. Math. 13, 249--257 (1986; Zbl 0593.90080) Full Text: DOI
Phillips, Nancy V. A new variant of the partitioning shortest path algorithm. (English) Zbl 0589.90082 Discrete Appl. Math. 13, 207-212 (1986). MSC: 90C35 65K05 05C35 PDF BibTeX XML Cite \textit{N. V. Phillips}, Discrete Appl. Math. 13, 207--212 (1986; Zbl 0589.90082) Full Text: DOI
Poljak, Svatopluk; Turzík, Daniel On an application of convexity to discrete systems. (English) Zbl 0588.93048 Discrete Appl. Math. 13, 27-32 (1986). MSC: 93C55 26B25 39A12 34C25 PDF BibTeX XML Cite \textit{S. Poljak} and \textit{D. Turzík}, Discrete Appl. Math. 13, 27--32 (1986; Zbl 0588.93048) Full Text: DOI
Goldman, A. J.; Tiwari, Prasoon Allowable processing orders in the accelerated cascade algorithm. (English) Zbl 0587.90095 Discrete Appl. Math. 13, 213-221 (1986). MSC: 90C35 05C35 65K05 PDF BibTeX XML Cite \textit{A. J. Goldman} and \textit{P. Tiwari}, Discrete Appl. Math. 13, 213--221 (1986; Zbl 0587.90095) Full Text: DOI
Ikura, Yoshiro; Nemhauser, George L. Computational experience with a polynomial-time dual simplex algorithm for the transportation problem. (English) Zbl 0587.90068 Discrete Appl. Math. 13, 239-248 (1986). MSC: 90C08 65K05 90C35 68Q25 PDF BibTeX XML Cite \textit{Y. Ikura} and \textit{G. L. Nemhauser}, Discrete Appl. Math. 13, 239--248 (1986; Zbl 0587.90068) Full Text: DOI
Barros, Oscar; Weintraub, Andrés Spatial market equilibrium problems as network models. (English) Zbl 0587.90019 Discrete Appl. Math. 13, 109-130 (1986). MSC: 91B50 90B10 90C90 PDF BibTeX XML Cite \textit{O. Barros} and \textit{A. Weintraub}, Discrete Appl. Math. 13, 109--130 (1986; Zbl 0587.90019) Full Text: DOI
Zalcstein, Yechezkel; Franklin, Stanley P. Testing homotopy equivalence is isomorphism complete. (English) Zbl 0587.05057 Discrete Appl. Math. 13, 101-104 (1986). Reviewer: Ludovit Niepel MSC: 05C99 68Q25 PDF BibTeX XML Cite \textit{Y. Zalcstein} and \textit{S. P. Franklin}, Discrete Appl. Math. 13, 101--104 (1986; Zbl 0587.05057) Full Text: DOI
Bovet, Jean An improvement of Dijkstra’s method for finding a shortest path in a graph. (Une amélioration de la méthode de Dijkstra pour la recherche d’un plus court chemin dans un réseau.) (French) Zbl 0587.05042 Discrete Appl. Math. 13, 93-96 (1986). Reviewer: P. Vincke MSC: 05C38 05C35 68R10 PDF BibTeX XML Cite \textit{J. Bovet}, Discrete Appl. Math. 13, 93--96 (1986; Zbl 0587.05042) Full Text: DOI
Klingman, Darwin D.; Schneider, Robert F. Microcomputer-based algorithms for large scale shortest path problems. (English) Zbl 0586.90086 Discrete Appl. Math. 13, 183-206 (1986). MSC: 90C35 05C35 65K05 05C38 PDF BibTeX XML Cite \textit{D. D. Klingman} and \textit{R. F. Schneider}, Discrete Appl. Math. 13, 183--206 (1986; Zbl 0586.90086) Full Text: DOI
Anstee, R. P. Invariant sets of arcs in network flow problems. (English) Zbl 0585.90029 Discrete Appl. Math. 13, 1-7 (1986). Reviewer: M.Křivánek MSC: 90B10 90C35 05C50 15B36 05C20 PDF BibTeX XML Cite \textit{R. P. Anstee}, Discrete Appl. Math. 13, 1--7 (1986; Zbl 0585.90029) Full Text: DOI
Atallah, Mikhail J.; Hambrusch, Susanne E. An assignment algorithm with applications to integrated circuit layout. (English) Zbl 0583.90066 Discrete Appl. Math. 13, 9-22 (1986). MSC: 90C08 65K05 68Q25 PDF BibTeX XML Cite \textit{M. J. Atallah} and \textit{S. E. Hambrusch}, Discrete Appl. Math. 13, 9--22 (1986; Zbl 0583.90066) Full Text: DOI
Rosenberg, I. G. Structural rigidity. II: Almost infinitesimally rigid bar frameworks. (English) Zbl 0582.05054 Discrete Appl. Math. 13, 41-59 (1986). MSC: 05C99 74B99 70J99 15A99 74G99 74H99 PDF BibTeX XML Cite \textit{I. G. Rosenberg}, Discrete Appl. Math. 13, 41--59 (1986; Zbl 0582.05054) Full Text: DOI
Goles, E. Antisymmetrical neural networks. (English) Zbl 0579.92030 Discrete Appl. Math. 13, 97-100 (1986). MSC: 92F05 94C99 68R99 PDF BibTeX XML Cite \textit{E. Goles}, Discrete Appl. Math. 13, 97--100 (1986; Zbl 0579.92030) Full Text: DOI