conftrace_

mixed integer linear programming

31 papers

Explore in graph

Also known as

MILP

Co-occurring keywords

branch and bound (119) combinatorial optimization (1039) imitation learning (744) mixed-integer linear programming (26) mixed integer programming (67) reinforcement learning (4352) graph neural network (3962) neural network (6616) mixed integer linear program (15) branching policy (2)

Papers

Learning Branching Policies for MILPs with Proximal Policy Optimization AAAI 2026
Learn2Aggregate: Supervised Generation of Chvatal-Gomory Cuts Using Graph Neural Networks AAAI 2025
SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch AAAI 2025
Speedup Techniques for Switchable Temporal Plan Graph Optimization AAAI 2025
Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction AAAI 2025
Multi-Stage Predict+Optimize for (Mixed Integer) Linear Programs NIPS 2024
Linearised data-driven LSTM-based control of multi-input HVAC systems L4DC 2024
To the Globe (TTG): Towards Language-Driven Guaranteed Travel Planning EMNLP 2024
Learning to Configure Separators in Branch-and-Cut NIPS 2023
Who Should Predict? Exact Algorithms For Learning to Defer to Humans AISTATS 2023
Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto AAAI 2023
Scalable and Globally Optimal Generalized L₁ K-center Clustering via Constraint Generation in Mixed Integer Linear Programming AAAI 2023
Reinforcement Learning for Branch-and-Bound Optimisation Using Retrospective Trajectories AAAI 2023
An Exact Symbolic Reduction of Linear Smart Predict+Optimize to Mixed Integer Linear Programming ICML 2022
Learning to Cut by Looking Ahead: Cutting Plane Selection via Imitation Learning ICML 2022
Learning to Branch with Tree MDPs NIPS 2022
Problem Compilation for Multi-Agent Path Finding: a Survey IJCAI 2022
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework AAAI 2022
Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances AAAI 2021
Computing Quantal Stackelberg Equilibrium in Extensive-Form Games AAAI 2021
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies AAAI 2021
Hybrid Models for Learning to Branch NIPS 2020
A Novel Approach for Constrained Optimization in Graphical Models NIPS 2020
Certified Monotonic Neural Networks NIPS 2020
Possibilistic Games with Incomplete Information IJCAI 2019