search query: @author Farley, A. A. / total: 4
reference: 1 / 4
« previous | next »
| Author: | Farley, A. A. |
| Title: | A note on bounding a class of linear programming problems, including cutting stock problems. |
| Journal: | Operations Research
1990 : SEP-OCT, VOL. 38:5, p. 922-923 |
| Index terms: | LINEAR PROGRAMMING |
| Language: | eng |
| Abstract: | The capacitated warehouse problem is examined, where fixed costs, generally relating to the installation of warehouses and variable costs, consisting mainly of transportation costs, are minimized. The minimization of each kind of cost drives the solution towards opposite directions with respect to the number of the warehouses to be opened/closed. Therefore, dominance criteria between fixed and variable costs are examined. This leads to exact tests as well as greedy heuristics, the latter known in the literature as ADD/DROP techniques. |
« previous | next »
SCIMA