(Kevin) K. Dalmeijer

All publications (27)

• Article (1)

  • K. Dalmeijer & R. Spliet (2018). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Computers and Operations Research, 89, 140-152. doi: 10.1016/j.cor.2017.08.015

• Report (1)

  • K. Dalmeijer & G. Desaulniers (2018). Addressing orientation-symmetry in the Time Window Assignment Vehicle Routing Problem. (Preprints, G-2018-48). : Les Cahiers du GERAD

• Lecture (16)

  • K. Dalmeijer & G. Desaulniers (2018, juni 7). A branch-price-and-cut algorithm for the TWAVRP -- addressing symmetry in route synchronization. Cagliari, Odysseus conference.
  • K. Dalmeijer & G. Desaulniers (2018, juni 15). A branch-price-and-cut algorithm for the TWAVRP -- addressing symmetry in route synchronization. Rotterdam, Last-Mile Delivery Workshop.
  • K. Dalmeijer & G. Desaulniers (2018, maart 23). Addressing orientation-symmetry in the Time Window Assignment Vehicle Routing Problem. Rotterdam, EI seminar.
  • K. Dalmeijer & R. Spliet (2017, april 5). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Montréal, GERAD seminar.
  • K. Dalmeijer (2017, april 11). Time Window Assignment in Distribution Networks. Montréal, GERAD students day.
  • K. Dalmeijer (2017, april 18). Digital grading. Rotterdam (via Skype from Montréal), EI department meeting.
  • K. Dalmeijer & G. Desaulniers (2017, mei 8). Exact methods for the Time Window Assignment Vehicle Routing Problem. Montréal, JOPT 2017 conference.
  • K. Dalmeijer (2017, februari 16). Digital grading. Rotterdam, Community of Practice.
  • K. Dalmeijer (2017, november 11). Host of the graduation ceremony. Rotterdam, ESE Bachelor graduation day.
  • K. Dalmeijer & G. Desaulniers (2017, juli 19). Strengthened precedence inequalities for the Time Window Assignment Vehicle Routing Problem. Québec, IFORS 2017 conference.
  • K. Dalmeijer (2016, juni 16). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Oranjestad, TRISTAN IX conference.
  • K. Dalmeijer (2016, mei 25). Counting integer points. Rotterdam, QED seminar.
  • K. Dalmeijer (2016, januari 12). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Lunteren, 41th LNMB conference.
  • K. Dalmeijer (2016, januari 7). A branch-and-cut algorithm for the TWAVRP. Rotterdam, Econometric Institute PhD Conference.
  • K. Dalmeijer (2015, mei 29). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Rotterdam, EI seminar.
  • K. Dalmeijer (2015, juni 3). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Ajaccio, Odysseus conference.

• Other output (2)

  • K. Dalmeijer (2017). Quality Impetus Program project: Professionalization of NLO challenges for excellent students.
  • K. Dalmeijer (2016). Pilot digitally correcting exams (with Bas van Goozen, Innovation Hub).

• Scientific positions (2)

  • K. Dalmeijer (periode: 2015 t/m 2018). Consultant. Position at: S-ray Diagnostics (ERBS BV / EUR holding).
  • K. Dalmeijer (periode: 2016 t/m 2017). PhD Representative. Position at: Dutch Network on the Mathematics of Operations Research (LNMB).

• Award (3)

  • K. Dalmeijer (2017). ESE Educational Innovation Award. ESE Awards: Rotterdam. Overig.
  • M. de Haas, D.L. van Knippenberg, P.J.F. Groenen, K. Dalmeijer & L. van Bunderen (2015). ESE Societal Impact Award. ESE Awards: Rotterdam. Overig.
  • K. Dalmeijer (2014). Best Econometric Thesis Award. Overig.

• Internet article (2)

  • K. Dalmeijer (2017). Time window assignment and symmetry. (blog). Last-Mile Logistics blog. (available: 26 Sep 2017).
  • K. Dalmeijer (2016). Time window assignment in an uncertain world. (blog). Last-Mile Logistics blog. (available: 13 Sep 2016).

Present position