Home > Research > Publications & Outputs > Computing upper bounds for the stable set probl...

Associated organisational unit

View graph of relations

Computing upper bounds for the stable set problem using Lagrangian relaxation

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

Published

Standard

Computing upper bounds for the stable set problem using Lagrangian relaxation. / Letchford, Adam.
2013. Paper presented at LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, United Kingdom.

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

Harvard

Letchford, A 2013, 'Computing upper bounds for the stable set problem using Lagrangian relaxation', Paper presented at LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, United Kingdom, 13/05/13 - 15/05/13.

APA

Letchford, A. (2013). Computing upper bounds for the stable set problem using Lagrangian relaxation. Paper presented at LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, United Kingdom.

Vancouver

Letchford A. Computing upper bounds for the stable set problem using Lagrangian relaxation. 2013. Paper presented at LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, United Kingdom.

Author

Letchford, Adam. / Computing upper bounds for the stable set problem using Lagrangian relaxation. Paper presented at LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, United Kingdom.

Bibtex

@conference{cce7cdd1043644cba951465edb19b1e5,
title = "Computing upper bounds for the stable set problem using Lagrangian relaxation",
keywords = "combinatorial optimisation, Lagrangian relaxation ",
author = "Adam Letchford",
note = "Invited talk.; LANCS International Workshop on Discrete and Nonlinear Optimisation ; Conference date: 13-05-2013 Through 15-05-2013",
year = "2013",
month = may,
language = "English",

}

RIS

TY - CONF

T1 - Computing upper bounds for the stable set problem using Lagrangian relaxation

AU - Letchford, Adam

N1 - Invited talk.

PY - 2013/5

Y1 - 2013/5

KW - combinatorial optimisation

KW - Lagrangian relaxation

M3 - Conference paper

T2 - LANCS International Workshop on Discrete and Nonlinear Optimisation

Y2 - 13 May 2013 through 15 May 2013

ER -