We consider the problem of satisfying the maximum number of constraints of an instance of the Periodic Event Scheduling Problem (PESP). This is a key issue in periodic railway timetable construction, and has many other applications, e.g. for traffic light scheduling
This paper proposes an algorithm that decomposes the Periodic Event Scheduling Problem (PESP) into t...
AbstractGraph theoretic methods are used to analyze a problem concerning periodically recurring even...
In the last 15 years periodic timetable problems have found much interest in the combinatorial optim...
The periodic event scheduling problem (PESP) is a well studied problem known as intrinsically hard, ...
In the planning process of railway companies, we propose to integrate important decisions of network...
We investigate the polyhedral structure of the Periodic Event Scheduling Problem (PESP), which is co...
In the planning process of railway companies, we propose to integrate important decisions of network...
We describe the periodic event scheduling problem (PESP) based on periodic event networks and extend...
We investigate the polyhedral structure of the Periodic Event Scheduling Problem (PESP), which is co...
We consider the computation of periodic timetables, which is a key task in the service design proces...
Periodic timetabling for highly utilized railway networks is a demanding challenge. We formulate an ...
This paper proposes an algorithm that decomposes the Periodic Event Scheduling Problem (PESP) into t...
This thesis addresses the problem of solving large railway timetabling problems using algorithmic me...
This paper addresses the problem of constructing periodic timetables for train operations. We use a ...
The Periodic Event Scheduling Problem (PESP), in which events have to be scheduled repeatedly over a...
This paper proposes an algorithm that decomposes the Periodic Event Scheduling Problem (PESP) into t...
AbstractGraph theoretic methods are used to analyze a problem concerning periodically recurring even...
In the last 15 years periodic timetable problems have found much interest in the combinatorial optim...
The periodic event scheduling problem (PESP) is a well studied problem known as intrinsically hard, ...
In the planning process of railway companies, we propose to integrate important decisions of network...
We investigate the polyhedral structure of the Periodic Event Scheduling Problem (PESP), which is co...
In the planning process of railway companies, we propose to integrate important decisions of network...
We describe the periodic event scheduling problem (PESP) based on periodic event networks and extend...
We investigate the polyhedral structure of the Periodic Event Scheduling Problem (PESP), which is co...
We consider the computation of periodic timetables, which is a key task in the service design proces...
Periodic timetabling for highly utilized railway networks is a demanding challenge. We formulate an ...
This paper proposes an algorithm that decomposes the Periodic Event Scheduling Problem (PESP) into t...
This thesis addresses the problem of solving large railway timetabling problems using algorithmic me...
This paper addresses the problem of constructing periodic timetables for train operations. We use a ...
The Periodic Event Scheduling Problem (PESP), in which events have to be scheduled repeatedly over a...
This paper proposes an algorithm that decomposes the Periodic Event Scheduling Problem (PESP) into t...
AbstractGraph theoretic methods are used to analyze a problem concerning periodically recurring even...
In the last 15 years periodic timetable problems have found much interest in the combinatorial optim...
DOI
Add to ORKG