"Efficient separation routines for the symmetric traveling salesman problem ..."

Denis Naddef, Stefan Thienel (2002)

> Home

Details and statistics

DOI: 10.1007/S101070100275

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/NaddefT02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/NaddefT02
Denis Naddef, Stefan Thienel:
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Math. Program. 92(2): 237-255 (2002)

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.