Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
From MaRDI portal
Publication:817190
DOI10.1007/s10479-005-3450-1zbMath1091.90051MaRDI QIDQ817190
Jon Lee, Laszlo Ladanyi, Robin Lougee-Heimer
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3450-1
90C90: Applications of mathematical programming
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- On some difficult linear programs coming from set partitioning
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Cropped cubes
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- The volume algorithm: Producing primal solutions with a subgradient method
- Near-optimal solutions to large-scale facility location problems
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Bid evaluation in procurement auctions with piecewise linear supply curves
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Implementing interior point linear programming methods in the Optimization Subroutine Library
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Mixing mixed-integer inequalities
- A note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems
