Home > Research > Publications & Outputs > Separation algorithms for 0-1 knapsack polytopes
View graph of relations

Separation algorithms for 0-1 knapsack polytopes

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

Published

Standard

Separation algorithms for 0-1 knapsack polytopes. / Letchford, Adam.

2008. Paper presented at Bonn Workshop on Combinatorial Optimisation, Bonn, Germany.

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

Harvard

Letchford, A 2008, 'Separation algorithms for 0-1 knapsack polytopes', Paper presented at Bonn Workshop on Combinatorial Optimisation, Bonn, Germany, 3/11/08 - 7/11/08.

APA

Letchford, A. (2008). Separation algorithms for 0-1 knapsack polytopes. Paper presented at Bonn Workshop on Combinatorial Optimisation, Bonn, Germany.

Vancouver

Letchford A. Separation algorithms for 0-1 knapsack polytopes. 2008. Paper presented at Bonn Workshop on Combinatorial Optimisation, Bonn, Germany.

Author

Letchford, Adam. / Separation algorithms for 0-1 knapsack polytopes. Paper presented at Bonn Workshop on Combinatorial Optimisation, Bonn, Germany.1 p.

Bibtex

@conference{70c4f6aee41f46bc8b54fc3ef3cd1e3c,
title = "Separation algorithms for 0-1 knapsack polytopes",
keywords = "integer programming, combinatorial optimisation, knapsack problems, cutting planes",
author = "Adam Letchford",
year = "2008",
month = nov
language = "English",
note = "Bonn Workshop on Combinatorial Optimisation ; Conference date: 03-11-2008 Through 07-11-2008",

}

RIS

TY - CONF

T1 - Separation algorithms for 0-1 knapsack polytopes

AU - Letchford, Adam

PY - 2008/11

Y1 - 2008/11

KW - integer programming

KW - combinatorial optimisation

KW - knapsack problems

KW - cutting planes

M3 - Conference paper

T2 - Bonn Workshop on Combinatorial Optimisation

Y2 - 3 November 2008 through 7 November 2008

ER -