scientific article; zbMATH DE number 3503127
From MaRDI portal
Publication:4083324
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Algorithms in computer science (68W99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Analytic circuit theory (94C05) Applications of graph theory to circuits and networks (94C15)
Recommendations
- scientific article; zbMATH DE number 3906496
- scientific article; zbMATH DE number 2202358
- Graphs, networks and algorithms. Transl. from the 3rd German edition by Tilla Schade
- scientific article; zbMATH DE number 52226
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
Cited in
(only showing first 100 items - show all)- Interval-parameter optimization problems on graphs
- Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads
- 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
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- The decomposition problem for the set of paths in a directed graph and its application
- Lower tolerance-based branch and bound algorithms for the ATSP
- 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
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- 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
- Models and methods for solving the problem of network vulnerability
- The symmetric travelling salesman problem. II: New low bounds
- Optimal paths in network games with \(p\) players
- Bin packing problem with conflicts and item fragmentation
- On certain aspects of topological indices
- Hamiltonian cycle curves in the space of discounted occupational measures
- Two-machine routing open shop: How long is the optimal makespan?
- In memoriam: Nicos Christofides (1942--2019)
- Worst-case analysis of a new heuristic for the travelling salesman problem
- A bag-of-paths framework for network data analysis
- Schedulability analysis for strictly periodic tasks in RTOS
- Irreducible bin packing and normality in routing open shop
- Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron
- An auction-based approach for the re-optimization shortest path tree problem
- 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
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- Preface: Algorithmic graph theory on the Adriatic coast
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083324)
