Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

The Bin Packing Problem with Setups: Formulation, Structural Properties and Computational Insights

Published: 2025/09/23
  • Roberto Baldacci
  • Fabio Ciccarelli
  • Stefano Coniglio
  • Valerio Dose
  • Fabio Furini
Categories (Mixed) Integer Linear Programming, Combinatorial Optimization Tags bin packing problem, combinatorial optimization, computational experiments, integer linear programming Short URL: https://optimization-online.org/?p=31789

Article

Download

View PDF

Sequential test sampling for stochastic derivative-free optimization
A Multivariate Loss Ratio Approach for Systemic Risk Measurement and Allocation
Log in


Repository

Author List

Months

Categories

Keywords

alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity constrained optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

© 2026 Optimization Online • Child Theme of GeneratePress
For feedback or questions, contact optonline@wid.wisc.edu.