"A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem ..."

Norbert Ascheuer, Michael Jünger, Gerhard Reinelt (2000)

> Home

Details and statistics

DOI: 10.1023/A:1008779125567

access: closed

type: Journal Article

metadata version: 2020-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/coap/AscheuerJR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/AscheuerJR00
Norbert Ascheuer, Michael Jünger, Gerhard Reinelt:
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. 17(1): 61-84 (2000)

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.