The following pages link to (Q4145427):
Displaying 14 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
- The cutting stock problem applied to the hardening process in an automotive spring factory (Q6161253) (← links)
