Summary
Eindhoven University of Technology (TU/e) invites applications for a PhD position focused on investigating the theoretical properties and computational hardness of discrete optimization problems. The research will explore structured cases in problems from operations research, promoting the development of practical algorithmic frameworks.
PhD in Algorithms and Complexity for Discrete Optimization Problems, Eindhoven University of Technology, Netherlands
Designation
PhD Candidate in Algorithms and Complexity for Discrete Optimization Problems
| Attribute | Details |
|---|---|
| Organization | Department of Mathematics and Computer Science |
| Full-Time Equivalent | 1.0 FTE |
| Salary | € 3.059 – € 3.881 |
| Application Deadline | 31-05-2026 |
Research Area
- Discrete Optimization Problems
- Combinatorial Optimization
- Complexity Theory
Location
Eindhoven University of Technology, Netherlands
Eligibility/Qualification
- Bachelor and Master’s degree in Mathematics, Computer Science, or Econometrics.
- Strong background in Combinatorics and Complexity Theory.
- Good communication skills; knowledge of Dutch is not required.
- Creative, ambitious, and self-motivated individuals with good command of the English language.
Job Description
- Conduct scientific research on theoretical and practical aspects of discrete optimization problems.
- Publish and present research findings at international venues.
- Assist with educational tasks, including course support and supervision of students (up to 15% per year).
How to Apply
Interested candidates should submit a complete application including:
- Cover letter outlining motivation and qualifications.
- Curriculum vitae with a list of publications and contact information for two references.
- Bachelor’s and Master’s transcripts.
Applications must be submitted online; email or postal applications will not be processed.
Last Date to Apply
31-05-2026
This is a unique opportunity to contribute to impactful research while developing your academic career at a leading international university.
