paper-with-me

홈 › Papers

"Model and Run" Constraint Networks with a MILP Engine

2016-11-27 · Thierry Petit

Constraint Programming (CP) users need significant expertise in order to model their problems appropriately, notably to select propagators and search strategies. This puts the brakes on a broader uptake of CP. In this paper, we introduce MICE, a complete Java CP modeler that can use any Mixed Integer Linear Programming (MILP) solver as a solution technique. Our aim is to provide an alternative tool for democratizing the "CP-style" modeling thanks to its simplicity of use, with reasonable solving capabilities. Our contributions include new decompositions of (reified) constraints and constraints on numerical variables.

📄 PDF Abstract BibTeX arXiv:1611.08908

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Knowledge engineering mixed-integer linear programming: constraint typology

2021-02-20 · Vicky Mak-Hau, John Yearwood, William Moran

In this paper, we investigate the constraint typology of mixed-integer linear programming MILP formulations. MILP is a commonly used mathematical programming technique for modelling and solving real-life scheduling, rout…

Combinatorial OptimizationScheduling

Constraint Matters: Multi-Modal Representation for Reducing Mixed-Integer Linear programming

2025-08-26 · Jiajun Li, Yixuan Li, Ran Hou, Yu Ding 외 arxiv

Model reduction, which aims to learn a simpler model of the original mixed integer linear programming (MILP), can solve large-scale MILP problems much faster. Most existing model reduction methods are based on variable r…

Learn2Aggregate: Supervised Generation of Chvátal-Gomory Cuts Using Graph Neural Networks

2024-09-10 · Arnaud Deza, Elias B. Khalil, Zhenan Fan, Zirui Zhou 외

We present $\textit{Learn2Aggregate}$, a machine learning (ML) framework for optimizing the generation of Chv\'atal-Gomory (CG) cuts in mixed integer linear programming (MILP). The framework trains a graph neural network…

Feature EngineeringGraph Neural Network

CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction

2025-11-12 · Tianle Pu, Jianing Li, Yingying Gao, Shixuan Liu 외 arxiv

Mixed-Integer Linear Programming (MILP) is a cornerstone of combinatorial optimization, yet solving large-scale instances remains a significant computational challenge. Recently, Graph Neural Networks (GNNs) have shown p…

A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention

2026-01-08 · Peixin Huang, Yaoxin Wu, Yining Ma, Cathy Wu 외 arxiv

Mixed-integer linear programming (MILP) is a foundational framework for combinatorial optimization across science and engineering, but remains hard to solve at scale due to NP-hardness. Recent learning-based methods typi…

Representation Learning