Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints

Documenti analoghi

• Strong bounds for large-scale Minimum Sum-of-Squares Clustering
  di: Croella, Anna Livia, et al.
  Pubblicazione: (2025)
• Beyond binarity: Semidefinite programming for ternary quadratic problems
  di: de Meijer, Frank, et al.
  Pubblicazione: (2026)
• Optimization meets Machine Learning: An Exact Algorithm for Semi-Supervised Support Vector Machines
  di: Piccialli, Veronica, et al.
  Pubblicazione: (2023)
• A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering
  di: Sudoso, Antonio M., et al.
  Pubblicazione: (2024)
• A new polynomially solvable class of quadratic optimization problems with box constraints
  di: Hladík, Milan, et al.
  Pubblicazione: (2019)