A parallel branch-and-bound-and-prune algorithm for irregular strip packing with discrete rotations

Documenti analoghi

• A heuristic for solving the irregular strip packing problem with quantum optimization
  di: Matt, Paul-Amaury, et al.
  Pubblicazione: (2024)
• Outer-space branch-and-bound algorithm for generalized linear multiplicative programs
  di: Zhang, Bo
  Pubblicazione: (2023)
• Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
  di: Hoen, Alexander, et al.
  Pubblicazione: (2024)
• An optimistic planning algorithm for switched discrete-time LQR
  di: Granzotto, Mathieu, et al.
  Pubblicazione: (2025)
• Duality bounds for discrete-time Zames-Falb multipliers
  di: Zhang, Jingfan, et al.
  Pubblicazione: (2020)