Sort by
Refine Your Search
-
Category
-
Country
-
Program
-
Employer
- CNRS
- Delft University of Technology (TU Delft)
- NEW YORK UNIVERSITY ABU DHABI
- Nature Careers
- Northeastern University
- Chalmers University of Technology
- Nanyang Technological University
- Oak Ridge National Laboratory
- Universidade de Coimbra
- University of Lund
- University of Southern Denmark
- Auburn University
- Bilkent University
- CSIC
- Delft University of Technology (TU Delft); yesterday published
- Eindhoven University of Technology (TU/e)
- FAPESP - São Paulo Research Foundation
- Grenoble INP - Institute of Engineering
- Institute for Basic Science
- Institute of Physical Chemistry, Polish Academy of Sciences
- Lodz University of Technology
- Lunds universitet
- NIST
- Simon Fraser University
- Stanford University
- Technical University of Munich
- Tokyo University of Agriculture and Technology
- University of Bergen
- University of Hamburg
- University of Idaho
- University of Kansas Medical Center
- University of North Carolina at Charlotte
- University of Pennsylvania
- University of Primorska
- University of Texas at Austin
- University of Texas at Dallas
- Università degli Studi Firenze
- Université libre de Bruxelles (ULB)
- Washington State University
- Wydział Matematyki Fizyki i Informatyki UG
- Örebro University
- 31 more »
- « less
-
Field
-
necessary to make closely related decisions while ensuring that complex constraints are met and optimizing the often-conflicting criteria of different stakeholders. The objective of this research is to design
-
state, Brazil) is offering one post-doctoral position funded by FAPESP, the São Paulo Research Foundation. The project involves developing combinatorial optimization models and methods applied to packing
-
in practice. Our most recent new line of research is on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even
-
of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our work on designing
-
of research is on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes
-
, distinguishing between combinatorial and continuous optimization tasks. Benchmarks will be established to quantitatively link the characteristic properties of Rydberg quantum hardware to the complexity and
-
or optimization Constrained or combinatorial query evaluation Data modeling under uncertainty or imprecision Design and implementation of database or data analysis systems Excellent programming and prototyping
-
optimization and explore applications in combinatorial problem-solving. Who we are looking for The following requirements are mandatory: To qualify as a Doctoral student, you must have a Master's degree
-
Science, Industrial Engineering, or a closely related field by start date. Demonstrated expertise in optimization (e.g., convex/nonconvex, stochastic, combinatorial), probability and stochastic processes, numerical
-
theory. The researcher will work in the G-SCOP laboratory, in the "Combinatorial Optimization" team, on geometric aspects of graph theory, in particular the links between structure and metric, and the