0-1/2-cuts, binary split cuts and the traveling salesman problem

Letchford, Adam (2000) 0-1/2-cuts, binary split cuts and the traveling salesman problem. In: 17th International Symposium on Mathematical Programming (ISMP), 2000-08-072000-08-11.

Full text not available from this repository.
Item Type:
Contribution to Conference (Paper)
Journal or Publication Title:
17th International Symposium on Mathematical Programming (ISMP)
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
73538
Deposited By:
Deposited On:
18 Jun 2015 06:16
Refereed?:
Yes
Published?:
Published
Last Modified:
09 Sep 2020 00:08