The following pages link to (Q5519709):
Displaying 50 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- On graphs which can or cannot induce Chinese Postman games with a non-empty core (Q442225) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- On Chinese postman games where residents of each road pay the cost of their road (Q550185) (← links)
- Uncertain multi-objective Chinese postman problem (Q780142) (← links)
- The arc partitioning problem (Q806736) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- A classification scheme for vehicle routing and scheduling problems (Q913648) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- On existence of reporter strands in DNA-based graph structures (Q1008723) (← links)
- The fleet size and mix problem for capacitated arc routing (Q1064973) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- A new algorithm for the directed Chinese postman problem (Q1115814) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- The synchronization problem in protocol testing and its complexity (Q1183455) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- On the concavity of delivery games (Q1278793) (← links)
- Cost allocation in the Chinese postman problem (Q1307816) (← links)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- On the mixed Chinese postman problem (Q1319678) (← links)
- Exact solutions for the construction of optimal length test sequences (Q1334626) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- How to tidy up a symmetric set-system by use of uncrossing operations (Q1351503) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- Minimum weight \((T,d)\)-joins and multi-joins (Q1381848) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Solvable cases of the \(k\)-person Chinese postman problem (Q1892106) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- Convergence and correctness of belief propagation for the Chinese postman problem (Q2010094) (← links)
- A characterization for graphs having strong parity factors (Q2045389) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- Königsberg sightseeing: Eulerian walks in temporal graphs (Q2115887) (← links)
- Chinese postman games with multi-located players (Q2183849) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Approximating the length of Chinese postman tours (Q2257098) (← links)
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem (Q2315018) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Graphs inducing totally balanced and submodular Chinese postman games (Q2449131) (← links)
- On Eulerian irregularity in graphs (Q2450133) (← links)
- A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
- Covering partially directed graphs with directed paths (Q2497477) (← links)
- The restricted Chinese postman problems with penalties (Q2670442) (← links)
