The ordered capacitated facility location problem

Jörg Kalcsics; Stefan Nickel; Justo Puerto; Antonio M. Rodríguez-Chía

doi:10.1007/s11750-009-0089-0

The ordered capacitated facility location problem

Jörg Kalcsics, Stefan Nickel, Justo Puerto, Antonio M. Rodríguez-Chía

School of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.

Original language	English
Pages (from-to)	203-222
Number of pages	20
Journal	TOP
Volume	18
Issue number	1
DOIs	https://doi.org/10.1007/s11750-009-0089-0
Publication status	Published - 2010

Keywords

Discrete location
Mixed integer programming
Strategic planning

Access to Document

10.1007/s11750-009-0089-0

Cite this

@article{4074d7686df342b7861b26042d2875c1,

title = "The ordered capacitated facility location problem",

abstract = "In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.",

keywords = "Discrete location, Mixed integer programming, Strategic planning",

author = "J{\"o}rg Kalcsics and Stefan Nickel and Justo Puerto and Rodr{\'i}guez-Ch{\'i}a, {Antonio M.}",

year = "2010",

doi = "10.1007/s11750-009-0089-0",

language = "English",

volume = "18",

pages = "203--222",

journal = "TOP",

issn = "1134-5764",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - The ordered capacitated facility location problem

AU - Kalcsics, Jörg

AU - Nickel, Stefan

AU - Puerto, Justo

AU - Rodríguez-Chía, Antonio M.

PY - 2010

Y1 - 2010

N2 - In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.

AB - In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.

KW - Discrete location

KW - Mixed integer programming

KW - Strategic planning

UR - http://www.scopus.com/inward/record.url?scp=77956961885&partnerID=8YFLogxK

U2 - 10.1007/s11750-009-0089-0

DO - 10.1007/s11750-009-0089-0

M3 - Article

AN - SCOPUS:77956961885

VL - 18

SP - 203

EP - 222

JO - TOP

JF - TOP

SN - 1134-5764

IS - 1

ER -

The ordered capacitated facility location problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this