A branch and cut algorithm for hub location problems with single assignment

Martine Labbé; Hande Yaman; Eric Gourdin

doi:10.1007/s10107-004-0531-x

A branch and cut algorithm for hub location problems with single assignment

Martine Labbé
, Hande Yaman
, Eric Gourdin

Service d'Optimisation
Université Libre de Bruxelles
Department of Industrial Engineering
Bilkent University
Orange Labs

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

117 Citations (Scopus)

Résumé

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.

langue originale	Anglais
Pages (de - à)	371-405
Nombre de pages	35
journal	Mathematical Programming
Volume	102
Numéro de publication	2
Les DOIs	https://doi.org/10.1007/s10107-004-0531-x
état	Publié - 1 mars 2005
Modification externe	Oui

Accès au document

10.1007/s10107-004-0531-x

Contient cette citation

@article{39808fa2e9924dc986a88269aa3e2aad,

title = "A branch and cut algorithm for hub location problems with single assignment",

abstract = "The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.",

keywords = "Branch and cut, Hub location, Polyhedral analysis",

author = "Martine Labb{\'e} and Hande Yaman and Eric Gourdin",

year = "2005",

month = mar,

day = "1",

doi = "10.1007/s10107-004-0531-x",

language = "English",

volume = "102",

pages = "371--405",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer Science and Business Media Deutschland GmbH",

number = "2",

}

TY - JOUR

T1 - A branch and cut algorithm for hub location problems with single assignment

AU - Labbé, Martine

AU - Yaman, Hande

AU - Gourdin, Eric

PY - 2005/3/1

Y1 - 2005/3/1

N2 - The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.

AB - The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.

KW - Branch and cut

KW - Hub location

KW - Polyhedral analysis

U2 - 10.1007/s10107-004-0531-x

DO - 10.1007/s10107-004-0531-x

M3 - Article

AN - SCOPUS:21144447914

SN - 0025-5610

VL - 102

SP - 371

EP - 405

JO - Mathematical Programming

JF - Mathematical Programming

IS - 2

ER -

A branch and cut algorithm for hub location problems with single assignment

Résumé

Accès au document

Empreinte digitale

Contient cette citation