If you made any changes in Pure these will be visible here soon.

Personal profile

Personal information

Rene Sitters is associate professor at the department of Econometrics and Operations Research at the Vrije Universiteit.  One day per week he is researcher at the Centrum Wiskunde & Informatica (CWI). (My CWI page)

He obtained his PhD at Eindhoven University of Technology in 2004.

Research

Main research topics:

  • Combinatorial Optimization problems: algorithms and complexity

Current research:

  • The traveling repairman problem [.pdf]
  • There are some intriguing open problems in online optimization. Here is a report on one of these. A discussion on open problems is given in the last section. [.pdf]
  • A fundamental problem in combinatorial optimization is the Traveling Salesman Problem. Recently, important progress has been made on the approximability of the TSP problem. Here is our contribution. [.pdf]

Ancillary activities

No ancillary activities

Ancillary activities are updated daily

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 2 Similar Profiles
Approximation algorithms Engineering & Materials Science
Scheduling Engineering & Materials Science
Polynomials Engineering & Materials Science
Preemption Mathematics
Approximation Algorithms Mathematics
Traveling salesman problem Engineering & Materials Science
Servers Engineering & Materials Science
Hardness Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1999 2018

Total Weighted Completion Time
Release Dates
Release Time
Precedence Constraints
Single Machine Scheduling

Approximation and complexity of multi-target graph search and the Canadian traveler problem

van Ee, M. & Sitters, R. 7 Jul 2018 In : Theoretical Computer Science. 732, p. 14-25 12 p.

Research output: Contribution to journalArticle

Graph Search
Probability distributions
Computational complexity
Hardness
Expected Length

Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan

Wang, C., Lu, X. W. & Sitters, R. Jul 2018 In : Acta Mathematicae Applicatae Sinica. 34, 3, p. 597-609 13 p.

Research output: Contribution to journalArticle

Approximation algorithms
Approximation Algorithms
Scheduling
Minimise
Fully Polynomial Time Approximation Scheme

The A Priori Traveling Repairman Problem

van Ee, M. & Sitters, R. A. 2018 (Accepted/In press) In : Algorithmica. p. 1-16 16 p.

Research output: Contribution to journalArticle

Open Access
Active Set
Traveling salesman problem
Combinatorial optimization
Probability distributions
Minimise

Approximability of average completion time scheduling on unrelated machines

Sitters, R. A. 2017 In : Mathematical Programming. 161, 1, p. 135-158

Research output: Contribution to journalArticle

Open Access

Activities 2009 2011

  • 3 Lecture / Presentation
  • 1 Editorial work

Operations Research Letters (Journal)

Sitters, R. (Member of editorial board)
2011

Activity: ScientificEditorial work

Efficient algorithms for average completion time scheduling

Sitters, R. (Speaker)
2 Dec 2009

Activity: ScientificLecture / Presentation

Connected feedback vertex set in planar graphs

Sitters, R. (Speaker)
1 Jun 2009

Activity: ScientificLecture / Presentation

Minimizing average flow time on unrelated machines

Sitters, R. (Speaker)
1 Dec 2009

Activity: ScientificLecture / Presentation

Prizes

Gijs de Leve prize

R.A. Sitters (Recipient), 2006

Prize: ScientificPrize / Award

Mathematics

NWO open competition

R.A. Sitters (Recipient), 2013

Prize: ScientificPrize / Award

grant

NWO Veni Grant

R.A. Sitters (Recipient), 2007

Prize: ScientificPrize / Award