Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Heinz, Vilém, Vilím, Petr, Hanzálek, Zdeněk
Format:	Preprint
Published:	2025
Subjects:	Machine Learning 90-08, 90B35, 90C59, 90C99, 68T20, 90C27
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Metaheuristic algorithms for the induced P-median problem with upgrades
by: Salazar, Sergio, et al.
Published: (2026)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

Flow-based Extremal Mathematical Structure Discovery
by: Bérczi, Gergely, et al.
Published: (2026)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

Kinetic description and convergence analysis of genetic algorithms for global optimization
by: Borghi, Giacomo, et al.
Published: (2023)

Applying a Random-Key Optimizer on Mixed Integer Programs
by: Chaves, Antonio A., et al.
Published: (2026)

Heuristic algorithms for the stochastic critical node detection problem
by: Bayarsaikhan, Tuguldur, et al.
Published: (2025)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Solving the Market Split Problem with Lattice Enumeration
by: Wassermann, Alfred
Published: (2025)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
by: Xu, Mingming, et al.
Published: (2026)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set
by: Roth, Jake, et al.
Published: (2023)

Damage Location in Mechanical Structures by Multi-Objective Pattern Search
by: Günther, Christian, et al.
Published: (2024)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
by: Teng, Wenshun, et al.
Published: (2025)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
by: Thomä, Simon, et al.
Published: (2022)

A solution procedure for minimizing total completion time in a parallel-batching environment
by: Alfieri, Arianna, et al.
Published: (2020)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

Continuous models combining slacks-based measures of efficiency and super-efficiency
by: Bolos, Vicente J., et al.
Published: (2024)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
by: Ostermann, Birte, et al.
Published: (2025)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Fitted value iteration methods for bicausal optimal transport
by: Bayraktar, Erhan, et al.
Published: (2023)