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

DOI10.1007/BF02331573zbMath0725.90053MaRDI QIDQ5202833

No author found.

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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for solving fixed charge problems
• Scheduling of power generation via large-scale nonlinear optimization
• Fixed-cost transportation problems
• A branch-and-bound algorithm for solving fixed charge problems
• A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• An approximate solution method for the fixed charge problem
• An approximative algorithm for the fixed charge problem