scientific article; zbMATH DE number 3231691
From MaRDI portal
Publication:5519709
zbMath0143.41904MaRDI QIDQ5519709
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Exact solutions for the construction of optimal length test sequences, Conservative weightings and ear-decompositions of graphs, A quick proof of Seymour's theorem on t-joins, Approximation algorithms for solving the constrained arc routing problem in mixed graphs, Binary group and Chinese postman polyhedra, Solvable cases of the \(k\)-person Chinese postman problem, Operations research games: A survey. (With comments and rejoinder), How to tidy up a symmetric set-system by use of uncrossing operations, Undirected distances and the postman-structure of graphs, The Schrijver system of odd join polyhedra, Linear-Time Approximation for Maximum Weight Matching, GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance, A new algorithm for the directed Chinese postman problem, Multiflows and disjoint paths of minimum total cost, Minimum weight \((T,d)\)-joins and multi-joins, Districting for Arc Routing, The restricted Chinese postman problems with penalties, Chinese postman games with multi-located players, A new view on rural postman based on Eulerian extension and matching, Reviews Graph Theory in America: The First Hundred Years . By Robin Wilson, John J. Watkins, and David J. Parks, Princeton University Press, 2023. 320 pp., ISBN 978-0691194028, $35.00., On matchings, T‐joins, and arc routing in road networks, Arc routing problems: A review of the past, present, and future, Editing to Eulerian graphs, A characterization of minimal non-Seymour graphs, Improving a constructive heuristic for the general routing problem, Eulerian walks in temporal graphs, Covering a graph with cycles., Heuristics and their design: A survey, On graphs which can or cannot induce Chinese Postman games with a non-empty core, A classification scheme for vehicle routing and scheduling problems, Unnamed Item, Graphs inducing totally balanced and submodular Chinese postman games, On Eulerian irregularity in graphs, The synchronization problem in protocol testing and its complexity, An Excluded Minor Characterization of Seymour Graphs, Approximation algorithms for some min-max postmen cover problems, Polarity and the complexity of the shooting experiment, A Decade of Capacitated Arc Routing, Hierarchical Chinese postman problem with fuzzy travel times, A cutting plane algorithm for the windy postman problem, Finding thet-join structure of graphs, My experiences as a student and researcher in OR during the 1960's and 70's, Approximating the length of Chinese postman tours, On shortest \(T\)-joins and packing \(T\)-cuts, Convergence and correctness of belief propagation for the Chinese postman problem, On Chinese postman games where residents of each road pay the cost of their road, A constraint programming approach to the Chinese postman problem with time windows, Covering partially directed graphs with directed paths, On existence of reporter strands in DNA-based graph structures, A characterization for graphs having strong parity factors, Genetic algorithm for Chinese postman problems, On Four Problems in Graph Theory, Edge-outer graph embedding and the complexity of the DNA reporter strand problem, On the concavity of delivery games, Ear decompositions of join covered graphs, Uncertain multi-objective Chinese postman problem, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, A GRASP heuristic for the mixed Chinese postman problem, Cost allocation in the Chinese postman problem, An integer programming approach for the Chinese postman problem with time-dependent travel time, The fleet size and mix problem for capacitated arc routing, A fast algorithm for maximum integral two-commodity flow in planar graphs, Approximation algorithms for solving the heterogeneous Chinese postman problem, The arc partitioning problem, Matching, Euler tours and the Chinese postman, On the mixed Chinese postman problem, Königsberg sightseeing: Eulerian walks in temporal graphs
