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

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

The 25th 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. Successfully solved problems include, but are not limited to, multi-objective, uncertain, dynamic and stochastic problems in the context of scheduling, timetabling, network design, transportation and distribution, vehicle routing, stringology, graphs, satisfiability, energy optimisation, cutting, packing, planning and search-based software engineering. Successfully addressed theoretical and translational challenges encompass, but are not limited to, the development and analysis of novel (components of) evolutionary and other metaheuristic algorithms, work on neighbourhood and landscape structures, problem-agnostic and problem-specific variation operators, parallelisation strategies, and hybridizations. ⁠

Institute of Mathematics & its Applications (IMA)

The conference will be held at the beautiful and easily accessible Conference Centre Aston in Birmingham and will showcase activities from across all areas of OR. We welcome contributions that are empirically motivated and with a focus on application, as well as those that are theoretically driven. The conference will host plenaries from leading international experts, sessions of themed talks, as well as poster sessions, and will provide plenty of opportunities for networking.

Kathmandu University, Nepal

We are delighted to announce the International Conference on Non-linear Analysis and Optimization (ICAN-OPT_NEPAL_2025), from May 08 to 10, 2025, at Kathmandu University, Dhulikhel, Nepal including a Workshop on Fixed Point Theory and Applications. This event is organized by Kathmandu University in collaboration with Tribhuvan University, Nepal Sanskrit University, and Nepal Mathematical Society.

This conference will cover diverse topics like Non-linear Analysis, Fixed Point Theory, Operator Theory, Complex Analysis, Harmonic Analysis, Wavelet Analysis, Special Functions, Functional Analysis, Fourier Analysis, Numerical Analysis, Convex Analysis, Optimization Theory, Queueing Theory, Finance & Economics, Differential Equations, Mathematical Biology, Mathematical Modelling, Data Science, and Machine Learning.

MIP 2025 is supported by the Mixed Integer Programming Society (MIPS), which is a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. The 2025 edition of the workshop will be the twenty-second in the MIP series.

Algorithmes et structures de données,    Cours et évènements pour étudiants en mathématiques

EURO 2025 is hosted by the Operational Research Society

CIRM – Centre International de Rencontres Mathématiques

Ergodic optimization is a general framework in dynamical system where an observable is understood through its minimum over the set of invariant probability measures. A measure that attained that minimum is called minimizing. The general question is to understand the set of minimizing measures and more generally the set of minimizing orbits. One possible approach is to see minimizing measures as ground states, that is as limits of Gibbs measures at zero temperature. Gibbs measures are eigensolutions of the Ruelle operator or the transfer operator. We intend to study such questions in the framework of skew products of dynamical systems where the base dynamics is random (ergodic and invertible) and the fiber dynamics is a composition of maps indexed by a random environment. The problem of optimizing an observable in a random environment is new and has not yet been studied.

The MIP European Workshop 2025 is supported by the Mixed Integer Programming Society (MIPS), a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. It brings together researchers, students, and industry actors from around the globe, fostering collaboration and providing a showcase for students, early career academics, and developments in industry and novel applications. In this edition, we are putting a special focus on bringing a considerable number of speakers based in different countries of South America.

The MIP European Workshop is part of the MIP International Workshop series, held in addition to the classical MIP Workshop.

Algorithmes et structures de données,    Cours et évènements pour étudiants en mathématiques

TU Wien, Research Unit for Variational Analysis, Dynamics and Operations Research

A well established conference on Optimal Control (ODF, PDE), Dynamic Games/Mean Field Games, Continuous Optimization; Shape Optimization, Mathematical Economics, and Industrial Applications. The organisation committee is lead by Aris Daniilidis. The conference features invited speakers, 5 parallel sessions over 4 days and contributed talks and posters. Registration opens January 2025.

Event Secretariat;     Email.: vc2025@tuwien.ac.at

Optimal Control (ODF, PDE), Dynamic Games/Mean Field Games, Continuous Optimization, Shape Optimization, Mathematical Economics, Industrial Applications

Systèmes, contrôle et automatisation,    Mathématiques appliquées (en général)

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

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

The Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS) is a biennial event that brings together researchers and practitioners from around the world. Since 2001, LAGOS has served as a key forum for the exchange of ideas and collaboration. It is the merger of two Latin American conferences: the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO) and the Latin American Conference on Combinatorics, Graphs, and Applications (LACGA).

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

MIP South America is supported by the Mixed Integer Programming Society (MIPS), a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. It brings together researchers, students, and industry actors from around the globe, fostering collaboration and providing a showcase for students, early career academics, and developments in industry and novel applications. In this edition, we are putting a special focus on bringing a considerable number of speakers based in different countries of South America.

Algorithmes et structures de données,    Cours et évènements pour étudiants en mathématiques