Konferenzen  >  Mathematik  >  Optimierungsrechnung, Entscheidungsunterstützung

California Institute of Technology (Caltech)

Neuronale Netze und Künstliche Intelligenz, Maschinelles Lernen,    Computer-gestütztes Beweisen

Universidad Técnica Federico Santa María, Valparaíso, Chile

The goal of the conference “Numerical methods for optimal transport problems, mean field games, and multi-agent dynamics” is to share and discuss the advances in numerical techniques for the resolution of optimal transport problems, mean field games, and multi-agent dynamics. Several methodologies have been developed in parallel in these fields in the last years, which opens the door to new collaborations because of the relations among the three topics. We expect to motivate these collaborations via plenary talks of experts in the three fields, thematic sessions, and a summer school to incorporate students in order to extend the arising connections.

Center for Mathematical Modeling, Santiago – Chile

This version of the International Conference on Variational Analysis and Optimization aims to recognize and celebrate the remarkable contributions of Professor Boris S. Mordukhovich to the field of Variational Analysis and generalized differentiation. As one of the most prominent mathematicians in this field, Professor Mordukhovich has made exceptional contributions, paving the way for significant advancements in the field.

The KAUST Research Conference on Divide, Conquer, and Combine Methods in Large-scale Simulation and Analytics, a.k.a. the 28th International Conference on Domain Decomposition Methods (DD28), will be held at the King Abdullah University of Science and Technology, on the Red Sea in Saudi Arabia, from January 28 to February 1, 2024.

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

The Latin American Workshop on Optimization and Control is organized on a biennial basis with the main goal of boosting the development and interaction between these two scientific disciplines in Latin America, by gathering together outstanding senior and junior researchers, postdoctoral fellows and graduate students working in these fields.

An additional goal of the workshop is to increase the visibility of Optimization and Control among advanced undergraduate students (in Mathematics, Computer Science, Engineering, Physics, Economics, and others), as well as within the different companies and institutions of the society.

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Société de Mathématiques Appliquées et Industrielles (SMAI)

Du 27 au 29 mars 2024, l'Université de Lyon accueille les journées SMAI-MODE, la conférence biennale du groupe MODE de la Société de Mathématiques Appliquées et Industrielles (SMAI).

Optimisations discrète et continue, déterministe et stochastique ; Méthodes numériques pour l’optimisation ; Calcul des variations, contrôle optimal, théorie des jeux ; Mathématiques de l’image et du signal ; Optimisation de formes ; Applications industrielles, en économie et en finance, en sciences sociales.

The 24th European Conference on Evolutionary Computation in Combinatorial Optimisation is a multidisciplinary conference that brings together researchers working on applications and theory of evolutionary computation methods and other metaheuristics for solving difficult combinatorial optimisation problems appearing in various industrial, economic, and scientific domains.

Soft Computing, Evolutionäre Algorithmen, metaheuristische Optimierung, Fuzzylogik ,    Graphentheorie und Kombinatorik

CIRM – Centre International de Rencontres Mathématiques

This is the 21st edition of the series of French-German conferences which initiated in Oberwolfach, Germany, in 1980. Since 1998, the conference has been organized under the participation of a third invited European country. This time it will be jointly organized with Spain and will take place at the Campus of Gijón of the University of Oviedo. The French German Spanish conference in optimization will take place in June 18-21 of 2024

Danish OR Society (DORS)

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), IWOCA has provided an annual forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business. Previous IWOCA and AWOCA meetings have been held in Australia, Canada, Czech Republic, Finland, France, Germany, India, Indonesia, Italy, Japan, Singapore, South Korea, UK, Taiwan and USA.

Graphentheorie und Kombinatorik,    Algorithmen und Datenstrukturen

IPCO (Integer Programming and Combinatorial Optimization) is a conference that is sponsored by the Mathematical Programming Society. IPCO is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications of integer programming and combinatorial optimization.

Graphentheorie und Kombinatorik,    Algorithmen und Datenstrukturen

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.

ICMS - International Centre for Mathematical Sciences

The theme of this meeting, which links academia, industry and government, is historical analysis (HA), the sub-discipline of operational research which conducts quantitative studies of historical warfare and other operations to learn lessons for contemporary defence and security. In addition to attendees from industry and government already familiar with the area, the meeting aims to attract academic operational researchers, mathematicians and statisticians with a strong interest in history, and historians sympathetic to quantitative approaches. Talks and discussions will be accessible to all, with the aim of the meeting being to seed innovative technique and analysis both directly in HA and across the traditional academic divide between history and the mathematical sciences.

ISMP is a triennial conference on mathematical optimization, gathering scientists from around the world to present and share their most recent advances and development in the field. It is also a unique opportunity to discuss new challenges and opportunities in practice and theory of mathematical optimization.

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

Infinitesimalrechnung, Differentialgleichungen, Integralrechnung,    Komplexe Systeme und Chaos

The International Conference on Optimization and Decision Science is organized by AIRO, the Italian Operations Research Society

The Conference theme is open in the fields of operations research, optimization, problem solving and decision making, and their applications. A special focus will be on the theme “Operations Research: closing the gap between research and practice”.

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.

Association of Latin-Iberoamerican Operational Research Societies (ALIO)

The Latin-Iberoamerican Conference on Operations Research (CLAIO) is the conference of the Association of Latin-Iberoamerican Operational Research Societies (ALIO). It has occurred biennially since 1982 in different Latin American cities. The main goals of this conference are to further the exchange of experiences, to establish and deepen ties between researchers and practitioners in the region, and to help young undergraduate and graduate students in their professional development. The Mexican Society of Operations Research will organize the XXII edition of CLAIO, which will take place in Guadalajara, Mexico, from October 28 to November 1, 2024. The conference purposefully coincides with the Mexican "Dead festivities". Moreover, Guadalajara is the region of Tequila houses.

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