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: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:2508. 20330v5 Announce Type: replace Abstract: Combinatorial optimization problems are ubiquitous in science and engineering.
arXiv:2608. 13079v1 Announce Type: new Abstract: This paper proposes a novel learning-based approach to approximately solve instances of mixed-integer optimization problems.
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:2607. 22788v1 Announce Type: cross Abstract: AC optimal power flow determines the minimum-cost generation dispatch under nonlinear power balance constraints and is solved thousands of times daily in electricity market operations.
arXiv:2608. 07040v1 Announce Type: new Abstract: Solving combinatorial optimization problems (COPs) requires not only efficient algorithms but also carefully crafted formulations.
arXiv:2607. 23448v1 Announce Type: cross Abstract: Expensive constrained optimization problems in real-world industry design often involve constraint thresholds that are difficult to determine in advance.
arXiv:2606. 02151v1 Announce Type: new Abstract: Effective scheduling in the energy sector is essential to ensure the reliable operation of electrical grids and their connected assets by, for instance, optimizing the dispatch of generation units and storage systems.
arXiv:2604. 23053v2 Announce Type: replace Abstract: Mixed Binary Quadratic Programs (MBQPs) are an important and complex set of problems in combinatorial optimization.
arXiv:2606. 13682v1 Announce Type: new Abstract: The open shop scheduling problem (OSSP) arises in many industrial and service settings but remains computationally challenging as the number of jobs and machines increases.
arXiv:2607. 27953v1 Announce Type: new Abstract: Combinatorial optimization problems (COPs) underpin many real-world decisions, but their exponentially large search spaces make high-quality solutions costly to obtain.
arXiv:2606. 05649v1 Announce Type: cross Abstract: Scenario generation is a critical component in stochastic programming (SP), as it directly influences the quality of decision-making under uncertainty.