Fixed charge problems with identical fixed charges
DOI10.1016/0377-2217(84)90190-5zbMath0544.90078OpenAlexW2015592193MaRDI QIDQ797500
Alan A. Farley, Kenneth V. Richardson
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90190-5
heuristicsresource allocationcutting stockmultiple criteria programmingmanufacturing industriesfixed-charge problem
Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Cites Work
- The fixed charge problem. I: A new heuristic method
- A Linear Programming Approach to the Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- An Algorithm for Two-Dimensional Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- An approximate solution method for the fixed charge problem
- The fixed charge problem
- The Theory and Computation of Knapsack Functions
- An approximative algorithm for the fixed charge problem
- The fixed charge problem