On the mixed Chinese postman problem

  • Authors:

  • T. K. Ralphs

  • Affiliations:

  • School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral.