Operations Research · 1990 · 79 citations · 3 references
Natural SciencesIndustrial EngineeringOptimizationBranch And BoundCombinatorial OptimizationConstrained OptimizationInteger ProgrammingLinear ProgrammingOptimization TheoryBranch-and-cutCutting Stock ProblemInteger Linear ProgrammingLinear Integer OptimizationLinear Programming In ProductionLinear Programming Relaxations
In LP problems with an extremely large number of possible structural variables, solution to optimality is not always required. A bound can be used to terminate such LPs. Such a bound is presented for a class of problem that includes most cutting stock formulations.
3