The plant location problem with discrete capacities and indivisible customers (Q1608255)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The plant location problem with discrete capacities and indivisible customers |
scientific article; zbMATH DE number 1779317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The plant location problem with discrete capacities and indivisible customers |
scientific article; zbMATH DE number 1779317 |
Statements
The plant location problem with discrete capacities and indivisible customers (English)
0 references
23 November 2002
0 references
The author analyses the properties of the plant location problem with indivisible customers. The analysis is used to reduce the problem to a combinatorial optimization one. The rules for rejecting nonoptimal solutions are formulated and proved. A combinatorial approximation method for discrete programming problems is substantiated. Solution algorithms for the problem are described.
0 references
production-transportation problem
0 references
combinatorial optimization
0 references
approximation method
0 references
algorithm
0 references
discrete programming
0 references
solution
0 references
0 references
0.90102196
0 references
0.8912128
0 references
0.8890672
0 references
0.8790176
0 references
0.8754088
0 references
0.8753017
0 references
0.8746277
0 references
0.87021637
0 references
