Publication:4083324
From MaRDI portal
zbMath0321.94011MaRDI QIDQ4083324
Publication date: 1975
05C35: Extremal problems in graph theory
05C90: Applications of graph theory
90B10: Deterministic network models in operations research
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
94C05: Analytic circuit theory
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
94C15: Applications of graph theory to circuits and networks
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
94-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory
68W99: Algorithms in computer science
Related Items
Fuzzy quadratic minimum spanning tree problem, Maximum outflow in generalized flow networks, Traffic assignment in communication satellites, Distance conserving reductions for nonoriented networks, On paths with the shortest average arc length in weighted graphs, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Structurally fixed modes: Decomposition and reachability, Transmission facility planning in telecommunications networks: A heuristic approach, A successful algorithm for solving directed Hamiltonian path problems, Network models for vehicle and crew scheduling, The absolute centre of a graph, The multi-facility min-max Weber problem, Shortest paths in networks with vector weights, Efficient spanning trees, Filtrations of the modules for Chevalley groups arising from admissible lattices, The k-neighbor domination problem, An optimization algorithm for the clearing of interbank payments, The \(p\)-median problem: a survey of metaheuristic approaches, Synthesis of optimal controllers for piecewise affine systems with sampled-data switching, The discrete p-dispersion problem, A constrained \(k\)-means clustering algorithm for classifying spatial units, A computational procedure for the asymptotic analysis of homogeneous semi-Markov processes, A successful algorithm for the undirected Hamiltonian path problem, On the chromatic number of certain highly symmetric graphs, Location problems, Equivalence between the minimum covering problem and the maximum matching problem, Numerical experiences with graph coloring algorithms, DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits, A fault diagnosis in a nonlinear location network, A graph coloring algorithm for large scale scheduling problems, Binomial-combinatorial properties of Clar structures, A heuristic for the p-center problem in graphs, Fast parallel graph searching with applications, Graph theoretic foundations of pathfinder networks, Reachability matrix by partitioning and related Boolean results, An approximation algorithm for the TSP, Easy and hard bottleneck location problems, State structures in digital filter configurations. II: Reduced and minimal state structures, An algorithm for the min concave cost flow problem, Proving phylogenetic trees minimal with l-clustering and set partitioning, An O(m log D) algorithm for shortest paths, Complexity of spanning tree problems: Part I, A graph theoretical bound for the p-median problem, Reducibility of minimax to minisum 0-1 programming problems, Irregular gaming areas, Heuristics and their design: A survey, Stochastic spanning tree problem, An approach to the problems of routing optimization in the regions of intricate shape, Optimal assignment of broadcasting frequencies, Algorithms for the m-center problems: A survey, Routing through a network with maximum reliability, Locational analysis, Fast primal and dual heuristics for the \(p\)-median location problem, An extension of the multi-path algorithm for finding Hamilton cycles, Testing logic programs for local stratification, Performance of a neural network method with set partitioning, Constraint satisfaction using constraint logic programming, Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach, Concave cost minimization on networks, Structural modeling in a class of systems using fuzzy sets theory, Establishment of economic production rate, production batch size, and production sequence in manufacturing systems with flexible routing, A high-level dataflow system, A graph colouring model for assigning a heterogeneous workforce to a given schedule, A tree search algorithm for the crew scheduling problem, Facets for node packing, Parallel algorithm to find maximum capacity paths, Some new algorithms for location problems on networks, The maximum clique problem, Mathematical programming models for ownership and control of European and American groups of companies, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Topology related index for performance comparison of blocking symmetrical networks, Cluster analysis and mathematical programming, Solving the anti-covering location problem using Lagrangian relaxation, A suboptimal solution to a hierarchical network design problem using dynamic programming, Graph theoretic relaxations of set covering and set partitioning problems, Neighborhood search heuristics for the uncapacitated facility location problem, A dynamic programming based algorithm for the crew scheduling problem., Solving a vehicle routing problem by balancing the vehicles time utilization., Branch and peg algorithms for the simple plant location problem., The BNR model: Foundations and performance of a Bayesian network-based retrieval model., Constraint propagation techniques for the disjunctive scheduling problem, Branch and peg algorithms for the simple plant location problem, A computational study of several heuristics for the DRPP, Analysis of loop methods for simulating gas networks, Voronoi diagrams with barriers and on polyhedra for minimal path planning, The algorithmic structure of a decision support system for a design of a district heating network, Efficient automated pallet loading, The simple plant location problem: Survey and synthesis, Two routing problems with the limitation of fuel, Computer aided analysis and optimal design of mechanical systems using vector-network techniques, Graph partitioning applied to the logic testing of combinational circuits, Completeness of vector discrete optimization problems, Asymptotic approach to the problem of \(k\)-median of a graph, Confidence regional method of stochastic spanning tree problem, Routing problems: A bibliography, Polygon scheduling, Optimal paths in network games with \(p\) players, Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks, Parallel resource co-allocation for the computational grid, Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph, The Location of Public Schools: Evaluation of Practical Experiences, Independency relationships and learning algorithms for singly connected networks, The absolute center of a network, Iterative coloring extension of a maximum clique, Decomposition for augmented forms of large-scale systems, Un algoritmo para determinar las medianas absolutas generales sobre una red tipo arbol, The Bounded Path Tree Problem, Colouring Steiner quadruple systems, Models and solution techniques for frequency assignment problems, Set covering and Serre's theorem on the cohomology algebra of a \(p\)-group, An algorithm for the steiner problem in graphs, The three-dimensional assignment and partition problems. New lower bounds, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Embedding a novel objective function in a two-phased local search for robust vertex coloring, Density based fuzzy \(c\)-means clustering of non-convex patterns, A constructive algorithm for max-min paths problems on energy networks, Cyclic schedules for r irregularity occurring events, Bounding vertex coloring by truncatedmultistage branch and bound, Covering, Packing and Generalized Perfection, Minimax trees, paths, and cut sets, On the sum of all distances in a graph or digraph, Una variante del algoritmo de Edmonds para acoplamientos Maximos, The Dynamic Behaviour of Non-Homogeneous Single-Unireducible Markov and Semi-Markov Chains, Stochastic bottleneck spanning tree problem, Frutex y caminos nodales, The traveling salesman problem: An update of research, Unnamed Item, Unnamed Item, Factors in a class of regular digraphs, Certain exact and approximate algorithms for solving precedence problems with constraints, Unnamed Item, Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh, Unnamed Item, Minisum location of a traveling salesman, Postman tour on a graph with precedence relation on arcs, Probabilistic partitioning algorithms for the rectilinear steiner problem, El problema del arbol minimal para grafos difusos, A functional equation for finding the largest expected capacity of a graph, Planarity testing of doubly periodic infinite graphs, A dual algorithm for the constrained shortest path problem, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, A restricted Lagrangean approach to the traveling salesman problem, Multiterminal network flows and applications, Optimal sharing, The generalized P‐forest problem on a tree network, A polynomial time algorithm for finding the absolute center of a network, A shortest path algorithm for grid graphs, Cost allocation for steiner trees, Analysis and control of fuzzy systems using finite discrete relations
