The capacitated single-allocation hub location problem revisited: a note on a classical formulation
type: Item
instance of: scholarly article
title: The capacitated single-allocation hub location problem revisited: a note on a classical formulation
zbMATH Open document ID: 1205.90174
author: S. Nickel
author: Isabel H. Correia
author: Francisco Saldanha-da-Gama
published in: European Journal of Operational Research
publication date: 2010-09-09T00:00:00Z
full work available at URL: http://nbn-resolving.de/urn/resolver.pl
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5781816
zbMATH Keywords: hub location
zbMATH Keywords: MIP formulations
zbMATH Keywords: transportation
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W1975375864
cites work: Network hub location problems: The state of the art
cites work: Preprocessing and cutting for multiple allocation hub location problems.
cites work: Integer programming formulations of discrete hub location problems
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: Capacitated single allocation hub location problem-A bi-criteria approach
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: A hub covering model for cargo delivery systems
DOI: 10.1016/J.EJOR.2010.04.015
description: scientific article; zbMATH DE number 5781816