Research Output per year

## 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.

- 3 Similar Profiles

Approximation algorithms
Engineering & Materials Science

Scheduling
Engineering & Materials Science

Polynomials
Engineering & Materials Science

Preemption
Mathematics

Traveling salesman problem
Engineering & Materials Science

Approximation Algorithms
Mathematics

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

## A (2+ϵ)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

Sitters, R. & Yang, L. Jul 2018 In : Operations Research Letters. 46, 4, p. 438-442 5 p.Research output: Contribution to journal › Article

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 journal › Article

Graph Search

Probability distributions

Computational complexity

Hardness

Expected Length

## 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 journal › Article

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-158Research output: Contribution to journal › Article

Open Access

## A priori TSP in the Scenario Model

van Ee, M., van Iersel, L. J. J., Janssen, T. M. L. & Sitters, R. A. 2017 In : Lecture Notes in Computer Science. 10138, p. 183-196Research output: Contribution to journal › Article