Cover Image

Accelerated windowing for the crew rostering problem with machine learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Racette, Philippe, Quesnel, Frédéric, Lodi, Andrea, Soumis, François
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How hard is learning to cut? Trade-offs and sample complexity
by: Khalife, Sammy, et al.
Published: (2025)

Exact resolution of a simultaneous vehicle routing and crew scheduling problem in long-haul transport
by: Lucci, Mauro, et al.
Published: (2024)

Chance-constrained battery management strategies for the electric bus scheduling problem
by: Ricard, Léa, et al.
Published: (2025)

Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem
by: Lerouge, Mathieu, et al.
Published: (2026)

Electric Vehicle Scheduling and Vehicle-to-Grid Integration in Microgrids
by: Cho, Nathan, et al.
Published: (2025)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

The pickup and delivery problem with time windows and scheduling on the edges
by: Barbosa, Vítor A., et al.
Published: (2025)

Hardness of some optimization problems over correlation polyhedra
by: Caprara, Alberto, et al.
Published: (2026)

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
by: van Rossum, Bart, et al.
Published: (2026)

Efficient Branching Rules for Optimizing Range and Order-Based Objective Functions
by: van Rossum, Bart, et al.
Published: (2023)

An improved column-generation-based matheuristic for learning classification trees
by: Patel, Krunal Kishor, et al.
Published: (2023)

Cutting Planes for Binarized Network Flow Problems
by: Bonami, Pierre, et al.
Published: (2025)

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2025)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
by: Lodi, Andrea, et al.
Published: (2019)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Curvature accelerated decentralized non-convex optimization for high-dimensional machine learning problems
by: Yi, Dingran, et al.
Published: (2025)

Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
by: Dey, Santanu S., et al.
Published: (2026)

Exact Verification of First-Order Methods via Mixed-Integer Linear Programming
by: Ranjan, Vinit, et al.
Published: (2024)

Sparse Cuts for the Positive Semidefinite Cone
by: Günlük, Oktay, et al.
Published: (2026)

Combining supervised learning and local search for the multicommodity capacitated fixed-charge network design problem
by: La Rocca, Charly Robinson, et al.
Published: (2024)

Computationally efficient solution of mixed integer model predictive control problems via machine learning aided Benders Decomposition
by: Mitrai, Ilias, et al.
Published: (2023)

The Differentiable Feasibility Pump
by: Cacciola, Matteo, et al.
Published: (2024)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
by: Messana, Rosario, et al.
Published: (2024)

Learning Large Neighborhood Search for Maritime Inventory Routing Optimization
by: Chen, Rui, et al.
Published: (2025)

Assortment Optimization with Visibility Constraints
by: Barre, Theo, et al.
Published: (2023)

Alternating Direction Method of Multipliers for nonlinear constrained convex problems and applications to distributed resource allocation and constrained machine learning
by: Xiong, Zhengjie, et al.
Published: (2026)

SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
by: Francobaldi, Matteo, et al.
Published: (2025)

Inverse optimal control problem in the non autonomous linear-quadratic case
by: Jean, Frédéric, et al.
Published: (2024)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)

A framework for window design in delivery schedules
by: Bharti, Bharti, et al.
Published: (2026)

Gradient directions and relative inexactness in optimization and machine learning
by: Vasin, Artem
Published: (2024)

Solution of a bilevel optimistic scheduling problem on parallel machines
by: Schau, Quentin, et al.
Published: (2026)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Batched First-Order Methods for Parallel LP Solving in MIP
by: Blin, Nicolas, et al.
Published: (2026)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
by: Chen, Hao, et al.
Published: (2026)

Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
by: Schau, Quentin, et al.
Published: (2026)

On the existence of Monge maps for the Gromov-Wasserstein problem
by: Dumont, Théo, et al.
Published: (2022)

Accelerated projected gradient algorithms for sparsity constrained optimization problems
by: Alcantara, Jan Harold, et al.
Published: (2022)

Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
by: Liang, Jiaqi, et al.
Published: (2024)

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
by: Carvalho, Margarida, et al.
Published: (2021)