| Publication | Date of Publication | Type |
|---|
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
International Transactions in Operational Research | 2023-09-29 | Paper |
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Computers & Operations Research | 2022-06-22 | Paper |
An iterative heuristic for passenger-centric train timetabling with integrated adaption times
Computers & Operations Research | 2022-06-22 | Paper |
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Computers & Operations Research | 2022-06-22 | Paper |
An integer linear programming model for integrated train stop planning and timetabling with time-dependent passenger demand
Computers & Operations Research | 2022-03-09 | Paper |
Models and algorithms for the traveling salesman problem with time-dependent service times
European Journal of Operational Research | 2020-02-11 | Paper |
A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
European Journal of Operational Research | 2019-07-25 | Paper |
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
European Journal of Operational Research | 2018-05-29 | Paper |
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
INFORMS Journal on Computing | 2017-12-29 | Paper |
Timetable optimization for high-speed trains at Chinese railways
| 2017-02-14 | Paper |
A hybrid approach to beam angle optimization in intensity-modulated radiation therapy
Computers & Operations Research | 2016-11-10 | Paper |
A new lower bound for curriculum-based course timetabling
Computers & Operations Research | 2016-11-10 | Paper |
Single-commodity robust network design problem: complexity, instances and heuristic solutions
European Journal of Operational Research | 2016-06-23 | Paper |
Single-commodity robust network design with finite and hose demand sets
Mathematical Programming. Series A. Series B | 2016-06-06 | Paper |
An overview of curriculum-based course timetabling
Top | 2015-07-27 | Paper |
Rejoinder on: ``An overview of curriculum-based course timetabling
Top | 2015-07-27 | Paper |
The table placement problem: a research challenge at the EWI 2007
Top | 2014-10-08 | Paper |
A set-covering based heuristic algorithm for the periodic vehicle routing problem
Discrete Applied Mathematics | 2014-09-08 | Paper |
A Lagrangian heuristic for a train-unit assignment problem
Discrete Applied Mathematics | 2014-04-16 | Paper |
On integer polytopes with few nonzero vertices
Operations Research Letters | 2013-06-24 | Paper |
Finding cliques of maximum weight on a generalization of permutation graphs
Optimization Letters | 2013-03-07 | Paper |
Nominal and robust train timetabling problems
European Journal of Operational Research | 2012-12-29 | Paper |
Models and algorithms for robust network design with several traffic scenarios
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Models and algorithms for the train unit assignment problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Recoverable robustness for railway rolling stock planning
| 2012-09-28 | Paper |
Solving a real-world train unit assignment problem
| 2012-09-28 | Paper |
Solving a real-world train-unit assignment problem
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Non-cyclic train timetabling and comparability graphs
Operations Research Letters | 2010-06-08 | Paper |
Models and algorithms for combinatorial optimization problems arising in railway applications
4OR | 2009-06-22 | Paper |
A column generation approach to train timetabling on a corridor
4OR | 2008-09-04 | Paper |
