Fixed charge problems with identical fixed charges

DOI10.1016/0377-2217(84)90190-5zbMATH Open0544.90078OpenAlexW2015592193MaRDI QIDQ797500FDOQ797500

Authors: 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

Recommendations

• Publication:3481490
• A heuristic algorithm for the fixed charge problem
• A combined cutting-stock and lot-sizing problem
• The interactive fixed charge linear programming problem
• Valid Linear Inequalities for Fixed Charge Problems

zbMATH Keywords

heuristicsresource allocationcutting stockmultiple criteria programmingmanufacturing industriesfixed-charge problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• The fixed charge problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Algorithm for Two-Dimensional Cutting Problems
• The Theory and Computation of Knapsack Functions
• The fixed charge problem. I: A new heuristic method
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• An approximative algorithm for the fixed charge problem

Cited In (11)

• Alternative formulations for a layout problem in the fashion industry
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• Heuristic methods and applications: A categorized survey
• In situ column generation for a cutting-stock problem
• Solution approaches for the cutting stock problem with setup cost
• Title not available (Why is that?)
• An LP-based approach to cutting stock problems with multiple objectives
• The interactive fixed charge linear programming problem
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Limiting the number of each piece in two-dimensional cutting stock patterns
• Knowledge based approach to the cutting stock problem

This page was built for publication: Fixed charge problems with identical fixed charges

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