The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem

DOI10.1016/0377-2217(93)90335-KzbMath0776.90084MaRDI QIDQ1261382

Chryssi Malandraki, Mark S. Daskin

Publication date: 16 September 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesmandirected graphminimum cost flowroutingmaximum benefit Chinese postman problemlinear integer programmingbranch- and-bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

New results for the directed profitable rural postman problem ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Multiobjective routing problems ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ The profitable close-enough arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ The parking warden tour problem ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ City streets parking enforcement inspection decisions: the Chinese postman's perspective ⋮ Profitable mixed capacitated arc routing and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiobjective programming and planning
• Generalized Subtour Elimination Constraints and Connectivity Constraints
• On Some Generalizations of the Travelling-Salesman Problem
• On the complexity of edge traversing
• On general routing problems
• A fundamental problem in vehicle routing
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem