Home > Research > Publications & Outputs > Polynomial-time separation of simple comb inequ...
View graph of relations

Polynomial-time separation of simple comb inequalities

Research output: Contribution to conference - Without ISBN/ISSN Conference paper

Published

Standard

Polynomial-time separation of simple comb inequalities. / Letchford, Adam.

2002. Paper presented at 6th Aussois Workshop on Combinatorial Optimisation, Aussois, France.

Research output: Contribution to conference - Without ISBN/ISSN Conference paper

Harvard

Letchford, A 2002, 'Polynomial-time separation of simple comb inequalities', Paper presented at 6th Aussois Workshop on Combinatorial Optimisation, Aussois, France, 7/01/02 - 11/01/02.

APA

Letchford, A. (2002). Polynomial-time separation of simple comb inequalities. Paper presented at 6th Aussois Workshop on Combinatorial Optimisation, Aussois, France.

Vancouver

Letchford A. Polynomial-time separation of simple comb inequalities. 2002. Paper presented at 6th Aussois Workshop on Combinatorial Optimisation, Aussois, France.

Author

Letchford, Adam. / Polynomial-time separation of simple comb inequalities. Paper presented at 6th Aussois Workshop on Combinatorial Optimisation, Aussois, France.1 p.

Bibtex

@conference{b6c8b97382ff467a9ba87f012aae7433,
title = "Polynomial-time separation of simple comb inequalities",
keywords = "travelling salesman problem, cutting planes",
author = "Adam Letchford",
year = "2002",
month = jan
language = "English",
note = "6th Aussois Workshop on Combinatorial Optimisation ; Conference date: 07-01-2002 Through 11-01-2002",

}

RIS

TY - CONF

T1 - Polynomial-time separation of simple comb inequalities

AU - Letchford, Adam

PY - 2002/1

Y1 - 2002/1

KW - travelling salesman problem

KW - cutting planes

M3 - Conference paper

T2 - 6th Aussois Workshop on Combinatorial Optimisation

Y2 - 7 January 2002 through 11 January 2002

ER -