paper-with-me

Papers

Ecole: A Library for Learning Inside MILP Solvers

2021-04-06 · Antoine Prouvost, Justin Dumouchelle, Maxime Gasse, Didier Chételat, Andrea Lodi

In this paper we describe Ecole (Extensible Combinatorial Optimization Learning Environments), a library to facilitate integration of machine learning in combinatorial optimization solvers. It exposes sequential decision making that must be performed in the process of solving as Markov decision processes. This means that, rather than trying to predict solutions to combinatorial optimization problems directly, Ecole allows machine learning to work in cooperation with a state-of-the-art a mixed-integer linear programming solver that acts as a controllable algorithm. Ecole provides a collection of computationally efficient, ready to use learning environments, which are also easy to extend to define novel training tasks. Documentation and code can be found at https://www.ecole.ai.

📄 PDF Abstract BibTeX arXiv:2104.02828

Code (1)

ds4dm/ecole-paper 공식 구현

Tasks

BIG-bench Machine LearningCombinatorial OptimizationDecision MakingSequential Decision Making

Similar Papers 제목 키워드 기반

Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers

2020-11-11 · NeurIPS Workshop LMCA 2020 12 · Antoine Prouvost, Justin Dumouchelle, Lara Scavuzzo, Maxime Gasse 외

We present Ecole, a new library to simplify machine learning research for combinatorial optimization. Ecole exposes several key decision tasks arising in general-purpose combinatorial optimization solvers as control prob…

BIG-bench Machine LearningCombinatorial OptimizationOpenAI Gym

Code Retrieval for MILP Instance Generation

2025-05-11 · Tianxing Yang, Huigen Ye, Hua Xu

Mixed-Integer Linear Programming (MILP) is widely used in fields such as scheduling, logistics, and planning. Enhancing the performance of MILP solvers, particularly learning-based solvers, requires substantial amounts o…

Code GenerationRetrievalScheduling

RL-MILP Solver: A Reinforcement Learning Approach for Solving Mixed-Integer Linear Programs with Graph Neural Networks

2024-11-29 · Tae-Hoon Lee, Min-Soo Kim

Mixed-Integer Linear Programming (MILP) is an optimization technique widely used in various fields. Existing end-to-end learning methods for MILP generate values for a subset of decision variables and delegate the remain…

Graph Neural NetworkReinforcement Learning (RL)

A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability

2023-10-04 · NeurIPS 2023 11 · Zijie Geng, Xijun Li, Jie Wang, Xiao Li 외

In the past few years, there has been an explosive surge in the use of machine learning (ML) techniques to address combinatorial optimization (CO) problems, especially mixed-integer linear programs (MILPs). Despite the a…

Combinatorial Optimization

MILP-StuDio: MILP Instance Generation via Block Structure Decomposition

2024-10-30 · Haoyang Liu, Jie Wang, Wanbo Zhang, Zijie Geng 외

Mixed-integer linear programming (MILP) is one of the most popular mathematical formulations with numerous applications. In practice, improving the performance of MILP solvers often requires a large amount of high-qualit…