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

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.

Théorie des graphes et combinatoire,    Algorithmes et structures de données

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.

Théorie des graphes et combinatoire,    Algorithmes et structures de données

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)

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

COIA-2024 will offer an excellent forum for discussion and exchange of ideas for researchers and practitioners in the field of control and optimization from all over the world and with its respected speakers, leading dedicated scientific journals and prestigious sponsor organizations will continue the success of the previous conferences.

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.

Université Mouloud Mammeri, Faculté des Sciences

MOAD’2024 aims to establish an outstanding international forum for sharing knowledge and results in the theory, methodology, and application impacts and challenges of decision-making. It provides a platform for researchers and practitioners from academia and industry to meet, exchange ideas, and share cutting-edge developments in the field.

Optimization, Statistics, Probability, Stochastic Processes, Control, Graph Theory, Numerical Analysis, Mathematical Modeling, Applications to Engineering Sciences.

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.

Association of Latin-Iberoamerican Operational Research Societies (ALIO)

The primary objective of AFROS 2024 is to provide a platform for the presentation and discussion of recent developments, applications, and emerging trends in OR/MS within the African context and beyond. We aim to foster knowledge exchange and collaboration among researchers, practitioners, and industry professionals, promoting the advancement of OR/MS in diverse sectors.

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

Eurandom

The conference will bring together researchers with backgrounds in operations management, statistics, stochastic modelling, data science and control to discuss contemporary queueing-related challenges. The increasing availability of empirical data in the operation of large computer networks and in the management of human service systems is creating new opportunities for study in queueing theory. The objective of the workshop is to highlight and discuss future directions in data-driven queueing that arise in modelling, monitoring and controlling queues, and in dealing with parameter uncertainty, when there is access to operational data.

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