A branch-and-cut algorithm for the maximum benefit Chinese postman problem

  1. Corberán, A.
  2. Plana, I.
  3. Rodríguez-Chía, A.M.
  4. Sanchis, J.M.
Journal:
Mathematical Programming

ISSN: 0025-5610,  1436-4646

Year of publication: 2013

Volume: 141

Issue: 1-2

Pages: 21-48

Type: Article

DOI: 10.1007/S10107-011-0507-6 GOOGLE SCHOLAR
Data source: Scopus