scientific article; zbMATH DE number 3503127
From MaRDI portal
zbMath0321.94011MaRDI QIDQ4083324
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Analytic circuit theory (94C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Algorithms in computer science (68W99)
Related Items
An optimization algorithm for the clearing of interbank payments, Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks, Mathematical programming models for ownership and control of European and American groups of companies, On some factorizations of infinite words by elements of codes, Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Topology related index for performance comparison of blocking symmetrical networks, 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, Optimal design of compact and functionally contiguous conservation management areas, Fast parallel graph searching with applications, Graph theoretic foundations of pathfinder networks, Cluster analysis and mathematical programming, The \(p\)-median problem: a survey of metaheuristic approaches, Traffic assignment in communication satellites, Distance conserving reductions for nonoriented networks, Lyapunov formulation of the ISS cyclic-small-gain theorem for hybrid dynamical networks, Decentralized output-feedback control of large-scale nonlinear systems with sensor noise, Solving the anti-covering location problem using Lagrangian relaxation, Reachability matrix by partitioning and related Boolean results, An approximation algorithm for the TSP, Solving a bicriteria problem of optimal service centers location, Synthesis of optimal controllers for piecewise affine systems with sampled-data switching, Choosing optimal road trajectory with random work cost in different areas, The topological drawing of a graph: construction methods, An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences, Deterministic optimizational problems of transportation logistics, A suboptimal solution to a hierarchical network design problem using dynamic programming, Graph theoretic relaxations of set covering and set partitioning problems, 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, Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool, Neighborhood search heuristics for the uncapacitated facility location 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 SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids, An approach to the problems of routing optimization in the regions of intricate shape, Optimal assignment of broadcasting frequencies, A sector bound approach to feedback control of nonlinear systems with state quantization, The discrete p-dispersion problem, Lyapunov formulation of ISS cyclic-small-gain in continuous-time dynamical networks, Algorithms for the m-center problems: A survey, Lyapunov formulation of the large-scale, ISS cyclic-small-gain theorem: The discrete-time case, Routing through a network with maximum reliability, Locational analysis, Fast primal and dual heuristics for the \(p\)-median location problem, Automation of simulation of multistep relay and switching circuits, An extension of the multi-path algorithm for finding Hamilton cycles, On paths with the shortest average arc length in weighted graphs, Testing logic programs for local stratification, Performance of a neural network method with set partitioning, Lattice flows in networks, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Constraint satisfaction using constraint logic programming, Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach, Equivalent instances of the simple plant location problem, Fuzzy quadratic minimum spanning tree problem, Maximum outflow in generalized flow networks, Computerized generation of motion equations using variational graph-theoretic methods, A constrained \(k\)-means clustering algorithm for classifying spatial units, Inverse center location problem on a tree, 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, Structurally fixed modes: Decomposition and reachability, A tree search algorithm for the crew scheduling problem, Facets for node packing, Parallel algorithm to find maximum capacity paths, Interval-parameter optimization problems on graphs, Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads, Some new algorithms for location problems on networks, 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, 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, The maximum clique problem, Filtrations of the modules for Chevalley groups arising from admissible lattices, Numerical experiences with graph coloring algorithms, The k-neighbor domination problem, Fuzzy colouring of fuzzy graphs, Randomized Shortest-Path Problems: Two Related Models, Data Analytics on Graphs Part I: Graphs and Spectra on Graphs, The affine hull of the schedule polytope for servicing identical requests by parallel devices, The reduction of the Pareto set of a special structure in bicriteria discrete problems, Greedy and adaptive algorithms for multi-depot vehicle routing with object alternation, Bounds on the Steiner radius of a graph, Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems, A uniform self-stabilizing minimum diameter spanning tree algorithm, Approximation algorithms for two-machine proportionate routing open shop on a tree, Quantum field theory on the example of the simplest cubic model, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, Decomposition of a decision-making problem into levels of preference of the majority graph, Recovering the recording sequence in scanned handwritten texts, Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests, Unnamed Item, CRYPTANALYTICAL FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY, 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, Complexity of the max cut problem with the minimal domination constraint, In memoriam: Nicos Christofides (1942--2019), Worst-case analysis of a new heuristic for the travelling salesman problem, Bounding vertex coloring by truncatedmultistage branch and bound, Shortest path reoptimization vs resolution from scratch: a computational comparison, Computer aided analysis and optimal design of mechanical systems using vector-network techniques, A review on algorithms for maximum clique problems, Factors in a class of regular digraphs, GENERALIZED PASCAL’S PYRAMIDS AND DECISION TREES, Iterative coloring extension of a maximum clique, Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks, Cyclic schedules for r irregularity occurring events, Graph partitioning applied to the logic testing of combinational circuits, The generalized P‐forest problem on a tree network, Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane, Completeness of vector discrete optimization problems, Asymptotic approach to the problem of \(k\)-median of a graph, Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions, Confidence regional method of stochastic spanning tree problem, Routing problems: A bibliography, A polynomial time algorithm for finding the absolute center of a network, The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching, Certain exact and approximate algorithms for solving precedence problems with constraints, Polygon scheduling, A maximum dicut in a digraph induced by a minimal dominating set, Online perceptual learning and natural language acquisition for autonomous robots, A bag-of-paths framework for network data analysis, Covering, Packing and Generalized Perfection, Modifications of the two-stage transportation problem and their applications, A dynamic programming based algorithm for the crew scheduling problem., Parallel resource co-allocation for the computational grid, Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh, Solving a vehicle routing problem by balancing the vehicles time utilization., Unnamed Item, Models and methods for solving the problem of network vulnerability, Minisum location of a traveling salesman, Postman tour on a graph with precedence relation on arcs, Probabilistic partitioning algorithms for the rectilinear steiner problem, The symmetric travelling salesman problem. II: New low bounds, El problema del arbol minimal para grafos difusos, Branch and peg algorithms for the simple plant location problem., Optimal paths in network games with \(p\) players, Schedulability analysis for strictly periodic tasks in RTOS, The BNR model: Foundations and performance of a Bayesian network-based retrieval model., HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph, The three-dimensional assignment and partition problems. New lower bounds, The decomposition problem for the set of paths in a directed graph and its application, The Location of Public Schools: Evaluation of Practical Experiences, On the computational complexity of centers locating in a graph, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Irreducible bin packing and normality in routing open shop, A functional equation for finding the largest expected capacity of a graph, Planarity testing of doubly periodic infinite graphs, Minimax trees, paths, and cut sets, Embedding a novel objective function in a two-phased local search for robust vertex coloring, Lower tolerance-based branch and bound algorithms for the ATSP, Branch and peg algorithms for the simple plant location problem, On the sum of all distances in a graph or digraph, A shortest path algorithm for grid graphs, Density based fuzzy \(c\)-means clustering of non-convex patterns, Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron, Una variante del algoritmo de Edmonds para acoplamientos Maximos, Bin packing problem with conflicts and item fragmentation, Independency relationships and learning algorithms for singly connected networks, Cost allocation for steiner trees, The Dynamic Behaviour of Non-Homogeneous Single-Unireducible Markov and Semi-Markov Chains, An auction-based approach for the re-optimization shortest path tree problem, Analysis and control of fuzzy systems using finite discrete relations, On certain aspects of topological indices, Simplified target assignment problem for group engagement of aircraft, The problem of the optimal placing of the information-technological reserve in distributed data processing systems, Decomposition for augmented forms of large-scale systems, A constructive algorithm for max-min paths problems on energy networks, A computational study of several heuristics for the DRPP, Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures, Fuzzy-probabilistic aggregations in the discrete covering problem, DEVELOPMENT OF SPECIAL MATHEMATICAL SOFTWARE USING COMBINATORIAL NUMBERS AND LATTICE STRUCTURE ANALYSIS, A dual algorithm for the constrained shortest path problem, The absolute center of a network, Analysis of loop methods for simulating gas networks, Voronoi diagrams with barriers and on polyhedra for minimal path planning, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, A restricted Lagrangean approach to the traveling salesman problem, The algorithmic structure of a decision support system for a design of a district heating network, Efficient automated pallet loading, Multiterminal network flows and applications, The simple plant location problem: Survey and synthesis, Two routing problems with the limitation of fuel, Constraint propagation techniques for the disjunctive scheduling problem, Stochastic bottleneck spanning tree problem, Frutex y caminos nodales, The traveling salesman problem: An update of research, Unnamed Item, Hamiltonian cycle curves in the space of discounted occupational measures, Un algoritmo para determinar las medianas absolutas generales sobre una red tipo arbol, The Bounded Path Tree Problem, Optimal sharing, Counting Hamiltonian cycles in bipartite graphs, Unnamed Item, Two-machine routing open shop: How long is the optimal makespan?
