Pages that link to "Item:Q4766817"
From MaRDI portal
The following pages link to Matching, Euler tours and the Chinese postman (Q4766817):
Displayed 50 items.
- The mixed postman problem (Q754753) (← links)
- Edge-contraction problems (Q794164) (← links)
- On the windy postman problem (Q800837) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- The arc partitioning problem (Q806736) (← links)
- The robot cleans up (Q849139) (← links)
- A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading (Q850321) (← links)
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- On matrices with the Edmonds-Johnson property (Q972620) (← links)
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Distributed testing without encountering controllability and observability problems (Q1028999) (← links)
- Heuristics for the stochastic Eulerian tour problem (Q1043339) (← links)
- The fleet size and mix problem for capacitated arc routing (Q1064973) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- General factors of graphs (Q1085185) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- A construction for binary matroids (Q1102297) (← links)
- A new algorithm for the directed Chinese postman problem (Q1115814) (← links)
- On the windy postman problem on Eulerian graphs (Q1119487) (← links)
- Approximate solutions for the capacitated arc routing problem (Q1121808) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective (Q1133463) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- A graph-theoretical approach to a plotter pen touring problem (Q1162175) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Hamiltonian location problems (Q1173005) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- The synchronization problem in protocol testing and its complexity (Q1183455) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen (Q1233877) (← links)
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
- Cost allocation in the Chinese postman problem (Q1307816) (← links)
- Routeing winter gritting vehicles (Q1317045) (← links)