arrow
Return

The ordered capacitated facility location problem

delete2009-04-19
delete35
PRE
AI
J
Jörg Kalcsics
S
Stefan Nickel
J
Justo Puerto
A
Antonio M. Rodríguez‐Chía *
DOI:10.1007/s11750-009-0089-0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

T
TOP
IF:
1.4
Papers:
12
Citations:
711

Organization

K
karlsruhe institute of technology
Scholars:
2.0W
Papers: 1.4W
Citations: 23
H
Helmholtz Association
Scholars:
13.2W
Papers: 10.7W
Citations: 145
U
University of Sevilla
Scholars:
1.9W
Papers: 1.7W
Citations: 15
researcher View more organizations