ASP-based approaches for solving the nuclear medicine scheduling problem
From MaRDI portal
Cites work
- \textsf{TSAT++}: an open platform for satisfiability modulo theories
- A novel approach to determine a tactical and operational decision for dynamic appointment scheduling at nuclear medical center
- ASP-Core-2 input language format
- DeduDeep: an extensible framework for combining deep learning and ASP-based models
- Evaluation of disjunctive programs in WASP
- Generalized Benders decomposition
- Industrial-size scheduling with ASP+CP
- LMHS: a SAT-IP hybrid MaxSat solver
- Logic-based Benders decomposition
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Multi-shot ASP solving with clingo
- Nurse scheduling via answer set programming
- Online appointment scheduling for a nuclear medicine department in a Chinese hospital
- Open-WBO: a modular MaxSAT solver
- Partitioning procedures for solving mixed-variables programming problems. Reprint
- Principles and Practice of Constraint Programming – CP 2004
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Scheduling home hospice care with logic-based Benders decomposition
- Scheduling pre-operative assessment clinic with answer set programming
- Semantics and complexity of recursive aggregates in answer set programming
- Team-building with answer set programming in the Gioia-Tauro seaport
- The Benders decomposition algorithm: a literature review
- Train scheduling with hybrid ASP
This page was built for publication: ASP-based approaches for solving the nuclear medicine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6849512)