| Publication | Date of Publication | Type |
|---|
A cut-and-branch algorithm for the external candidates examination scheduling problem
Journal of Scheduling | 2025-12-16 | Paper |
| MILP approaches to practical real-time train scheduling: the iron ore line case | 2025-10-30 | Paper |
| The path\&cycle formulation for the hotspot problem in air traffic management | 2024-08-27 | Paper |
A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
Computers & Operations Research | 2024-07-08 | Paper |
An optimization-based decision support tool for incremental train timetabling
SN Operations Research Forum | 2023-10-05 | Paper |
Easy cases of deadlock detection in train scheduling
Operations Research | 2022-09-19 | Paper |
Air traffic flow management with layered workload constraints
Computers & Operations Research | 2021-05-21 | Paper |
A noncompact formulation for job-shop scheduling problems in traffic management
Operations Research | 2020-10-26 | Paper |
Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
European Journal of Operational Research | 2018-05-24 | Paper |
Modelling and solving generalised operational surgery scheduling problems
Computers & Operations Research | 2016-11-17 | Paper |
The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming
Networks | 2016-06-10 | Paper |
An exact decomposition approach for the real-time train dispatching problem
Operations Research | 2015-10-22 | Paper |
The implementor/adversary algorithm for the cyclic and robust scheduling problem in health-care
European Journal of Operational Research | 2014-07-27 | Paper |
Computing optimal recovery policies for financial markets
Operations Research | 2013-03-12 | Paper |
Optimal real-time traffic control in metro stations
Operations Research | 2011-11-24 | Paper |
Negative cycle separation in wireless network design
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Planning wireless networks by shortest path
Computational Optimization and Applications | 2011-05-25 | Paper |
On the cubicity of certain graphs
Information Processing Letters | 2009-12-04 | Paper |
The Network Packing Problem in Terrestrial Broadcasting
Operations Research | 2009-08-13 | Paper |
Upward drawings of triconnected digraphs.
Algorithmica | 2008-12-21 | Paper |
Models and solution techniques for frequency assignment problems
Annals of Operations Research | 2008-03-31 | Paper |
Time offset optimization in digital broadcasting
Discrete Applied Mathematics | 2008-02-26 | Paper |
The stable set problem and the thinness of a graph
Operations Research Letters | 2007-08-27 | Paper |
| Optimization problems and models for planning cellular networks | 2007-07-23 | Paper |
Models and solution techniques for frequency assignment problems
4OR | 2004-02-19 | Paper |
An enumerative algorithm for the frequency assignment problem
Discrete Applied Mathematics | 2003-07-30 | Paper |
Minimizing the span \(d\)-walks to compute optimum frequency assignments.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
An augmentation algorithm for the maximum weighted stable set problem
Computational Optimization and Applications | 2001-02-09 | Paper |
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing | 1998-05-10 | Paper |
| scientific article; zbMATH DE number 956849 (Why is no real title available?) | 1997-06-09 | Paper |
Solving hard set covering problems
Operations Research Letters | 1996-10-20 | Paper |
An exact algorithm for the maximum stable set problem
Computational Optimization and Applications | 1994-07-26 | Paper |
