Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound ..."

Robert S. Garfinkel (1973)

> Home

Details and statistics

DOI: 10.1287/OPRE.21.1.340

access: closed

type: Journal Article

metadata version: 2020-03-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ior/Garfinkel73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/Garfinkel73
Robert S. Garfinkel:
Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem. Oper. Res. 21(1): 340-343 (1973)

a service of

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.