scientific article; zbMATH DE number 4211828
From MaRDI portal
Publication:3360020
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(17)- Tight integral duality gap in the Chinese postman problem
- Cardinality constrained minimum cut problems: complexity and algorithms.
- An approximation algorithm for solving the heterogeneous Chinese postman problem
- Approximating the length of Chinese postman tours
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
- scientific article; zbMATH DE number 6612248 (Why is no real title available?)
- scientific article; zbMATH DE number 3882483 (Why is no real title available?)
- scientific article; zbMATH DE number 3880464 (Why is no real title available?)
- Covering the edges of a graph by circuits
- scientific article; zbMATH DE number 124052 (Why is no real title available?)
- Security routing games with multivehicle Chinese postman problem
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- Arc Routing Problems, Part I: The Chinese Postman Problem
- scientific article; zbMATH DE number 6741960 (Why is no real title available?)
- scientific article; zbMATH DE number 279291 (Why is no real title available?)
- Approximate solutions for the maximum benefit chinese postman problem
- Uncertain multi-objective Chinese postman problem
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 Q3360020)
