Publication:5523467
From MaRDI portal
zbMath0146.20104MaRDI QIDQ5523467
Thomas L. Saaty, Robert G. Busacker
Publication date: 1965
Related Items
Universality of iterated networks, On the Use of a Mixed Integer Non-linear Programming Model for Refrigerant Design, ANALYSIS OF A GENERAL LOGICAL DISCOURSE FOR MAN‐MACHINE INTERACTION—PART II, A note on optimality conditions for the Euclidean. Multifacility location problem, Unnamed Item, Unnamed Item, Some unsymmetric combinatorial numbers, Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen, Some Basic Definitions in Graph Theory, A technique for generating interpretive translators for problem-oriented languages, Graph property recognition machines, Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods, Some problems in discrete optimization, What is a Graph?, SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON, Modeling and algorithmic development of a staff scheduling problem, Graph theory, Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems, A new algorithm for solving the tree isomorphism problem, Generic properties of column-structured matrices, On methods for generating random partial orders, Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid, On maximal independent sets of vertices in claw-free graphs, Sensitivitätsindices für Knoten und Kanten eines Netzes, Optimal scaling for arbitrarily ordered categories, Heuristics and their design: A survey, Weighted min cost flows, Constructing a stochastic critical path network given the slacks: Representation, Algorithms for the minimum cost circulation problem based on maximizing the mean improvement, Vector spaces and the four-color problem, Properties of a planar cubic graph, Algorithm for deriving the chromatic polynomial of a graph, Some applications of graph theory to clustering, The number of two-way tables satisfying certain additivity axioms, An introduction to matching polynomials, Properties of a Euler graph, Decentralized control of linear multivariable systems, A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them, On The tantalizer and Instant insanity, Tight bounds on the number of minimum-mean cycle cancellations and related results, Vertex heaviest paths and cycles in quasi-transitive digraphs, General equilibrium and the theory of directed graphs, Stochastic token theory, Arbitrarily traceable graphs and digraphs, A successful concept for measuring non-planarity of graphs: The crossing number., Cardinality constrained minimum cut problems: complexity and algorithms., Finding all the negative cycles in a directed graph, A QoS multicast routing protocol for dynamic group topology, Heuristic and exact algorithms for the spanning tree detection problem, Application of the majority connectedness carrier for computing the reliability of complex systems, Planning temporal events using point-interval logic, Decomposition of communication networks, A prediction theory for some nonlinear functional-differential equations. I: Learning of lists, A prediction theory for some nonlinear functional-differential equations. II: Learning of patterns, On the global limits and oscillations of a system of nonlinear differential equations describing a flow on a probabilistic network, On Okada's method for realizing cut-set matrices, Convexity in directed graphs, Heuristically guided search and chromosome matching, Zum Auswahlproblem, An upper bound for the rectilinear crossing number of the complete graph, Triangulated graphs and the elimination process, m-ary closed sequences, Enumeration of spanning trees containing given subgraphs, On fully indecomposable matrices, Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes, Indirect counting trees in linear graphs, Construction and enumeration of regular maps on the torus, Optimal task sequencing with precedence constraints, Compartmental matrices with single root and nonnegative nilpotent matrices, Vertices missed by longest paths or circuits, Thickness and coarseness of graphs, Irreducible economies and strongly connected graphs, A backtracking algorithm to generate all kernels of a directed graph, On cyclic sequence types for constructing cyclic schedules, Pickup and Delivery of Partial Loads with “Soft” Time Windows, On the temporal analysis of special GERT networks using a modified Markov renewal process, Application of the algebra of cubic complexes to network reliability analysis, A problem on lattice graphs. Theory and algorithm, Matchings and skew-symmetric quadratic forms, The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm, Asymptotic behaviour of output feedback for a class of non-deterministic discrete event systems, Applications of graph theory in computer systems, Law of the iterated logarithm for sums of non-linear functions of Gaussian variables that exhibit a long range dependence, A construction method in parametric programming
