![]() | ![]() |
| 1993 | ||
|---|---|---|
| 1 | Jean-Maurice Clochard, Denis Naddef: Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. IPCO 1993: 291-311 | |
| 1 | Denis Naddef | [1] |
Data released under the ODC-BY 1.0 license — See also our legal information page