Learning to reduce state-expanded networks for multi-activity shift scheduling

DOI10.1007/978-3-030-78230-6_24OpenAlexW3167021915MaRDI QIDQ2117239FDOQ2117239

Till Porrmann, Michael Römer

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_24

Mathematics Subject Classification ID

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

Cites Work

• Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
• Formal languages for integer programming modeling of shift scheduling problems
• A large neighbourhood search approach to the multi-activity shift scheduling problem
• Constraint Programming Based Column Generation for Employee Timetabling
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Title not available (Why is that?)
• An implicit model for multi-activity shift scheduling problems
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem

Cited In (1)

• Block-based state-expanded network models for multi-activity shift scheduling

Uses Software

• XGBoost

This page was built for publication: Learning to reduce state-expanded networks for multi-activity shift scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117239)