A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (Q6568503)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems |
scientific article; zbMATH DE number 7877761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems |
scientific article; zbMATH DE number 7877761 |
Statements
A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (English)
0 references
8 July 2024
0 references
train rescheduling
0 references
dynamic discretization discovery
0 references
maximum satisfiability problem
0 references
0 references
