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

Personal profile

Personal information

Thomas Bosman is a PhD candidate at the department of Econometrics/OR of the VU.

Research

Research topic
Fast Algorithms in Network Design Using Graph Structure

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.

  • 1 Similar Profiles
Approximation algorithms Engineering & Materials Science
Approximation Algorithms Mathematics
Vehicle routing Engineering & Materials Science
Costs Engineering & Materials Science
Computational complexity Engineering & Materials Science
Hardness Engineering & Materials Science
Vertex of a graph Mathematics
Approximation Mathematics

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

Research Output 2017 2018

  • 2 Conference contribution
  • 1 Article

Approximation algorithms for replenishment problems with fixed turnover times

Bosman, T., van Ee, M., Jiao, Y., Marchetti-Spaccamela, A., Ravi, R. & Stougie, L., 2018, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. Springer/Verlag, p. 217-230 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10807 LNCS).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Approximation algorithms
Approximation Algorithms
Vehicle routing
Costs
Computational complexity

Parallel Machine Scheduling with a Single Resource per Job

Janssen, T., Swennenhuis, C., Bitar, A., Bosman, T., Gijswijt, D., Iersel, L. V., Dauzére-Pérès, S. & Yugma, C., 13 Sep 2018, In : arXiv preprint arXiv:1501.03933. p. 1-24 24 p.

Research output: Contribution to JournalArticleAcademic

Resources
Parallel machine scheduling
NP-hard
Total completion time
Parallel machines

Exploring the Tractability of the Capped Hose Model

Bosman, T. N. & Olver, N. K., 2017, Proceedings of the 25th Annual European Symposium on Algorithms (ESA). Schloss Dagstuhl, Vol. 87. 12 p. 19. (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Open Access