scientific article; zbMATH DE number 4023051

MaRDI QIDQ3765574zbMATH OpenFDO

Authors Torsten Jeworrek, G. Schulz

Publication date 1987

zbMATH Keywords

heuristicsmixed graphspostman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Publication:3030601
• Finding postal carrier walk paths in mixed graphs
• A heuristic algorithm for the mixed Chinese postman problem
• scientific article; zbMATH DE number 3871059
• An optimal algorithm for the mixed Chinese postman problem

Cited in

(1)

• scientific article; zbMATH DE number 4018800 (Why is no real title available?)

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 Q3765574)