THe Use of the Box Step Method in Discrete Optimization
The Boxstep method is used to maximize Lagrangean functions in the context of a branch-and-bound algorithm for the general discrete optimization problem. Results are presented for three applications: facility location, multi-item production scheduling, and single machine scheduling. The performance of the Boxstep method is contrasted with that of the subgradient optimization method.
|Date of creation:||May 1975|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.nber.org
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bernard P. Dzielinski & Ralph E. Gomory, 1965. "Optimal Programming of Lot Sizes, Inventory and Labor Allocations," Management Science, INFORMS, vol. 11(9), pages 874-890, July.
- Arthur M. Geoffrion, 1970. "Elements of Large-Scale Mathematical Programming Part I: Concepts," Management Science, INFORMS, vol. 16(11), pages 652-675, July.
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:0086. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.