SeaPearl: a constraint programming solver guided by reinforcement learning

DOI10.1007/978-3-030-78230-6_25OpenAlexW3176327512MaRDI QIDQ2117242

Louis-Martin Rousseau, Ilan Coulon, Félix Chalumeau, Quentin Cappart

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2102.09193

zbMATH Keywords

reinforcement learningconstraint programmingsolver design

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

SeaPearl ⋮ Learning the travelling salesperson problem requires rethinking generalization ⋮ A learning large neighborhood search for the staff rerostering problem ⋮ Multi-objective optimization for the design of salary structures

Uses Software

• VRP
• Choco
• Gecode
• OscaR
• Julia
• JuMP
• Distributions.jl
• LightGraphs.jl
• Knet
• MathOptInterface.jl
• MiniCP
• NeuroSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MathOptInterface.jl
• MiniCP
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Three-dimensional matching instances are rich in stable matchings
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Guiding high-performance SAT solvers with unsat-core predictions
• MiniCP: a lightweight solver for constraint programming
• A portfolio optimization model with three objectives and discrete variables
• The Vehicle Routing Problem
• Julia: A Fresh Approach to Numerical Computing
• Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
• JuMP: A Modeling Language for Mathematical Optimization
• Failure-Directed Search for Constraint-Based Scheduling
• Principles and Practice of Constraint Programming – CP 2004
• Benchmarking optimization software with performance profiles.

This page was built for publication: SeaPearl: a constraint programming solver guided by reinforcement learning