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 .
Learning about Farkas' lemma and how it can inform Benders decomposition to learn from infeasibility, applied to the capacitated facility location problem. The post How Benders Decomposition Works, Part II: Feasibility Cuts appeared first on Towards Data Science .
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.
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: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: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:2607. 13218v1 Announce Type: cross Abstract: In this work, we study various graph partitioning problems under a general demand model.
arXiv:2606. 00009v1 Announce Type: new Abstract: Bayesian Optimization (BO) is widely and successfully adopted for solving optimization problems having an expensive-to-evaluate, black-box, and non-convex objective function.
arXiv:2501. 18143v2 Announce Type: replace Abstract: Min cut is an important graph partitioning method.
Building an ALNS heuristic in Python for vehicle routing, time windows, capacity constraints, and mandatory driver breaks. The post Los Movimientos, Part II: Solving Large Pickup-and-Delivery Problems with Adaptive Large Neighborhood Search appeared first on Towards Data Science .
arXiv:2609.07204v1 Announce Type: new Abstract: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of t...
arXiv:2609.39559v1 Announce Type: new Abstract: In this work we study the problem of MAPFC, a post-optimization step for Multi-Agent Path Finding (MAPF) plans where we are given a feasible plan produ...
The paper introduces a differentiable optimization layer for electricity‑market clearing, enabling gradient‑based planning of large data centers. By treating market clearing as a differentiable process, the authors can propagate planning costs back through cleared prices, validating gradients against finite differences. Applied to a 50 MW load allocation problem across six candidate buses in two synthetic networks, gradient optimization nearly matches exhaustive enumeration, with small objective gaps and a noted systematic error near site‑closure thresholds.