scientific article; zbMATH DE number 3573595
From MaRDI portal
Publication:4145427
Cited in
(14)- The skiving stock problem and its relation to hypergraph matchings
- Heuristic algorithms based on column generation for an online product shipping problem
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- The cutting stock problem applied to the hardening process in an automotive spring factory
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Improved flow-based formulations for the skiving stock problem
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The proper relaxation and the proper gap of the skiving stock problem
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Mathematical models and decomposition methods for the multiple knapsack problem
- Bin packing and related problems: general arc-flow formulation with graph compression
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145427)
