Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Employer
- CNRS
- Delft University of Technology (TU Delft)
- NEW YORK UNIVERSITY ABU DHABI
- Nanyang Technological University
- Nature Careers
- Northeastern University
- Oak Ridge National Laboratory
- Stanford University
- Technical University of Munich
- Universidade de Coimbra
- University of Lund
- Auburn University
- Bilkent University
- Delft University of Technology (TU Delft); yesterday published
- Eindhoven University of Technology (TU/e)
- Grenoble INP - Institute of Engineering
- Institute for Basic Science
- KU LEUVEN
- Lodz University of Technology
- Lunds universitet
- NIST
- New York University
- Simon Fraser University
- Tokyo University of Agriculture and Technology
- University of Bergen
- University of Hamburg
- University of Idaho
- University of Kansas Medical Center
- University of Pennsylvania
- University of Primorska
- University of Southern Denmark
- University of Texas at Austin
- University of Vienna
- Université libre de Bruxelles (ULB)
- Washington State University
- Wydział Matematyki Fizyki i Informatyki UG
- Örebro University
- 27 more »
- « less
-
Field
-
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
-
Description The field of combinatorial optimization is concerned with developing generic tools that take a declarative problem description andautomatically compute an optimal solution to it. Often, users
-
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
-
-capacity detector. Its objective is to achieve the quantitative determination of metallurgical evolutions, resolved in time but also in space, of chemical compositions (concept of combinatorial metallurgy
-
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
-
, combinatorial optimization, or coding theory; 3. Proficiency in English; 4. Programming experience (Python/Julia, Sagemath, GAP, semidefinite programming) is a plus; 5. Proactive with a good ability for
-
outstanding research potential in all fields of Discrete Mathematics with emphasis on Structural Graph theory, Extremal Graph Theory, Combinatorial Optimization, Matroid Theory, and Algorithms. This appointment
-
three scientific research departments, themselves organized into teams. The PhD will take place more specifically within the MAORE team, whose members use tools from combinatorial optimization, graph