arXiv:2606. 07403v1 Announce Type: cross Abstract: Benders decomposition is a fundamental framework for solving large-scale mixed-integer optimization problems with complicating variables that, when fixed, yield significantly easier subproblems.
A friendly introduction to one of the most powerfull optimization techniques using the uncapacitated facility location problem The post How Benders Decomposition Works Part I: Optimality Cuts appeared first on Towards Data Science .
arXiv:2607. 22550v1 Announce Type: cross Abstract: We propose a learning-augmented Benders decomposition framework to solve large-scale two-stage stochastic mixed-integer programs.
arXiv:2508. 20330v5 Announce Type: replace Abstract: Combinatorial optimization problems are ubiquitous in science and engineering.
arXiv:2601. 06542v2 Announce Type: replace-cross Abstract: In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for production scheduling, where energy price is part of the criteria and one highly energy-demanding machine can be in one of the following three states: proc, idle, or off.
arXiv:2605. 25246v3 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used for optimization modeling and solver-code generation, yet practical operations research and optimization problems often require a harder capability: designing scalable algorithms that exploit problem structure and outperform direct formulation-and-solve baselines.
arXiv:2608. 11230v1 Announce Type: new Abstract: This paper introduces the edge-based contiguous p-median (ECpM) problem to partition the roads in a network into a given number of compact and contiguous territories.
arXiv:2604. 23053v2 Announce Type: replace Abstract: Mixed Binary Quadratic Programs (MBQPs) are an important and complex set of problems in combinatorial optimization.
arXiv:2608. 07040v1 Announce Type: new Abstract: Solving combinatorial optimization problems (COPs) requires not only efficient algorithms but also carefully crafted formulations.
arXiv:2607. 21354v1 Announce Type: new Abstract: For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects.
arXiv:2406. 10407v3 Announce Type: replace-cross Abstract: Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science.
arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
arXiv:2607. 17398v1 Announce Type: cross Abstract: Analytical placers rely on differentiable objective functions to guide placement, typically combining intermediate surrogate metrics such as half-perimeter wirelength (HPWL) and cell-density penalties.