Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators

Cites Work

Optimization by Simulated Annealing
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
Rescheduling rail networks with maintenance disruptions using problem space search
Scheduling arc maintenance jobs in a network to maximize total flow over time
Lift-and-project for mixed 0-1 programming: recent progress
The Boolean quadratic polytope: Some characteristics, facets and relatives
A time indexed formulation of non-preemptive single machine scheduling problems
Warm start of the primal-dual method applied in the cutting-plane scheme
On the \(0/1\) knapsack polytope
Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
Scheduling preventive railway maintenance activities with resource constraints
A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem
\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
On the separation of maximally violated mod-\(k\) cuts
Edmonds polytopes and a hierarchy of combinatorial problems
Gomory cuts revisited
Lift-and-Project Cuts for Mixed Integer Convex Programs
Scheduling of railway track maintenance activities and crews
Scheduling preventive railway maintenance activities
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Solving Mixed Integer Programming Problems Using Automatic Reformulation
On the facial structure of set packing polyhedra
Finding the K Shortest Loopless Paths in a Network
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Mixing mixed-integer inequalities

This page was built for publication: Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators