A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production

DOI10.1007/BF02331573MaRDI QIDQ5202833zbMATH OpenFDO

Authors

Publication date 1991

Published in ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundprofit optimizationfixed charge linear programmingsawn timber production

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Recommendations

• A branch-and-bound algorithm for solving fixed charge problems
• An application of deterministic and robust optimization in the wood cutting industry
• A hybrid constraint programming approach to a wood procurement problem with bucking decisions
• A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Integer linear programming for a cutting problem in the wood-processing industry: a case study
• AN OPTIMIZATION APPROACH TO IDENTIFYING TIMBER SUPPLY FUNCTION COEFFICIENTS
• A stochastic programming approach for sawmill production planning
• Application of robust optimization to the Sawmill planning problem
• Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity

Cites work

• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3286663 (Why is no real title available?)
• scientific article; zbMATH DE number 3365049 (Why is no real title available?)
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
• A branch-and-bound algorithm for solving fixed charge problems
• An approximate solution method for the fixed charge problem
• An approximative algorithm for the fixed charge problem
• An efficient algorithm for solving fixed charge problems
• Fixed-cost transportation problems
• Scheduling of power generation via large-scale nonlinear optimization

Cited in

(4)

• A hybrid constraint programming approach to a wood procurement problem with bucking decisions
• Application of optimization for solving a sawing stock problem with a cant sawing pattern
• Exact algorithm for solving a special fixed-charge linear programming problem
• scientific article; zbMATH DE number 4152149 (Why is no real title available?)

This page was built for publication: A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202833)