Name
Title | ||
|---|---|---|
A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production |
Abstract | ||
|---|---|---|
This paper deals with the problem of profit optimization in sawn timber production, utilizing a special type of sawmill. Expected
rejects and resetting costs are taken into consideration. The present problem is formulated as a fixed charge linear programming
problem involving identical fixed charges, one equality constraint and explicit bounds on the variables. Based on the greedy
sorting of the variables we develop a branch-and-bound algorithm working on a special subset of all solutions. Through usage
of the problem structure for constructing bounds we arrive at an acceptable CPU-time (on a 80386 personal computer) for practical
purposes. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF02331573 | ZOR - Meth. & Mod. of OR |
DocType | Volume | Issue |
Journal | 35 | 2 |
Citations | PageRank | References |
1 | 0.82 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Haberl | 1 | 1 | 0.82 |
| Chr Nowak | 2 | 1 | 0.82 |
| H. Stettner | 3 | 1 | 0.82 |
| G. Stoiser | 4 | 1 | 0.82 |
| H. Woschitz | 5 | 1 | 0.82 |