Selected Publications
- Antoine Deza, Shmuel Onn, Sebastian Pokutta, and Lionel Pournin:
Kissing Polytopes.
SIAM Journal on Discrete Mathematics 38 (2024) 2643 – 2664.
- Antoine Deza, Sebastian Pokutta, and Lionel Pournin:
The complexity of geometric scaling.
Operations Research Letters 52 (2024) 107057.
- Antoine Deza, Mingfei Hao, and Lionel Pournin:
Sizing the White Whale.
AdvOL-Report 2022/2, McMaster University (2022).
- Ariel Boucheikhchoukh, Valentin Berger, Christopher Swartz, Antoine Deza, Alexander Nguyen, Shaffiq Jaffer:
Multiperiod refinery optimization for mitigation of the impact of process unit shutdowns.
Computers and Chemical Engineering 164 (2022) 107873
- Antoine Deza and Lionel Pournin:
Primitive point packing.
Mathematika 68 (2022) 979 – 1007.
- Antoine Deza, Kai Huang, and Michael Metel:
Charging station optimization for balanced electric car sharing.
Discrete Applied Mathematics 308 (2022) 187 - 197.
- Antoine Deza and Lionel Pournin:
A linear optimization oracle for zonotope computation.
Computational Geometry: Theory and Applications 100 (2022) 101809.
- Antoine Deza, Frédéric Meunier, and Tal Raviv (Editors):
Optimization and Discrete Geometry.
Discrete Optimization 44 (2022) 100658.
- Antoine Deza, Jean-Baptiste Hiriart-Urruty, and Lionel Pournin:
Polytopal balls arising in optimization.
Contributions to Discrete Mathematics 16 (2021) 125 - 138.
- Antoine Deza, Lionel Pournin, and Rado Rakotonarivo:
The vertices of primitive zonotopes.
Contemporary Mathematics 764 (2021) 71 - 82.
- Antoine Deza, Kai Huang, Hongfeng Liang, and Xiao Jiao Wang:
On inventory allocation for periodic review assemble-to-order systems.
Discrete Applied Mathematics 275 (2020) 29 - 41.
- Anna Deza, Antoine Deza, Zhongyan Guan, and Lionel Pournin:
Distances between vertices of lattice polytopes. (Correction)
Optimization Letters 14 (2020) 309 – 326.
- Antoine Deza, Lionel Pournin, and Noriyoshi Sukegawa:
The diameter of lattice zonotopes.
Proceedings of the American Mathematical Society 148 (2020) 3507 - 3516.
- Antoine Deza, Tomonari Kitahara and Noriyoshi Sukegawa (Editors):
Advances in Optimization.
Discrete Applied Mathematics 275 (2020) 1 - 2.
- Nathan Chadder and Antoine Deza:
Computational determination of the largest lattice polytope diameter.
Discrete Applied Mathematics 281 (2020) 106 - 110.
- Antoine Deza and Lionel Pournin:
Diameter, decomposability, and Minkowski sums of polytopes.
Canadian Mathematical Bulletin 64 (2019) 741 – 755.
- Antoine Deza, Asaf Levin, Syed M. Meesum, and Shmuel Onn:
Hypergraphic degree sequences are hard.
Bulletin of the European Association for Theoretical Computer Science 127 (2019) 63 – 64.
- Antoine Deza, Asaf Levin, Syed M. Meesum, and Shmuel Onn:
Optimization over degree sequences.
SIAM Journal on Discrete Mathematics 32 (2018) 2067 – 2079.
- Antoine Deza, George Manoussakis, and Shmuel Onn:
Primitive zonotopes.
Discrete and Computational Geometry 60 (2018) 27 – 39.
- Antoine Deza, Kai Huang, Hongfeng Liang, and Xiao Jiao Wang:
On component commonality for periodic review assemble-to-order systems.
Annals of Operations Research 265 (2018) 29 - 46.
- Antoine Deza and Lionel Pournin:
Improved bounds on the diameter of lattice polytopes.
Acta Mathematica Hungarica 154 (2018) 457 - 469.
- Antoine Deza and Frédéric Meunier (Editors):
Linear Optimization.
Discrete Applied Mathematics 240 (2018) 1 - 2.
- Marston Conder, Antoine Deza, and Asia Ivic Weiss (Editors):
Discrete Geometry and Symmetry.
Springer Proceedings in Mathematics and Statistics 234 (2018).
- Miguel Anjos and Antoine Deza (Editors):
Paths, pivots, and practice: the power of optimization.
Annals of Operations Research 265 (2018) 1 - 4.
- Antoine Deza, Kai Huang, and Michael Metel:
Managing losses in exotic horse race wagering.
Journal of the Operational Research Society 69 (2018) 319 - 325.
- Shinji Mizuno, Noriyoshi Sukegawa, and Antoine Deza:
An enhanced primal-simplex based Tardos' algorithm.
Journal of the Operations Research Society of Japan 61 (2018) 186 - 196.
- Antoine Deza, George Manoussakis, and Shmuel Onn:
Small Primitive zonotopes.
Springer Proceedings in Mathematics and Statistics 234 (2018) 87 - 107.
- Nathan Chadder and Antoine Deza:
Computational determination of the largest lattice polytope diameter.
Electronic Notes in Discrete Mathematics 62 (2017) 105-110.
- Shinji Mizuno, Noriyoshi Sukegawa, and Antoine Deza:
Small degenerate simplices can be bad for simplex methods.
Journal of the Operations Research Society of Japan 60 (2017) 419 - 428.
- Antoine Deza and Lionel Pournin:
A survey on the diameter of lattice polytopes.
Oberwolfach Reports 14 (2017) 1176 - 1179.
- Antoine Deza and Frantisek Franek:
Bannai et al. method proves the d-step conjecture for strings.
Discrete Applied Mathematics 217 (2017) 488 - 494.
- Antoine Deza, Frantisek Franek, and Mei Jiang:
A computational substantiation of the d-step approach to the number of distinct squares problem.
Discrete Applied mathematics 212 (2016) 81 – 87.
- Antoine Deza and Tamás Terlaky:
Diameter and curvature – pivot and interior point methods.
Oberwolfach Reports 12, Oberwolfach, Germany (2015) 306 – 307.
- Haoyue Bai, Antoine Deza, and Frantisek Franek:
On a lemma of Crochemore and Rytter (Corrigendum).
Journal of Discrete Algorithms 34 (2015) 18 - 22.
- Antoine Deza, Kai Huang, and Michael Metel:
Imperfect demand estimation for new product production planning.
AdvOL-Report 2015/4, McMaster University (2015).
- Antoine Deza, Kai Huang, and Michael Metel:
Chance constrained optimization for targeted Internet advertising.
Omega - International Journal of Management Science 53 (2015) 90 - 96.
- Shinji Mizuno, Noriyoshi Sukegawa, and Antoine Deza:
A primal-simplex based Tardos' algorithm.
Operations Research Letters 43 (2015) 625 - 628.
- Antoine Deza, Frantisek Franek, and Adrien Thierry:
How many double squares can a string contain?
Discrete Applied Mathematics 180 (2015) 52 - 69.
- Antoine Deza, Frédéric Meunier, and Pauline Sarrabezolles:
A combinatorial approach to colourful simplicial depth.
SIAM Journal on Discrete Mathematics 28 (2014) 306 - 322.
- Antoine Deza and Frantisek Franek:
A d-step approach to the maximum number of distinct squares and runs in strings.
Discrete Applied Mathematics 163 (2014) 268 - 274.
- Frédéric Meunier and Antoine Deza:
A further generalization of the colourful Carathéodory theorem.
Discrete Geometry and Optimization, Fields Institute Communications Series 69 (2013) 179 - 190.
- David Bremner, Antoine Deza, William Hua, and Lars Schewe:
More bounds on the diameters of convex polytopes.
Optimization Methods and Software 28 (2013) 442 - 450.
- Karoly Bezdek, Antoine Deza, and Yinyu Ye:
Selected open problems in discrete geometry and optimization.
Discrete Geometry and Optimization, Fields Institute Communications 69 (2013) 321 - 336.
- Andrew Baker, Antoine Deza, and Frantisek Franek:
A computational framework for determining run-maximal strings.
Journal of Discrete Algorithms 20 (2013) 43 - 50.
- Karoly Bezdek, Antoine Deza, and Yinyu Ye (Editors):
Discrete Geometry and Optimization.
Fields Institute Communications 69 (2013).
- Antoine Deza, Tamon Stephen, and Feng Xie:
A note on lower bounds for colourful simplicial depth.
Symmetry 5 (2013) 47 - 53.
- David Bremner, Antoine Deza, Hiroshi Imai, and Sonoko Moriyama (Editors):
Special Issue on Geometry and Optimization.
Computational Geometry 46 (2013) 493.
- Antoine Deza and Frantisek Franek:
On singularities of extremal periodic strings.
Formal Aspects of Computing 206 Shaker (2013) 125 – 134.
- Antoine Deza, Sonoko Moriyama, Hiroyuki Miyata, and Feng Xie:
Hyperplane arrangements with large average diameter: a computational approach.
Advanced Studies in Pure Mathematics 62 (2012) 59 - 74.
- Antoine Deza, Frantisek Franek, and Min Jing Liu:
On a conjecture of Erdős for multiplicities of cliques.
Journal of Discrete Algorithms 17 (2012) 9 - 14.
- Andrew Baker, Antoine Deza, and Frantisek Franek:
On the structure of run-maximal strings.
Journal of Discrete Algorithms 10 (2012) 10 - 14.
- Antoine Deza, Frantisek Franek, and Mei Jiang:
A computational framework for determining square-maximal strings.
Proceedings of Prague Stringology Conference, Prague, Czech Republic (2012) 111 - 119.
- Antoine Deza, Chris Dickson, Tamás Terlaky, Anthony Vannelli, and Hu Zhang:
Global routing in VLSI design: algorithms, theory, and computational practice.
Journal of Combinatorial Mathematics and Combinatorial Computing 80 (2012) 71 - 93.
- Andrew Baker, Antoine Deza, and Frantisek Franek:
A parameterized formulation for the maximum number of runs problem.
Festschrift for Borivoj Melichar, Czech Technical University, Prague, Czech Republic (2012) 102 - 117.
- Antoine Deza, Tamon Stephen, and Feng Xie:
More colourful simplices.
Discrete and Computational Geometry 45 (2011) 272 - 278.
- Antoine Deza, Frantisek Franek, and Mei Jiang:
A d-step approach for distinct squares in strings.
Lecture Notes in Computer Science 6661 Springer-Verlag, Berlin (2011) 77 - 89.
- Grant Custard, Antoine Deza, Tamon Stephen, and Feng Xie:
Small octahedral systems.
Proceedings of the 23rd Canadian Conference on Computational Geometry, Fields Institute, Toronto, Canada (2011) 267 - 271.
- Antoine Deza and Feng Xie:
On the generalized Berge sorting conjecture.
Journal of Discrete Algorithms 8 (2010) 1 - 7.
- Antoine Deza, Frantisek Franek, William Hua, Mariusz Meszka, and Alexander Rosa:
Solutions to the Oberwolfach problem for orders 18 to 40.
Journal of Combinatorial Mathematics and Combinatorial Computing 74 (2010) 95 - 102.
- Antoine Deza, Tamás Terlaky, and Yuriy Zinchenko:
Central path curvature and iteration-complexity for redundant Klee-Minty cubes.
Advances in Mechanics and Mathematics 17 (2009) 223 - 256.
- Antoine Deza and Feng Xie:
Hyperplane arrangements with large average diameter.
Centre de Recherches Mathématiques Series 48 (2009) 103 - 114.
- Antoine Deza, Tamás Terlaky, and Yuriy Zinchenko:
A continuous d-step conjecture for polytopes.
Discrete and Computational Geometry 41 (2009) 318 - 327.
- David Avis, David Bremner, and Antoine Deza (Editors):
Polyhedral Computation.
Centre de Recherches Mathematiques Series 48 (2009).
- David Bremner, Antoine Deza, and Michael Soltys (Editors):
Selected Papers from the Franco-Canadian Workshop on Combinatorial Algorithms.
Journal of Combinatorial Optimization 16 (2008) 323.
- Antoine Deza, Sui Huang, Tamon Stephen, and Tamás Terlaky:
The colourful feasibility problem.
Discrete Applied Mathematics 156 (2008) 2166 - 2177.
- Antoine Deza, Tamás Terlaky, Feng Xie, and Yuriy Zinchenko:
Diameter and curvature: intriguing analogies.
Electronic Notes in Discrete Mathematics 31 (2008) 221 - 225.
- David Bremner, Antoine Deza, and Feng Xie:
The complexity of the envelope of line and plane arrangements.
Optimization - Modeling and Algorithms 21 Institute of Statistical Mathematics, Tokyo, Japan (2008) 1 - 7.
- Antoine Deza, Tamás Terlaky, and Yuriy Zinchenko:
Polytopes and arrangements : diameter and curvature.
Operations Research Letters 36 (2008) 215 - 222.
- Antoine Deza, Eissa Nematollahi, and Tamás Terlaky:
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Mathematical Programming 113 (2008) 1 - 14.
- Antoine Deza and Feng Xie:
Line and plane arrangements with large average diameter.
Proceedings of the 5th Hungarian-Japanese Symposium on Discrete Mathematics and its Applications, Sendai, Japan (2007) 106 - 111.
- Antoine Deza and Gabriel Indik:
A counterexample to the dominating set conjecture.
Optimization Letters 1 (2007) 163 - 169.
- Antoine Deza and William Hua:
Berge sorting.
Pacific Journal of Optimization 3 (2007) 27 - 35.
- David Avis, and Antoine Deza:
Un des "problèmes plaisans et délectables" de Claude Berge.
Discrete Mathematics 306 (2006) 2299 - 2302.
- Antoine Deza, Eissa Nematollahi, Reza Peyghami, and Tamás Terlaky:
The central path visits all the vertices of the Klee-Minty cube.
Optimization Methods and Software 21 (2006) 851 - 865.
- Antoine Deza, Sui Huang, Tamon Stephen, and Tamás Terlaky:
Colourful simplicial depth.
Discrete and Computational Geometry 35 (2006) 597 - 615.
- Antoine Deza, Boris Goldengorin, and Dmitrii Pasechnik:
The isometries of the cut, metric and hypermetric cones.
Journal of Algebraic Combinatorics 23 (2006) 197 - 203.
- Antoine Deza, Komei Fukuda, Tomohiko Mizutani, and Cong Vo:
On the face-lattice of the metric polytope.
Lecture Notes in Computer Science 2866 Springer-Verlag, Berlin (2003) 118 - 128.
- Antoine Deza and Shmuel Onn:
Solitaire lattices.
Graphs and Combinatorics 18 (2002) 227 - 243.
- Antoine Deza, Tomohiko Mizutani, and Dmitrii Pasechnik:
Enumerating faces of polyhedra with large symmetry group.
Optimization - Modeling and Algorithms 15 Institute of Statistical Mathematics, Tokyo, Japan (2002) 179 - 185.
- David Avis and Antoine Deza:
On the binary solitaire cone.
Discrete Applied Mathematics 115 (2001) 3 - 14.
- Antoine Deza, Komei Fukuda, Dmitrii Pasechnik, and Masanori Sato:
On the skeleton of the metric polytope.
Lecture Notes in Computer Science 2098 Springer-Verlag, Berlin (2001) 125 - 136.
- David Avis and Antoine Deza:
On the solitaire cone and its relationship to multi-commodity flows.
Mathematical Programming 90 (2001) 27 - 57.
- Antoine Deza, Komei Fukuda, Dmitrii Pasechnik, and Masanori Sato:
Generating vertices with symmetries.
Proceedings of the 5th Workshop on Algorithms and Computation, Tokyo University, Japan (2000) 1 - 8.
- David Avis, Antoine Deza, and Shmuel Onn:
A combinatorial approach to the solitaire game.
IEICE Transactions E83-A (2000) 656 - 661.
- Antoine Deza:
Necessary conditions for solitaire feasibility.
Optimization - Modeling and Algorithms 13 Institute of Statistical Mathematics, Tokyo, Japan (2000) 200 - 215.
- Antoine Deza and Shmuel Onn:
Odd central square solitaire.
Kokyuroku 1114 Research Institute for Mathematical Sciences, Kyoto University, Japan (1999) 96 - 105.
- Antoine Deza, Michel Deza, and Viatcheslav Grishukhin:
Fullerenes and coordinations polyhedra versus half-cubes embeddings.
Discrete Mathematics 192 (1998) 41 - 80.
- Antoine Deza, Michel Deza, and Komei Fukuda:
On skeletons, diameters and volumes of metric polyhedra.
Lecture Notes in Computer Science 1120 Springer-Verlag, Berlin (1996) 112 - 128.
- Antoine Deza and Michel Deza:
The combinatorial structure of small cut and metric polytopes.
Combinatorics and Graph Theory 95 World Scientific, Singapore (1995) 70 - 88.
- Antoine Deza and Michel Deza:
Skeletons of some polytopes related to the n-cube.
Selected Papers of the Berlin International Conference on Operations Research Springer-Verlag (1995) 81 - 85.
- Antoine Deza and Michel Deza:
On the skeleton of the dual cut polytope.
Contemporary Mathematics 178 (1994) 101 - 111.
- Antoine Deza:
Shape of the equicut polytope.
Optimization - Modeling and Algorithms 61 - 5 Institute of Statistical Mathematics, Tokyo, Japan (1994) 81 - 87.
- Antoine Deza, Komei Fukuda, and Vera Rosta:
Wagner's theorem and combinatorial enumeration of 3-polytopes.
Kokyuroku 872 Research Institute for Mathematical Sciences, Kyoto University, Japan (1994) 30 - 34.
- Antoine Deza and Michel Deza:
The ridge graph of the metric polytope and some relatives.
Polytopes: Abstract, Convex and Computational, NATO ASI Series, Kluwer (1994) 359 - 372.
- Antoine Deza:
On lower bound for general convex polytopes.
Mathematica Japonica 40 (1994) 371 - 380.
- Antoine Deza and Komei Fukuda:
McMullen's conditions and some lower bounds for general convex polytopes.
Geometriae Dedicata 52 (1994) 165 - 173.Selected Talks