2020年運籌學|優化理論|(圖)算法相關會議|暑校彙總--國際版 - 知乎

https://zhuanlan.zhihu.com/p/106289646

本文 @運籌OR帷幄 總結了（部分）2020年運籌學|（優化）算法相關的會議|暑期學校，爲不徹底列表，不斷更新中，也歡迎同行們在評論區補充。
其中* 表明與運籌學|優化很是相關，**表明是運籌優化領域的國際大會。

首先爲你們分享THIAGO SERRA教授總結的2020.04-09之間運籌學相關的暑期學校：

https://thiagoserra.com/2020/01/19/summer-2020-schools-on-algorithms-data-science-machine-learning-networks-optimization-transportation-and-other-relevant-topics-in-operations-research/​ thiagoserra.com

*SIGOPT 2020: March 4-6, 2020 - TU Dortmund University, Germany

International Conference on Optimization

The SIGOPT conference series addresses the full range of theory and practice in all branches of mathematical optimization, e.g.,

- Linear Programming

- Discrete and Combinatorial Optimization

- Nonlinear Programming

- Mixed-Integer Non-Linear Optimization

- Optimal Control

- Stochastic Programming

- Multiobjective Programming

- Application of Optimization in Real-World Problems

- Optimization on Manifolds

- Robust Optimization

- Convex Optimization

- Conic Optimization

- Machine Learning

- Game Theory and Bilevel Optimization

http://www.wiwi.tu-dortmund.de/sigopt/

*Workshop on Integer and Combinatorial Optimization: March 11-12, 2020 -RWTH Aachen, Germany

The aim of this year's edition is the presentation and discussion of recent trends in combinatorial optimization and, partly, at the intersection of combinatorial optimization and machine learning.

Confirmed plenary speakers are:

* Jannik Matuschke (KU Leuven)
* Sebastian Pokutta (TU+ZIB Berlin)
* Thomas Rothvoss (Washington University)
* Laura Sanità (Eindhoven University)
* Melanie Schmidt (Cologne University)
* Vera Traub (Bonn University)

In addition, there will be a 6-8 contributed shorter talks.

The workshop is free of charge. For organizatorial purposes, please register until the 25th of February on the workshop's website

workshop.oms.rwth-aachen.de

STACS 2020: March 10 - 13, 2020 - Montpellier, France

Typical areas include (but are not limited to):

• Algorithms and data structures,
  including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory.
  
• Automata and formal languages,
  including: algebraic and categorical methods, coding theory.
  
• Complexity and computability,
  including: computational and structural complexity theory, parameterized complexity, randomness in computation;
  
• Logic in computer science,
  including: finite model theory, database theory, semantics, specification verification, rewriting and deduction.
  
• Current challenges,
  for example: natural computing, quantum computing, mobile and net computing, computational social choice.
  

https://stacs2020.sciencesconf.org

Research School on Graph Packing: 19 - 25 April 2020 - Eastbourne, UK

We are inviting applications from PhD students and young researchers for participation in a research school on "Graph Packing":

Lecturers:
- Felix Joos (University of Hamburg, Germany): "Regularity and absorbing for packing"
- Diana Piguet (Czech Academy of Sciences, Prague): "Random processes and packings"
- Alexey Pokrovskiy (Birkbeck, University of London): "Rainbow matchings and packings"

Plenary Speakers:

- Penny Haxell (University of Waterloo, Canada)

- Richard Montgomery (Birmingham University, UK)

- Peter Keevash (University of Oxford, UK)

http://personal.lse.ac.uk/boettche/ResearchSchool/

BAT 2020: April 20-23, 2020 - Paris, France

The Second International Workshop on Blockchain Applications and Theory

Call for papers

Theories of blockchain and distributed ledger technology

* Distributed data store for blockchain

* Distributed transaction for blockchain

* Blockchain in cloud computing

* Blockchain in mobile and edge computing

* Deployment and feasibility study in emerging networks such as VANET,
connected vehicles

* Blockchain in Intelligent Transportation Systems (ITS)

* Blockchain and Financial Networks

* Blockchain in vehicular network

* Blockchain in the Internet of things (IoT)

* Blockchain in Cyber Physical Systems (CPS)

etc..

http://emergingtechnet.org/BAT2020/index.php

*ISCO 2020: May 4-6, 2020 - Montreal, Canada,

6th International Symposium on Combinatorial Optimization

Topics of interest include, but are not limited to

• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithm
• Metaheuristic
• Multiobjective optimization
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms

https://symposia.cirrelt.ca/ISCO2020/en

*2020 MIP Workshop: May 18–21, 2020 -DIMACS, Rutgers University

Mixed Integer Programming Workshop

The MIP Workshops are held annually in North America. MIP 2020 is the 17th workshop in this series. The previous workshops were held in New York (2003), Minneapolis (2005), Miami (2006), Montreal (2007), New York (2008), Berkeley (2009), Atlanta (2010), Waterloo (2011), Davis (2012),Madison (2013), Columbus (2014), Chicago (2015), Miami (2016), Montreal (2017), Greenville (2018), Boston (2019).

https://sites.google.com/view/mipworkshop2020/home

PDCO in conjunction with IEEE IPDPS 2020: May 18-22, 2020 - New Orleans, USA

10th IEEE Workshop on Parallel / Distributed Combinatorics and Optimization (PDCO) in conjunction with IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2020

The IEEE Workshop on Parallel / Distributed Combinatorics and Optimization aims at providing a forum for scientific researchers and engineers on recent advances in the field of parallel or distributed combinatorics for difficult optimization problems, ranging from theoretical to applied problems. The latter include for instance 0-1 multidimensional knapsack problems and cutting stock problems, large scale linear programming problems, nonlinear optimization problems, global optimization and scheduling problems.

Emphasis will be placed on new techniques for solving difficult optimization problems, like cooperative methods for integer programming problems, nature-inspired techniques and hybrid methods. Aspects related to Combinatorial Scientific Computing (CSC) will also be treated. We also solicit submissions of original manuscripts on sparse matrix computations and related topics (including graph algorithms); and related methods and tools for their efficiency on different parallel systems. Applications combining traditional parallel and distributed combinatorics and optimization techniques as well as theoretical issues (convergence, complexity, etc.) are welcome.

Application domains of interest include (but are not limited to) cloud computing, planning, logistics, manufacturing, finance, telecommunications and computational biology.

https://pdco2020.sciencesconf.org/

**CPAIOR 2020: May 26 – 29, 2020 - Vienna, Austria

The 17th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research

It will be co-located the 13th Annual Symposium on Combinatorial Search (SoCS 2020,

socs20.search-conference.org).

- Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangian and convex relaxations, heuristic functions based on
constraint relaxation.

- Search methods: branch and bound, intelligent backtracking, incomplete
search, randomized search, portfolios, column generation, Benders
decompositions or any other decomposition methods, local search,
meta-heuristics.

- AI and Machine Learning techniques applied to solve optimization and
Operations Research problems.

- Integration methods: solver communication, model transformations and
solver selection, parallel and distributed solving, combining machine
learning with combinatorial optimization.

- Modeling methods: comparison of models, symmetry breaking,
uncertainty, dominance relationships.

- Innovative applications of CP/AI/OR techniques.

- Implementation of CP/AI/OR techniques and optimization systems.

https://cpaior2020.dbai.tuwien.ac.at/

**OP20: May 26 - 29, 2020 - The Hong Kong Polytechnic University

SIAM Conference on Optimization

The SIAM Conference on Optimization will feature the latest research on the theory, algorithms, software, and applications of optimization. A particular emphasis will be put on applications of optimization in AI and data science, quantum computing, health care, finance, aeronautics, control, operations research, and other areas of science and engineering. The conference brings together mathematicians, operations researchers, computer and computational scientists, engineers, software developers and practitioners, thus providing an ideal environment to share new ideas and important problems among specialists and users of optimization in academia, government, and industry.

Themes

• Applications in Health Care
• Applications in Energy Networks and Renewable Resources
• Applications in Machine Learning and Artificial Intelligence
• Combinatorial and Mixed Integer Nonlinear Optimization
• Conic Linear Optimization
• Derivative-free Optimization
• Discrete and Combinatorial Optimization
• Equilibrium Programming
• Graphs and Networks
• Nonlinear Optimization
• Optimization in Engineering
• PDE Based Optimization
• Polynomial and SoS Optimization
• Stochastic and Robust Optimization

https://www.polyu.edu.hk/ama/events/conference/op20/en/

*Summer School on Modern Optimization for Transporation: June 1-5, 2020, Fréjus, France

École des Ponts ParisTech organizes a Summer School on Modern Optimization for Transporation, which will be held June 1 - 5, 2020 in Fréjus (French Riviera), with the following lecturers:

- Claudia Archetti (University of Brescia) Solution methods for recent and challenging routing problems
- Michel Bierlaire (École Polytechnique Fédérale de Lausanne) Behavioral optimization
- Luce Brotcorne (Inria Lille) Bilevel Programming and its applications to Network Pricing and Energy Management
- Stein W. Wallace (NHH - Norvegian School of Economics) Handling randomness in logistics modelling

https://cermics.enpc.fr/~parmenta/events/frejus2020/scheduleAndProgram.html

FUN 2020: June 8–10, 2020 - Island of Favignana, Sicily, Italy

The Tenth International Conference on Fun with Algorithms (FUN 2020)

Call for papers

FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with mobile algorithms
FUN with machine learning algorithms

FUN with optimization algorithms
FUN with parallel algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms
FUN with web algorithms

https://sites.google.com/view/fun2020/

*CTW2020 18th Cologne: June 15-17, 2020 - Ischia, Italy

18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

CALL FOR PAPERS

The topic for both type of submission is 「Graphs and Combinatorial Optimization」, i.e., theory and applications of discrete algorithms, graphs and combinatorial optimization in the wider sense.

A special issue of Discrete Applied Mathematics, containing full length papers refereed according to DAM’s high standards, is also planned.

http://ctw2020.iasi.cnr.it/

**ICAPS 2020: June 15 - 19, 2020 - Nancy, France.

The International Conference on Automated Planning and Scheduling (ICAPS) is the premier forum for exchanging news and research results on theory and applications of intelligent planning and scheduling technology.

Schedule

June 8-12: ICAPS-ICRA Summer School
June 14: Doctoral Consortium
June 15-16: Workshops + Tutorials
June 17-19: Main Conference

https://icaps20.icaps-conference.org/

Summer School on Algorithmic Data Analysis: June 15 - 19, 2020 - Bonn, Germany

Confirmed lecturers:

• Ken Clarkson (IBM Research, US)
• Ioannis Emiris (University of Athens, Greece)
• Robert Krauthgamer (Weizmann Institute, Israel)
• David Mount (University of Maryland, US)
• Jeff Phillips (University of Utah, US)
• Ruth Urner (York Uniersity, Canada)

https://www.hcm.uni-bonn.de/events/eventpages/hausdorff-school/hausdoff-school-2020/hs-algorithmic-data-2020/

WAW 2020: June 18-19, 2020 - Warsaw, Poland

17th Workshop on Algorithms and Models for the Web Graph

Submissions are invited in, but not limited to, the following areas:

• Algorithms: graph algorithms, clustering, collaborative filtering, routing optimization.

• Analysis: structural properties, visualization, patterns, communities, discovery, flow simulation.

• Data Models: hypergraph models, graph models, evolution, trust and reputation networks.

• Topics: Web, social networks, transportation networks, communication networks, recommender networks, citation networks, Wikipedia, biological networks, blogs, p2p.

• Applications: web mining, social applications, routing & transportation, web search and ranking.

https://math.ryerson.ca/waw2020/

**IFORS 2020：June 21- 26, 2020 - Seoul, South Korea.

22nd Conference of the International Federation of Operational Research Societies

Call for Papers

Areas:

Applications of OR

Continuous Optimization

Control Theory and System Dynamics

Data Science, Analytics and Performance Measurement

Decision Analysis and Decision Support Systems

Discrete Optimization, Mixed Integer and Constraint Programming

etc..

http://www.ifors2020.kr/

SWAT 2020: June 22-24, 2020 - Torshavn, Faroe Islands

The 17th Scandinavian Symposium and Workshops on Algorithm Theory,

We invite submissions of papers presenting original research on algorithms and data structures. Though we welcome experiments, the theoretical results in the articles will be the main measure for evaluating their merits. Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parametrized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms. The algorithmic problems considered may be motivated by applications, e.g. in optimization, geometry and topology, graph analysis, bioinformatics, visualization, string processing, information retrieval, machine learning, algorithmic game theory, or mechanism design.

https://www.setur.fo/en/education/swat-2020/

*2nd EUROYoung Workshop: 25-26 June 2020 - Porto, Portugal

It's an initiative sponsored by EURO, with the following objectives:

- Fostering collaboration among students and early-career researchers in O.R.

- Providing young O.R. scholars and practitioners with tools to advance their careers, mainly through training.

- Creating networks both among young researchers and with more senior leaders in the field of O.R.

- Connecting demand and offer in the O.R. job market, both in academia and the industry.

https://euroyoung.github.io/workshop20/

AEC 2020: June 29-July 3, 2020 - TU Wien, Vienna, Austria

Conference on "Algorithmic and Enumerative Combinatorics" (AEC 2020)

Algorithmic and Enumerative Combinatorics is the general research area which is defined by the interplay of the fields of Enumerative Combinatorics, Analytic Combinatorics, and Algorithmics. It is a very active research area, which, aside from the three fields fueling each other mutually, receives constant impetus from outside, by its interaction with algebra, probability, statistical physics, and computer science.

There are limited funds available for participant support.

Participants who require support should send an application

with CV and a letter of support to

hui-chun.julia.cheng@univie.ac.at.

https://www.risc.jku.at/conferences/aec2020/

CSR 2020: June 29 - July 03, 2020 - RUSSIA, Ekaterinburg, Russia

15th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM

TOPICS include, but are not limited to:

algorithms and data structures

computational complexity, including hardness of approximation and
parameterized complexity

randomness in computing, approximation algorithms, fixed-parameter
algorithms

combinatorial optimization, constraint satisfaction, operations research

computational geometry

string algorithms

formal languages and automata, including applications to computational
linguistics

codes and cryptography

combinatorics in computer science

computational biology

applications of logic to computer science, proof complexity

database theory

distributed computing

fundamentals of machine learning, including learning theory, grammatical
inference and neural computing

computational social choice

quantum computing and quantum cryptography

theoretical aspects of big data

https://csr2020.sciencesconf.org/

ICALP 2020: July 8 - 11 2020 - Saarbrücken, Germany

Track A -- Algorithmic Aspects of Networks and Networking, Algorithms for Computational Biology, Algorithmic Game Theory, Combinatorial Optimization, Combinatorics in Computer Science, Computational Complexity, Computational Geometry, Computational Learning Theory, Cryptography, Data Structures, Design and Analysis of Algorithms, Foundations of Machine Learning, Foundations of Privacy, Trust and Reputation in Network, Network Models for Distributed Computing, Network Economics and Incentive-Based Computing Related to Networks, Network Mining and Analysis, Parallel, Distributed and External Memory Computing, Quantum Computing, Randomness in Computation, Theory of Security in Networks

Track B -- Algebraic and Categorical Models, Automata, Games, and Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Formal and Logical Aspects of Learning, Logic in Computer Science, Theorem Proving and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Principles and Semantics of Programming Languages, Program Analysis and Transformation, Specification, Verification and Synthesis, Type Systems and Theory, Typed Calculi

https://econcs.pku.edu.cn/icalp2020/

*GECCO 2020: 8-12 July, 2020 - Cancun, Mexico

2020 Genetic and Evolutionary Computation Conference

The Genetic and Evolutionary Computation Conference (GECCO 2020) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper-heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, artificial immune systems, and more.

The full list of tracks is available at:

https://gecco-2020.sigevo.org/index.html/Program+Tracks

CATS 2020：27-31 July 2020 - Sydney

Computational & Algorithmic Topology, Sydney (CATS 2020)

The University of Sydney, 27-31 July 2020

This workshop at the University of Sydney will bring together experts and emerging researchers from Australia, the USA and Europe to report on recent results and explore future directions in computational and algorithmic topology and related areas. There will be a focus on problems in computational geometric topology and computational algebraic topology. This workshop aims to stimulate interaction between researchers in order to bring about new collaborations on difficult problems that cannot be tackled from one viewpoint alone.

https://sites.google.com/view/cats-2020

The Mathematics of Machine Learning: August 3-7, 2020 - Bath, UK

Background

Machine learning (ML) is currently undergoing a massive expansion, due to the unprecedented availability of large amounts of data and computational power. The last decade has seen tremendous improvements in ML methods and achievements in many application areas including (bio-) medical sciences, computer vision and finance to name but a few.

Remarkably, while ML relies on mathematical models and tools, many ML algorithms do not have a rigorous mathematical foundation. One reason for this is that ML has been historically developed as a subfield of computer science rather than mathematics. Fundamental analysis questions are open, such as convergence and convergence rates, or the topology and geometry with which data should be studied.

It is essential that the mathematical community contributes to ML and provides a solid underpinning of ML methods. This Symposium will advocate the connection between ML and many mathematical disciplines, such as numerical analysis, inverse problems, optimisation, statistics, optimal transport, dynamical systems and partial differential equations, in order to shed light into the mysterious mathematical pathways of ML.

Call for Posters

In addition to the invited speakers, there is an opportunity for early career researchers to attend the Symposium and contribute a poster presentation. To apply, please submit a 1 page abstract here by 13th March 2020. Please note that places are limited, and notifications of acceptance will be sent out by 10th April 2020.

https://mathml2020.github.io/

*24th RANDOM & 23rd APPROX: August 17-19, 2020 - U. Washington, Seattle

The 24th International Workshop on Randomization and Computation (RANDOM 2020) and the 23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2020)

RANDOM 2020 focuses on applications of randomness to computational and combinatorial problems while APPROX 2020 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.

TOPICS

Papers are solicited in all research areas related to randomization and approximation, including but not limited to:

RANDOM
* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
etc..

APPROX

* approximation algorithms

* hardness of approximation

* small space, sub-linear time and streaming algorithms

* online algorithms

* approaches that go beyond worst-case analysis

* distributed and parallel approximation

* mathematical programming methods

* combinatorial optimization

* algorithmic game theory, mechanism design and economics

etc..

http://randomconference.wordpress.com

http://approxconference.wordpress.com

*PATAT 2020: August 25-28, 2020 - Bruges, Belgium,

13th International Conference on the Practice and Theory of Automated Timetabling

Call for Papers

Some topics of interest for the conference include, but

are certainly not limited to, the following: timetabling problems,

timetabling algorithms, timetabling applications, and any optimization

problems related to timetabling.

http://patatconference.org/patat2020/

*CO@Work: September 14 - 26, 2020 -Zuse Institute Berlin, Germany

Combinatorial Optimization at Work

CO@Work is a summer school organized byTU Berlinin cooperation with theBerlin Mathematical Schooland with support of the Berlin Mathematics Research CenterMATH+.

http://co-at-work.zib.de/

Symposium GRAPHS ICNAAM: 17-23 September 2020 - Rhodes, Greece

(International Conference of Numerical Analysis and Applied Mathematics 2020),

Topics:

- scores in graphs and digraphs

- Eulerian and Hamiltonian graphs and digraphs

- planar graphs

- graph factors and decompositions

- graph colorings

- extremal graphs

- graph spectra

- tournaments and hypertournaments

- graph algorithms

http://icnaam.org/

The 2020 INFORMS Annual Meeting: November 8-11, 2020 - National Harbor, MD

The 2020 INFORMS Annual Meeting is a unique opportunity to connect and network with the more than 7,000 INFORMS members, students, prospective employers and employees, and academic and industry experts who compose the INFORMS community. We look forward to seeing you and, additionally, celebrating 25 years of INFORMS with you in National Harbor, MD, November 8-11, 2020!

Academics, industry experts, students, INFORMS members, and representatives of government agencies join together in the OR/MS event of the year. Listen to intriguing plenary and semi-plenary presentations, panel discussions, tutorials, and some of the thousands of oral and poster presentations.

http://meetings2.informs.org/wordpress/nationalharbor2020/

額外匯總連接：

https://www.euro-online.org/web/pages/460/calendar

以上爲 @運籌OR帷幄 整理的不徹底列表，不斷更新中，也歡迎同行們在評論區補充。
做者 @留德華叫獸