|
11. |
On a generalized bin‐packing problem |
|
Naval Research Logistics Quarterly,
Volume 29,
Issue 1,
1982,
Page 119-145
R. T. Lewis,
R. G. Parker,
Preview
|
PDF (1355KB)
|
|
摘要:
AbstractIn this paper we address a bin‐packing problem which possesses a variety of modifications of the classic theme. Among these are bin‐dependent chip weights, bin costs, and bin‐dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch‐and‐bound framework in order to solve the problem after which substantial computational experience is
ISSN:0028-1441
DOI:10.1002/nav.3800290112
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
12. |
An integer programming algorithm for portfolio selection with fixed charges |
|
Naval Research Logistics Quarterly,
Volume 29,
Issue 1,
1982,
Page 147-150
Mary W. Cooper,
Keyvan Farhangian,
Preview
|
PDF (262KB)
|
|
摘要:
AbstractA mean‐variance portfolio selection model with limited diversification is formulated in which transaction and management costs are incorporated as the sum of a linear cost and a fixed cost. The problem is a fixed charge integer programming problem solved by hypersurface search using dynamic programming. Fathoming is performed in the forward pass of dynamic programming so that values of the state variable which correspond to infeasible solutions are eliminated from the tables. This logic permits the solution of problems with 20–30 possible investme
ISSN:0028-1441
DOI:10.1002/nav.3800290113
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
13. |
Scheduling of a single machine to minimize total weighted completion time subject to release dates |
|
Naval Research Logistics Quarterly,
Volume 29,
Issue 1,
1982,
Page 151-167
Lucio Bianco,
Salvatore Ricciardelli,
Preview
|
PDF (763KB)
|
|
摘要:
AbstractIn this paper then/1/rjΣjwjCjproblem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are obtained and a branch and bound algorithm is proposed. Computational results are reported and discussed
ISSN:0028-1441
DOI:10.1002/nav.3800290114
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
14. |
A note on splitting the bump in an elimination factorization |
|
Naval Research Logistics Quarterly,
Volume 29,
Issue 1,
1982,
Page 169-178
R. V. Helgaso,
J. L. Kennington,
Preview
|
PDF (424KB)
|
|
摘要:
AbstractThis exposition presents a method for incorporating a technique known as “splitting the bump” within an elimination form reinversion algorithm. This procedure is designed to reduce fill‐in during reinversion and should improve the efficiency of linear programming systems which already use the superior elimination form of the in
ISSN:0028-1441
DOI:10.1002/nav.3800290115
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
15. |
A note on solving multifacility location problems involving euclidean distances |
|
Naval Research Logistics Quarterly,
Volume 29,
Issue 1,
1982,
Page 179-180
Henrik Juel,
Preview
|
PDF (121KB)
|
|
摘要:
AbstractThis note considers a recently proposed solution method for a multifacility location problem. It is shown that the method does not always produce an optimal solution.
ISSN:0028-1441
DOI:10.1002/nav.3800290116
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
16. |
Masthead |
|
Naval Research Logistics Quarterly,
Volume 29,
Issue 1,
1982,
Page -
Preview
|
PDF (77KB)
|
|
ISSN:0028-1441
DOI:10.1002/nav.3800290101
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1982
数据来源: WILEY
|
|