Research output per year
Research output per year
Personal profile
Personal information
Rene Sitters is associate professor at the department of Supply Chain Analytics 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
Expertise related to UN Sustainable Development Goals
In 2015, UN member states agreed to 17 global Sustainable Development Goals (SDGs) to end poverty, protect the planet and ensure prosperity for all. This person’s work contributes towards the following SDG(s):
Fingerprint
Dive into the research topics where Rene Sitters is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
-
Approximability of average completion time scheduling on unrelated machines
Sitters, R. A., Jan 2017, In: Mathematical Programming. 161, 1-2, p. 135-158 24 p.Research output: Contribution to Journal › Article › Academic › peer-review
Open Access -
The travelling salesman problem on cubic and subcubic graphs
Boyd, S. M., Sitters, R. A., van der Ster, S. L. & Stougie, L., 2014, In: Mathematical Programming. 144, 1-2, p. 227-245Research output: Contribution to Journal › Article › Academic › peer-review
-
Exact and Approximation Algorithms for Routing a Convoy Through a Graph
van Ee, M., Oosterwijk, T., Sitters, R. & Wiese, A., 2023, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023): [Proceedings]. Leroux, J., Lombardy, S. & Peleg, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 86:1-86:15 15 p. 86. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 272).Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review
Open Access -
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
Sitters, R., Oct 2021, In: SIAM Journal on Computing. 50, 5, p. 1580-1602 23 p.Research output: Contribution to Journal › Article › Academic › peer-review
Open AccessFile85 Downloads (Pure) -
The Chinese deliveryman problem
van Ee, M. & Sitters, R., Sept 2020, In: 4OR. 18, 3, p. 341-356 16 p.Research output: Contribution to Journal › Article › Academic › peer-review
Open Access
Courses
-
Operations Research Letters (Journal)
R.A. Sitters (Member of editorial board)
2011Activity: Peer review and Editorial work › Editorial work › Academic
-
Minimizing average flow time on unrelated machines
R.A. Sitters (Speaker)
1 Dec 2009Activity: Lecture / Presentation › Academic
-
Efficient algorithms for average completion time scheduling
R.A. Sitters (Speaker)
2 Dec 2009Activity: Lecture / Presentation › Academic
-
Connected feedback vertex set in planar graphs
R.A. Sitters (Speaker)
1 Jun 2009Activity: Lecture / Presentation › Academic