.png){kind=icon}
Return
The ordered capacitated facility location problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s11750-009-0089-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
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
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
T
IF:
1.4
Papers:
12
Citations:
711
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave View more