Home > Research > Publications & Outputs > A faster exact separation algorithm for simple ...
View graph of relations

A faster exact separation algorithm for simple comb inequalities

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

Published

Standard

A faster exact separation algorithm for simple comb inequalities. / Letchford, Adam.

2004. Paper presented at International Symposium on Combinatorial Optimisation (CO2004), Lancaster, United Kingdom.

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

Harvard

Letchford, A 2004, 'A faster exact separation algorithm for simple comb inequalities', Paper presented at International Symposium on Combinatorial Optimisation (CO2004), Lancaster, United Kingdom, 28/03/04 - 31/03/04.

APA

Letchford, A. (2004). A faster exact separation algorithm for simple comb inequalities. Paper presented at International Symposium on Combinatorial Optimisation (CO2004), Lancaster, United Kingdom.

Vancouver

Letchford A. A faster exact separation algorithm for simple comb inequalities. 2004. Paper presented at International Symposium on Combinatorial Optimisation (CO2004), Lancaster, United Kingdom.

Author

Letchford, Adam. / A faster exact separation algorithm for simple comb inequalities. Paper presented at International Symposium on Combinatorial Optimisation (CO2004), Lancaster, United Kingdom.1 p.

Bibtex

@conference{988d9a4274fb4550b764a5358fa3db2b,
title = "A faster exact separation algorithm for simple comb inequalities",
keywords = "combinatorial optimisation, travelling salesman problem, branch-and-cut",
author = "Adam Letchford",
year = "2004",
month = mar
language = "English",
note = "International Symposium on Combinatorial Optimisation (CO2004) ; Conference date: 28-03-2004 Through 31-03-2004",

}

RIS

TY - CONF

T1 - A faster exact separation algorithm for simple comb inequalities

AU - Letchford, Adam

PY - 2004/3

Y1 - 2004/3

KW - combinatorial optimisation

KW - travelling salesman problem

KW - branch-and-cut

M3 - Conference paper

T2 - International Symposium on Combinatorial Optimisation (CO2004)

Y2 - 28 March 2004 through 31 March 2004

ER -