A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
From MaRDI portal
Publication:5202025
DOI10.1287/opre.38.5.922zbMath0723.90052OpenAlexW2011441830MaRDI QIDQ5202025
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.5.922
Related Items (26)
Solving binary cutting stock problems by column generation and branch- and-bound ⋮ Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ A branch-and-price algorithm for switch-box routing ⋮ The flexible and real-time commute trip sharing problems ⋮ A column generation approach to job grouping for flexible manufacturing systems ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An exact algorithm for IP column generation ⋮ A Wide Branching Strategy for the Graph Coloring Problem ⋮ Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study ⋮ An integer programming column generation principle for heuristic search methods ⋮ An exact approach for the vertex coloring problem ⋮ Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ A lexicographic pricer for the fractional bin packing problem ⋮ Bidimensional packing by bilinear programming ⋮ An inexact bundle variant suited to column generation ⋮ Solving robust bin-packing problems with a branch-and-price approach ⋮ Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations ⋮ The cutting stock problem in the canvas industry ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems ⋮ Trim-loss pattern rearrangement and its relevance to the flat-glass industry ⋮ A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions ⋮ Column generation extensions of set covering greedy heuristics ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
This page was built for publication: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
