运筹offer:一周学界招聘总结（2022.12.19-2022.12.23）

岗位1：学界招聘|悉尼大学招募应用数学讲师/高级讲师

We are advertising a 2.5 years postdoctoral research fellowship incomputational geometry at University of Sydney, Australia. Expected startdate is early 2023 (can be negotiated).

The University of Sydney is welcoming applications for a Lecturer (B) /Senior Lecturer (C) in Applied Mathematics to join leading experts at the School of Mathematics and Statistics, within the Faculty of Science. We are one of the largest mathematical sciences schools in Australia, and the University of Sydney is the only Australian university to have received the highest rating of 5 out of 5 for research in the mathematical sciences in every Australian Research Council Excellence in Research for Australia assessment to date.

As a Lecturer/Senior Lecturer in Applied Mathematics you will have the opportunity to make a significant contribution to teaching and learning design, delivery, and evaluation while continuing to build your research contribution, expertise and impact. We are welcoming applicants from different research backgrounds who can bring their own research agenda, complementing the Schools’ current research foci, whilst benefiting from our supportive community of world-class mathematicians and statisticians. Applicants with expertise in computational Mathematics or optimization are particularly encouraged to apply.

岗位2：教职招聘|利兹大学招募教授/副教授

Are you interested in joining a highly ranked School of Computing committed to working at the centre of the global research and innovation community, delivering transformation fundamental and challenge-led research to advance knowledge and tackle major issues to improve the future of our world and also to provide a transformative, research-based education experience for students from diverse backgrounds who develop the knowledge and skills they need to succeed and make a positive impact in the world?

The University of Leeds is ranked in the top 100 universities in the QS World University Rankings in 2023 and the results of the Research Excellence Framework (REF) 2021 identified that 90% of our research is ‘world-leading’ or ‘internationally excellent’.  We have a truly global community, with more than 38,000 students from 170 different countries and over 9,000 staff of 100 different nationalities and we are in touch with more than 281,000 alumni in 190 different countries.  Established in 1904, we have a strong tradition of academic excellence, reflected in first-class student education, along with world-leading research that has a real impact around the globe. A member of the Russell Group of universities, we are one of the UK’s top ten research institutions and one of the UK’s most prestigious and diverse universities.

The School of Computing at the University of Leeds was in the top 10 in the UK REF2021 and has a commitment to excellence in our teaching and vibrant research culture. There are currently around 45 members of academic staff and we are now expanding to create new academic positions.

• 26 days holiday plus approx. 16 Bank Holidays/days that the University is closed by custom (including Christmas) – that’s 42 days a year!

• Generous pension scheme plus life assurance – the University currently contributes 21.6% of the salary.

• Health and Wellbeing: Discounted staff membership options at The Edge, our state-of-the-art campus gym, with a pool, sauna, climbing wall, cycle circuit, and sports halls.

• Personal Development: Access to courses run by our Organisational Development & Professional Learning team, and self-development courses including languages, Creative Writing, Wellbeing Therapies, and much more.

• Access to on-site childcare, shopping discounts, and travel schemes are also available.

Negotiable, dependent on experience

https://jobs.leeds.ac.uk/vacancy.aspx?ref=EPSCP1120

岗位3：学界招聘|里尔大学招募研究员

Research group: BONUS (Big Optimization aNd Ultra-Scale computing)

Research activities: https://www.inria.fr/en/bonus

The INRIA research institute invites applications for multiple permanent researcher positions to start in the 2023-2024 academic year. High performance computing (HPC) and/or Machine Learning-assisted big optimization is among its targeted topics for the recruitment. This hot topic is a major focus of the BONUS research group, which is part of the INRIA center of the University of Lille (North of France). Qualified applicants in computer science are invited to apply with the objective to join the BONUS research group as a permanent researcher.

岗位4：学界招聘|哥本哈根大学招募组合优化博后

We are looking for outstanding junior researchers with an innovative mind-set and intellectual curiosity to strengthen and complement the research profile of the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordström, which is active at both the University of Copenhagen and Lund University on either side of the Øresund Bridge.

The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Gröbner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new, fascinating twists—but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.

We are fortunate to be part of the Algorithms and Complexity Section at DIKU, which is world-leading in algorithms and complexity theory (currently ranked 11th worldwide by CSrankings.org) and has a strong presence at top-tier TCS conferences like STOC, FOCS, and SODA as well as at premier AI venues like AAAI, IJCAI, and NeurIPS. DIKU hosts the Basic Algorithms Research Copenhagen (BARC) centre joint with the IT University of Copenhagen (ITU), and we also have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Øresund Bridge, as well as with our many visitors. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

We currently have openings for both theoretically and practically inclined researchers. There is a lot of flexibility as to what kind of research to pursue, and all candidates are welcome, both those who want to go deep into either theory or practice and those who are inspired by the challenge of bridging the gap between the two.

On the theory side, most of our work is in proof complexity, which studies formal systems for reasoning about logic formulas and other types of problems. Proof complexity has connections to foundational questions in computational complexity theory, but also plays an important role in algorithm analysis by providing a rigorous understanding of the power and limitations of different algorithmic approaches. As often happens in theoretical computer science, our research has revealed deep, and often quite surprising, connections to other areas such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are more than welcome to apply.

On the practical side, we are working on designing efficient algorithms for automated reasoning and combinatorial optimization, and on gaining a more rigorous scientific understanding of such algorithms. We are particularly interested in algorithms that can exploit sophisticated mathematical techniques to achieve exponential improvements in performance compared to the current state of the art—something that theoretical research suggests should be possible, but that has so far been hard to achieve in practice. Our most active line of work is focusing on combining ideas from SAT solving and mixed integer linear programming (MIP) to construct a new 0-1 integer linear programming solver RoundingSat. This solver is already world-leading when it comes to pseudo-Boolean solving, but our goal is to develop it further, integrating ideas also from MaxSAT solving, MIP solving, and possibly also satisfiability modulo theories (SMT) solving and constraint programming (CP), ultimately hoping to go significantly beyond the current state of the art.

Quite recently, we have also begun investigating, and have made research breakthroughs on, how to verify the correctness of state-of-the-art algorithms for automated reasoning and combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our goal is to design a new generation of certifying solvers with so-called proof logging, meaning that the solvers output not only a solution but also a machine-verifiable proof that is easy to check and provides 100% formal guarantees that the claimed solution is correct. Our tool VeriPB can already support efficient proof logging for some solving techniques that have long remained beyond the reach of other tools, and we have recently received prestigious AAAI '22 distinguished paper and SAT '22 best paper awards for our work.

These postdoc positions are full-time research positions for an expected duration of two years. Within the overall framework sketched above, the postdocs will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives visitors on a regular basis.

The starting date is negotiable, but the default would be in August-September 2023.

The University of Copenhagen is currently expanding strongly in computer science. We expect to have tenure-track openings in in the coming years, and welcome postdoctoral researchers interested in exploring such opportunities.

Applicants should have or be about to receive a PhD degree in a subject relevant for the research area, and should have a passionate interest in research. The successful candidate is expected to have a solid background in computer science and mathematics, and should have a strong research record as witnessed by publications in top conferences such as AAAI, IJCAI, SAT, and CP, or in journals of comparable quality.

The working language of the group is English, and knowledge of English is also fully sufficient to navigate every-day life in Scandinavia in general. It might also be worth mentioning that Scandinavian countries routinely score at the absolute top in rankings of quality of life such as, e.g., the OECD Better Life Index.

岗位5：教职招聘|埃因霍芬理工大学招募组合优化助理教授/副教授

Eindhoven University of Technology is an internationally top-ranking university in the Netherlands that combines scientific curiosity with a hands-on attitude. Our spirit of collaboration translates into an open culture and a top-five position in collaborating with advanced industries. Fundamental knowledge enables us to design solutions for the highly complex problems of today and tomorrow. 

Is Combinatorial Optimization your field of research? Are you looking forward to joining an international team of academics working in Combinatorial Optimization?

We have a vacancy offering just that!

The Combinatorial Optimization (CO) Group at Eindhoven University of Technology (TU/e) is looking for a full-time tenure-track assistant/associate professor in Combinatorial Optimization.

This position is part of the Irene Curie fellowship program dedicated to reach at least 30% female researchers among TU/e’s permanent academic staff by 2024 and is only open for female candidates.

Job Description

About the CO group at TU/e

Research at the CO group spans a wide range of topics, including mathematical programming, polyhedral combinatorics, algebraic combinatorics, matroids, scheduling, graph theory and algorithms, approximation, (mathematics of) operations research, and more. Also, we study applications that range from data science via kidney exchange models to fairness, and more. As a new faculty member, you may strengthen the research in one of these existing topics and/or you may expand CO’s research portfolio.

The SPOR cluster
The CO group is part of the cluster Statistics, Probability and Operations Research (SPOR), which is part of the Department of Mathematics and Computer Science. The department operates from the vision that, for the development of innovative solutions to societal challenges, it is crucial to acquire a deep and solid understanding of the fundamentals of mathematics and computer science, while still embedding this knowledge in challenging application areas. SPOR is one of the clusters within the domain of mathematics and conducts theoretical and applied research in statistics, probability theory, operations research, and combinatorial optimization. The SPOR cluster is a vibrant research environment with an excellent collaborative spirit within and between subdisciplines.

The Department of Mathematics and Computer Science
The department provides highly ranked bachelor and master-level programs in mathematics, computer science and data science. In fact, the Industrial and Applied Mathematics program won the prestigious 2022 UPS George Smith Prize, a world-wide recognition acknowledging its excellence in preparing students to become practitioners in industrial and applied mathematics. In addition to its educational role, the department conducts pioneering scientific research in mathematics, data science, and computer science.