Relaxation techniques applied to some loading problems

DOI10.1080/02331939208843800zbMath0817.90071OpenAlexW2037336445MaRDI QIDQ4327925

Peter Värbrand, Kurt O. Jørnsten

Publication date: 27 March 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843800

zbMATH Keywords

Lagrangean relaxationgeneralized binpackinggeneralized assignmentallocation of jobs to machinestwo-stage loading problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Exact methods for the knapsack problem and its generalizations
• Efficient algorithms for the capacitated concentrator location problem
• Fast algorithms for bin packing
• The Trim Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• On a generalized bin-packing problem
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• New Algorithms for Bin Packing
• Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• A branch and bound algorithm for the generalized assignment problem
• An algorithm for a class of loading problems
• Validation of subgradient optimization
• Determining Teaching and Research Efficiencies
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: Relaxation techniques applied to some loading problems