This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| International Conference on Integer Programming and Combinatorial Optimization | |
|---|---|
| Name | International Conference on Integer Programming and Combinatorial Optimization |
| Discipline | Operations Research, Optimization, Mathematics |
| Frequency | Biennial |
| First | 1997 |
International Conference on Integer Programming and Combinatorial Optimization is a biennial academic meeting focusing on Integer programming, Combinatorial optimization, Discrete mathematics, Operations research, and related algorithmic theory. The conference draws participants from institutions such as MIT, IBM Research, INRIA, Max Planck Society, and ETH Zurich and interfaces with journals like Mathematical Programming (journal), SIAM Journal on Computing, Journal of the ACM, Operations Research (journal). It is affiliated with professional bodies including INFORMS, Society for Industrial and Applied Mathematics, European Mathematical Society, Association for Computing Machinery, and The Royal Society.
The conference originated from collaborations among researchers associated with Cornell University, Princeton University, University of Waterloo, University of Bonn, and Tokyo Institute of Technology following workshops such as DIMACS and meetings at Mathematical Programming Society gatherings; organizers included figures affiliated with George Dantzig's legacy, Jack Edmonds, George Nemhauser, Michael Held, Hassler Whitney, and Alexander Schrijver institutions. Early editions were influenced by breakthroughs at venues like Bell Labs, Bellman Prize discussions, and symposia connected to ECMI and Fields Institute programs. Over time the conference integrated advances from Gomory cutting-plane work, Karmarkar's algorithmic developments, and structural results from Lovász and Tardos networks, evolving through partnerships with Taiwanese Mathematical Society and Australian Mathematical Society chapters.
The program covers topics ranging from theoretical foundations in Polyhedral combinatorics, Graph theory, Matroid theory, and Complexity theory to applied themes in Supply chain optimization represented by collaborations with Walmart, UPS, Siemens projects, and scheduling problems linked to Airbus and Boeing research groups. Sessions include algorithmic developments such as Branch and bound, Branch and cut, Cutting-plane methods, integer formulations influenced by Knapsack problem variants, set covering families studied in Steiner tree problem contexts, and parameterized complexity results related to Robertson–Seymour theorem applications. Interdisciplinary tracks highlight connections with Cryptography research tied to integer lattices studied by groups at Bell Labs and Microsoft Research, as well as computational algebra techniques from Institute for Advanced Study collaborations.
Governance typically involves program committees composed of researchers from Columbia University, Stanford University, Harvard University, University of California, Berkeley, and Oxford University under chairs who have held roles in Mathematical Optimization Society and INFORMS Optimization Society. The format blends plenary talks by awardees associated with Fulkerson Prize, John von Neumann Theory Prize, and Gödel Prize recognition, invited tutorials by academics from Princeton Plasma Physics Laboratory collaborations, contributed paper sessions, poster sessions often echoing exhibits at Eurocomb and doctoral consortia linked to EurAI initiatives. Organizational logistics coordinate with local hosts such as University of Lisbon, National University of Singapore, University of British Columbia, and facilities like Conference Center Basel, adapting hybrid models influenced by event management at World Economic Forum and United Nations conference protocols.
Proceedings are published in peer-reviewed volumes by publishers such as Springer Science+Business Media in the Lecture Notes in Computer Science and Lecture Notes in Mathematics series, with select extended versions appearing in Mathematical Programming, SIAM Journal on Discrete Mathematics, and Discrete Applied Mathematics. Submission and review policies align with standards from ACM and IEEE conferences, and datasets or software artifacts are archived in repositories associated with Zenodo, GitHub, and institutional archives at National Institutes of Health-style data services or university digital libraries, following practices promoted by CODATA and Open Science Framework.
The conference has showcased landmark results including advances in fixed-parameter tractability influenced by Downey–Fellows theory, approximation algorithms building on Primal–Dual method frameworks, and cutting-plane refinements related to Gomory–Johnson functions; work presented has later been recognized by awards such as the Fulkerson Prize, Dantzig Prize, and NeurIPS best paper cross-disciplinary attention. Distinguished lectures have been given by members affiliated with Microsoft Research Redmond, Google Research, Amazon Science, and laureates connected to Fields Medal-level institutions, while early-career researchers have received best-paper prizes supported by sponsors like IBM and Siemens.
Past hosts include conferences held at venues such as CMU, ETH Zurich, Tokyo University, University of Melbourne, and University of Bonn, with program highlights collated in edited volumes and special journal issues featuring authors from Princeton, Yale University, University of Chicago, KTH Royal Institute of Technology, and Sorbonne University. Future meetings are announced through channels coordinated with INFORMS and European Mathematical Society calendars and are planned at institutions including prospective hosts like Tsinghua University, University of Toronto, and Ecole Polytechnique with local organizing committees often drawn from regional mathematical societies and industry partners.
Category:Conferences in mathematics