Home > Research > Publications & Outputs > Generalised network design polyhedra
View graph of relations

Generalised network design polyhedra

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Generalised network design polyhedra. / Feremans, Corinne; Labbé, Martine; Letchford, Adam N. et al.
In: Networks, Vol. 58, No. 2, 09.2011, p. 125-136.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Feremans, C, Labbé, M, Letchford, AN & Salazar-González, J-J 2011, 'Generalised network design polyhedra', Networks, vol. 58, no. 2, pp. 125-136. https://doi.org/10.1002/net.20455

APA

Feremans, C., Labbé, M., Letchford, A. N., & Salazar-González, J-J. (2011). Generalised network design polyhedra. Networks, 58(2), 125-136. https://doi.org/10.1002/net.20455

Vancouver

Feremans C, Labbé M, Letchford AN, Salazar-González J-J. Generalised network design polyhedra. Networks. 2011 Sept;58(2):125-136. doi: 10.1002/net.20455

Author

Feremans, Corinne ; Labbé, Martine ; Letchford, Adam N. et al. / Generalised network design polyhedra. In: Networks. 2011 ; Vol. 58, No. 2. pp. 125-136.

Bibtex

@article{d95bb2de1e4d40caadb7de2268b58d11,
title = "Generalised network design polyhedra",
abstract = "In recent years, there has been an increased literature on so-called generalized network design problems (GNDPs), such as the generalized minimum spanning tree problem and the generalized traveling salesman problem. In a GNDP, the node set of a graph is partitioned into “clusters”, and the feasible solutions must contain one node from each cluster. Up to now, the polyhedra associated with different GNDPs have been studied independently. The purpose of this article is to show that it is possible, to a certain extent, to derive polyhedral results for all GNDPs simultaneously. Along the way, we point out some interesting connections to other polyhedra, such as the quadratic semiassignment polytope and the boolean quadric polytope.",
keywords = "generalized minimum spanning tree problem, generalized traveling salesman problem, polyhedral combinatorics",
author = "Corinne Feremans and Martine Labb{\'e} and Letchford, {Adam N.} and Juan-Jos{\'e} Salazar-Gonz{\'a}lez",
year = "2011",
month = sep,
doi = "10.1002/net.20455",
language = "English",
volume = "58",
pages = "125--136",
journal = "Networks",
issn = "0028-3045",
publisher = "Blackwell-Wiley",
number = "2",

}

RIS

TY - JOUR

T1 - Generalised network design polyhedra

AU - Feremans, Corinne

AU - Labbé, Martine

AU - Letchford, Adam N.

AU - Salazar-González, Juan-José

PY - 2011/9

Y1 - 2011/9

N2 - In recent years, there has been an increased literature on so-called generalized network design problems (GNDPs), such as the generalized minimum spanning tree problem and the generalized traveling salesman problem. In a GNDP, the node set of a graph is partitioned into “clusters”, and the feasible solutions must contain one node from each cluster. Up to now, the polyhedra associated with different GNDPs have been studied independently. The purpose of this article is to show that it is possible, to a certain extent, to derive polyhedral results for all GNDPs simultaneously. Along the way, we point out some interesting connections to other polyhedra, such as the quadratic semiassignment polytope and the boolean quadric polytope.

AB - In recent years, there has been an increased literature on so-called generalized network design problems (GNDPs), such as the generalized minimum spanning tree problem and the generalized traveling salesman problem. In a GNDP, the node set of a graph is partitioned into “clusters”, and the feasible solutions must contain one node from each cluster. Up to now, the polyhedra associated with different GNDPs have been studied independently. The purpose of this article is to show that it is possible, to a certain extent, to derive polyhedral results for all GNDPs simultaneously. Along the way, we point out some interesting connections to other polyhedra, such as the quadratic semiassignment polytope and the boolean quadric polytope.

KW - generalized minimum spanning tree problem

KW - generalized traveling salesman problem

KW - polyhedral combinatorics

U2 - 10.1002/net.20455

DO - 10.1002/net.20455

M3 - Journal article

VL - 58

SP - 125

EP - 136

JO - Networks

JF - Networks

SN - 0028-3045

IS - 2

ER -