Relaxation techniques applied to some loading problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3907673
- Relaxation of problems of optimal structural design
- Relaxation methods and coupling procedures
- scientific article; zbMATH DE number 1284347
- Relaxation for some dynamical problems
- scientific article; zbMATH DE number 4039147
- Relaxation methods applied to engineering problems. X. The graphical representation of stress
Cites work
- A branch and bound algorithm for the generalized assignment problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- An algorithm for a class of loading problems
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Determining Teaching and Research Efficiencies
- Efficient algorithms for the capacitated concentrator location problem
- Exact methods for the knapsack problem and its generalizations
- Fast algorithms for bin packing
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- scientific article; zbMATH DE number 3423800 (Why is no real title available?)
- Multistage Cutting Stock Problems of Two and More Dimensions
- New Algorithms for Bin Packing
- On a generalized bin-packing problem
- The trim problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Validation of subgradient optimization
This page was built for publication: Relaxation techniques applied to some loading problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327925)
