Education & Positions at the Optimisation Group
Optimisation is a set of methods and tools for solving optimisation problems. Such problems arise in many application domains, such as scheduling, planning, configuration, control, design, biology, finance, transport, logistics, and so on. Many companies are successfully deploying optimisation technologies, making knowledge thereof a useful asset on the job market.
We teach the following courses:
- Combinatorial Optimisation and Constraint Programming (10 credits, course 1DL441), taught in periods 1 and 2 (late August to mid January) every autumn, given since 2003, also open to postgraduate students.
- Modelling for Combinatorial Optimisation (5 credits, course 1DL451), taught in period 1 (late August to late October) every autumn, given since 2015, also open to postgraduate students.
- Optimisation (5 credits, course 1TD184), taught in period 4 (late October to mid January) every autumn.
The first two courses can be taken in any sequence. If you want to take only one of them, then note that 1DL451 is an overview course on combinatorial optimisation, where you will learn to use problem solvers of five technologies, whereas 1DL441 is an algorithms course, where you will learn the details behind solvers of one technology; in both courses, the input to the solvers will be a model describing the what (but not the how) of a combinatorial optimisation problem, and optionally some high-level hints on how to solve it.
The course in optimisation (1TD184) addresses optimisation with continuous variables. The course consists in basic theories, optimality conditions, and methods for unconstrained optimisation, constrained nonlinear optimisation, and linear programming. This course can be taken independently of the first two courses.
We have postdoc / PhD funding available from time to time, though unfortunately not right now, and there is no department-wide PhD programme to apply for at a particular time of the year, so there is no point in applying for a position at the moment (if we have an open position, then it is announced worldwide). If you have an enquiry or an exceptionally well-motivated case nevertheless, compliant with our department admission regulations (especially those about scholarships and stipends), then contact us.
We continuously generate interesting problems. If you are keen on pursuing a research and/or development task for an MSc or BSc thesis, then contact us. Applicants must normally have spent at least a semester at Uppsala University and have passed a course on Constraint Programming (such as our 1DL441) and/or a course on constraint-based modelling for combinatorial optimisation (such as our 1DL451) and/or a course on optimisation (such as our 1TD184). Informal applications can be made in person. Written applications must include a CV, education transcripts (informal ones are initially acceptable), and a statement of purpose, which explains how your interests and qualifications relate to our work. Electronic attachments must be in PDF or JPG format. Written applications that do not comply with these instructions will not be answered. Salaries or expenses are not paid (as is often the custom in Sweden for MSc / BSc internships at university research groups), so you must have your own funding. Fortunately, we offer a stimulating environment and exciting topics: note that three recent theses supervised by our group received awards! All work is supervised in English.
Resources for those working with us: Your thesis (even its drafts) must be written in Oxford English, as required in the UU English Style Guide (which you should read), prepared using LaTeX, and compliant with our Check List and Style Manual. Consider using our style file astra.sty, explained in astra.pdf. Read the formal requirements for MSc and BSc theses, some advice on English for Swedes, some guidelines for writing a thesis, and a list of Common Errors in English Usage.
We no longer take summer interns.
If you contact us about working under our supervision and it is clear that you have not read this page, then we will not reply, even if you paste one of our names and the title of a recent paper of ours into a generic letter.