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.
- On the mixed Chinese postman problem (Q1319678) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Algorithms for the windy postman problem (Q1332802) (← links)
- Exact solutions for the construction of optimal length test sequences (Q1334626) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← 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)
- Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
- Edge disjoint Polyp Packing (Q1377661) (← links)
- Minimum weight \((T,d)\)-joins and multi-joins (Q1381848) (← links)
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem (Q1388833) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem. (Q1406725) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Rational and integral \(k\)-regular matrices. (Q1420582) (← links)
- On the equivalence between some local and global Chinese postman and traveling salesman graphs (Q1421461) (← links)
- On a min--max theorem on bipartite graphs (Q1422438) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- Districting for salt spreading operations (Q1598721) (← links)
- A generalization of Petersen's theorem (Q1801707) (← links)
- A computational study of several heuristics for the DRPP (Q1804375) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- Four problems on graphs with excluded minors (Q1823871) (← links)
- Master polytopes for cycles of binary matroids (Q1824625) (← links)
- Minimal length test vectors for multiple-fault detection (Q1826631) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Time-constrained Chinese postman problems (Q1886476) (← links)
- Solvable cases of the \(k\)-person Chinese postman problem (Q1892106) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- A capacitated general routing problem on mixed networks (Q1894722) (← links)
- Algorithms for the Chinese postman problem on mixed networks (Q1894723) (← links)
- Algorithms for the rural postman problem (Q1906937) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An algorithm for the hierarchical Chinese postman problem (Q1970425) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Optimization with binet matrices (Q2467475) (← links)
- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem (Q2475838) (← links)
- Series-parallel graphs are windy postman perfect (Q2476276) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
- Privatized rural postman problems (Q2496044) (← links)
- Covering partially directed graphs with directed paths (Q2497477) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing (Q2565778) (← links)
- Complete open-state testing of limitedly nondeterministic systems (Q2654997) (← links)