Computational study of a column generation algorithm for bin packing and cutting stock problems
From MaRDI portal
Publication:1970365
DOI10.1007/s101070050105zbMath0949.90066OpenAlexW1992439238MaRDI QIDQ1970365
Publication date: 5 December 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050105
Related Items
Families of non-IRUP instances of the one-dimensional cutting stock problem, A residual recombination heuristic for one-dimensional cutting stock problems, Column Generation based Primal Heuristics, A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, Ranking lower bounds for the bin-packing problem, Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes, Procedures for the bin packing problem with precedence constraints, Bin packing and cutting stock problems: mathematical models and exact algorithms, Models for the two-dimensional two-stage cutting stock problem with multiple stock size, Column generation based heuristic for tactical planning in multi-period vehicle routing, A note on the approximability of cutting stock problems, Alternative configurations for cutting machines in a tube cutting mill, A branch and price algorithm for the pharmacy duty scheduling problem, A branch and price approach for deployment of multi-tier software services in clouds, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, New bin packing fast lower bounds, Arc-flow approach for single batch-processing machine scheduling, Features for the 0-1 knapsack problem based on inclusionwise maximal solutions, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Improving fleet utilization for carriers by interval scheduling, On the one-dimensional stock cutting problem in the paper tube industry, Worst-case analysis of the subset sum algorithm for bin packing., Branching in branch-and-price: A generic scheme, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Two-dimensional knapsack-block packing problem, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Tolerance analysis for 0-1 knapsack problems, Layout optimisation for an installation port of an offshore wind farm, Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem, Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets, Lower bounds and algorithms for the 2-dimensional vector packing problem, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Characterizing the optimality gap and the optimal packings for the bin packing problem, A nested column generation algorithm to the meta slab allocation problem in the steel making industry, One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming, Stabilized branch-and-price algorithms for vector packing problems, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, Dual Inequalities for Stabilized Column Generation Revisited, Column-Generation in Integer Linear Programming, An inexact bundle variant suited to column generation, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, Projective Cutting-Planes, On column generation formulations for the RWA problem, Approximation algorithms for knapsack problems with cardinality constraints, Knapsack problems with setups, Modified subset sum heuristics for bin packing, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, LP models for bin packing and cutting stock problems, A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Fast lifting procedures for the bin packing problem, Evaluation of algorithms for one-dimensional cutting, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
