default search action

combined dblp search
author search
venue search
publication search

ask others

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

Angel Corberán et al. (2013)

> Home

Details and statistics

DOI: 10.1007/S10107-011-0507-6

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/CorberanPRS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/CorberanPRS13
Angel Corberán, Isaac Plana, Antonio M. Rodríguez-Chía, José M. Sanchis:
A branch-and-cut algorithm for the maximum benefit Chinese postman problem. Math. Program. 141(1-2): 21-48 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.