scientific article; zbMATH DE number 7396880
From MaRDI portal
Publication:5152214
zbMath1477.90042MaRDI QIDQ5152214
Juan Felipe Mendieta Medina, Narciso Rubén de León Rodríguez, Javier Leiva Cáceres
Publication date: 17 September 2021
Full work available at URL: https://rev-inv-ope.pantheonsorbonne.fr/sites/default/files/inline-files/41320-01.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27)
Cites Work
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Solution approaches for the cutting stock problem with setup cost
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
- Heuristic and exact methods for the cutting sequencing problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A method for the cutting stock problem with different qualities
- A typology of cutting and packing problems
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Mathematical Methods of Organizing and Planning Production
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- A Linear Programming Approach to the Cutting-Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication:
