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:
Departments: Lancaster University Management School > Management Science
ID Code: 73538
Deposited By: ep_importer_pure
Deposited On: 18 Jun 2015 06:16
Refereed?: Yes
Published?: Published
Last Modified: 11 Dec 2019 00:38
URI: https://eprints.lancs.ac.uk/id/eprint/73538

Actions (login required)

View Item View Item