Conférences  >  Mathématiques  >  Optimisation, recherche opérationnelle  >  Allemagne

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Traffic assignment models are crucial for traffic planners to be able to predict traffic distributions, especially, in light of possible changes of the infrastructure, e.g., road constructions, traffic light controls, etc. There is a trend in the transportation community (science as well as industry) to base such predictions on complex computer-based simulations that are capable of resolving many elements of a real transportation system. Moreover, cities worldwide, driven by critical sustainability goals, are developing digital twins of their transportation networks to inform the design and the operations of these intricate networks. On the other hand, the theory of dynamic traffic assignments in terms of equilibrium existence, computability and efficiency, has not matured to the point matching the model complexity inherent in simulations. This Dagstuhl Seminar, which is the fourth in a row on this topic, aims at bringing together leading scientists in the areas traffic simulations, algorithmic game theory (AGT), and dynamic traffic assignment (DTA), as well as applied researches from industry.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Calcul infinitésimal, équations différentielles et intégrales,    Systèmes complexes et chaos

Diagrams is the only conference series that provides a united forum for all areas that are concerned with the study of diagrams and has a multidisciplinary emphasis. DIAGRAMS’24 is the fourteenth conference in the series that started in 2000. The multidisciplinary nature of Diagrams means it encompasses: architecture, art, artificial intelligence, biology, cartography, cognitive science, computer science, education, graphic design, history of science, human-computer interaction, linguistics, logic, mathematics, philosophy, psychology, and software modelling. The conference attracts a large number of researchers from these interrelated fields, positioning Diagrams as the major international event in the area.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Many discrete optimization problems can be modelled as graph problems, leading to a long list of well-studied problems, which include graph partitioning, covering and packing problems, network design problems, width parameter problems, and so on. Most of these graph problems are computationally hard. However, this situation may change if we require the input to belong to some special graph class. This leads to two fundamental questions, which lie at the heart of our Dagstuhl Seminar: for which classes of graphs can a computationally hard graph problem be solved in polynomial time, and for which classes of graphs does the problem remain hard? In our seminar, we aim to discover new insights that lead to results for a whole range of problems rather than just for a single problem alone.

Graph Algorithms, Graph Classes, Graph Containment, Relations, Parameterized Complexity, Width Parameters

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Géométrie et topologie,    Réseaux de neurones et intelligence artificielle, apprentissage automatique