Antoine Deza - McMaster Experts

Affiliations

Faculty of Engineering, McMaster University
Director, MacDATA Institute, McMaster University
Professor, Computing and Software, Faculty of Engineering
Associate Member, Mathematics and Statistics, Faculty of Science

Research Areas

Scholarly Activity in McMaster Experts

Co-author Network

Scholarly Activity
Research
Teaching
Contact
View All

selected scholarly activity

chapters
- A combinatorial approach to colourful simplicial depth. 579-582. 2013
- Selected Open Problems in Discrete Geometry and Optimization. Fields Institute Communications. 321-336. 2013
- Skeletons of Some Relatives of the N-Cube. 81-85. 1995
- On the skeleton of the dual cut polytope. Contemporary Mathematics. 101-111. 1994
conferences
- The vertices of primitive zonotopes. Contemporary Mathematics. 71-81. 2021
- On inventory allocation for periodic review assemble-to-order systems. Discrete Applied Mathematics. 29-41. 2020
- Preface. Springer Proceedings in Mathematics and Statistics. v-vi. 2018
- Small Primitive Zonotopes. Springer Proceedings in Mathematics and Statistics. 87-107. 2018
- A Computational Framework for Determining Square-maximal Strings. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012. 111-119. 2012
- Hyperplane arrangements with large average diameter: a computational approach. Advanced Studies in Pure Mathematics. 59-+. 2012
- Pushing the boundaries of polytopal realizability. Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 2011
- Small octahedral systems. Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011. 2011
- A Parameterized Formulation for the Maximum Number of Runs Problem. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2011. 74-82. 2011
- A d-Step Approach for Distinct Squares in Strings. Lecture Notes in Computer Science. 77-89. 2011
- EPS AND ORGANIC LAW OF EDUCATION: EXPERIENCE IN INTERAGENCY COORDINATION IN ALCORCON. Gaceta Sanitaria. 116-116. 2009
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes. ADVANCES IN APPLIED MATHEMATICS AND GLOBAL OPTIMIZATION. 223-256. 2009
- On the Face Lattice of the Metric Polytope. Lecture Notes in Computer Science. 118-128. 2003
- On the binary solitaire cone. Discrete Applied Mathematics. 3-14. 2001
- On the Skeleton of the Metric Polytope. Lecture Notes in Computer Science. 125-136. 2001
- On skeletons, diameters and volumes of metric polyhedra. Lecture Notes in Computer Science. 112-128. 1996
- The Ridge Graph of the Metric Polytope and Some Relatives. POLYTOPES: ABSTRACT, CONVEX AND COMPUTATIONAL. 359-372. 1994
journal articles
- The complexity of geometric scaling. Operations Research Letters. 52:107057-107057. 2024
- Multiperiod refinery optimization for mitigating the impact of process unit shutdowns. Computers and Chemical Engineering. 164:107873-107873. 2022
- Primitive point packing. Mathematika. 68:979-1007. 2022
- Preface: Optimization and Discrete Geometry. Discrete Optimization. 44:100658-100658. 2022
- Charging station optimization for balanced electric car sharing. Discrete Applied Mathematics. 308:187-197. 2022
- A linear optimization oracle for zonotope computation. Computational Geometry: Theory and Applications. 100:101809-101809. 2022
- POLYTOPAL BALLS ARISING IN OPTIMIZATION. Contributions to Discrete Mathematics. 16:125-138. 2021
- Computational determination of the largest lattice polytope diameter. Discrete Applied Mathematics. 281:106-110. 2020
- The diameter of lattice zonotopes. Proceedings of the American Mathematical Society. 148:3507-3516. 2020
- Correction to: Distance between vertices of lattice polytopes. Optimization Letters. 14:327-328. 2020
- Distance between vertices of lattice polytopes. Optimization Letters. 14:309-326. 2020
- Preface: Workshop on Advances in Optimization. Discrete Applied Mathematics. 275:1-2. 2020
- Diameter, Decomposability, and Minkowski Sums of Polytopes. Canadian Mathematical Bulletin. 62:741-755. 2019
- HYPERGRAPHIC DEGREE SEQUENCES ARE HARD. Bulletin of the European Association for Theoretical Computer Science. 63-64. 2019
- Hypergraphic Degree Sequences are Hard. Bulletin of the European Association for Theoretical Computer Science, 127:63-64, 2019. 2019
- Primitive Zonotopes. Discrete and Computational Geometry. 60:27-39. 2018
- On component commonality for periodic review assemble-to-order systems. Annals of Operations Research. 265:29-46. 2018
- Paths, pivots, and practice: the power of optimization. Annals of Operations Research. 265:1-4. 2018
- Preface: Linear optimization. Discrete Applied Mathematics. 240:1-2. 2018
- Improved bounds on the diameter of lattice polytopes. Acta Mathematica Hungarica. 154:457-469. 2018
- Managing losses in exotic horse race wagering. Journal of the Operational Research Society. 69:319-325. 2018
- AN ENHANCED PRIMAL-SIMPLEX BASED TARDOS' ALGORITHM FOR LINEAR OPTIMIZATION. Journal of the Operations Research Society of Japan. 61:186-196. 2018
- Optimization over Degree Sequences. SIAM Journal on Discrete Mathematics. 32:2067-2079. 2018
- Computational determination of the largest lattice polytope diameter. Electronic Notes in Discrete Mathematics. 62:105-110. 2017
- Bannai et al. method proves the d-step conjecture for strings. Discrete Applied Mathematics. 217:488-494. 2017
- SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS. Journal of the Operations Research Society of Japan. 60:419-428. 2017
- A computational substantiation of the d-step approach to the number of distinct squares problem. Discrete Applied Mathematics. 212:81-87. 2016
- Corrigendum to “On a lemma of Crochemore and Rytter” [Journal of Discrete Algorithms 34 (2015) 18–22]. Journal of Discrete Algorithms (Amsterdam). 38-41:50-51. 2016
- Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22].. Journal of Discrete Algorithms (Amsterdam). 38-41:50-51. 2016
- A primal-simplex based Tardos’ algorithm. Operations Research Letters. 43:625-628. 2015
- Imperfect demand estimation for new product production planning 2015
- On a lemma of Crochemore and Rytter. Journal of Discrete Algorithms (Amsterdam). 34:18-22. 2015
- Chance constrained optimization for targeted Internet advertising. Omega. The International Journal of Management Science. 53:90-96. 2015
- 1-H-1 主単体法を用いたTardosの解法(学生セッション:連続最適化(1)). プラズマ・核融合学会年会予稿集. 2015:164-165. 2015
- How many double squares can a string contain?. Discrete Applied Mathematics. 180:52-69. 2015
- A Combinatorial Approach to Colourful Simplicial Depth. SIAM Journal on Discrete Mathematics. 28:306-322. 2014
- A Combinatorial Approach to Colourful Simplicial Depth.. SIAM J. Discret. Math.. 28:306-322. 2014
- Ad-step approach to the maximum number of distinct squares and runs in strings. Discrete Applied Mathematics. 163:268-274. 2014
- Editorial. Computational Geometry: Theory and Applications. 46:493-493. 2013
- More bounds on the diameters of convex polytopes. Optimization Methods and Software. 28:442-450. 2013
- A computational framework for determining run-maximal strings. Journal of Discrete Algorithms (Amsterdam). 20:43-50. 2013
- A Note on Lower Bounds for Colourful Simplicial Depth. Symmetry. 5:47-53. 2013
- A Further Generalization of the Colourful Carathéodory Theorem. Fields Institute Communications. abs/1107.3380:179-190. 2013
- On a conjecture of Erdős for multiplicities of cliques. Journal of Discrete Algorithms (Amsterdam). 17:9-14. 2012
- Computational Lower Bounds for Colourful Simplicial Depth. CoRR. abs/1210.7621. 2012
- Global routing in vlsi design: Algorithms,theory,and computational practice. Journal of Combinatorial Mathematics and Combinatorial Computing. 80:71-93. 2012
- On the structure of run-maximal strings. Journal of Discrete Algorithms (Amsterdam). 10:10-14. 2012
- More Colourful Simplices. Discrete and Computational Geometry. 45:272-278. 2011
- Solutions to the Oberwolfach problem for orders 18 to 40. Journal of Combinatorial Mathematics and Combinatorial Computing. 74:95-102. 2010
- On the generalized Berge sorting conjecture. Journal of Discrete Algorithms (Amsterdam). 8:1-7. 2010
- A Continuous d-Step Conjecture for Polytopes. Discrete and Computational Geometry. 41:318-327. 2009
- Hyperplane Arrangements with Large Average Diameter. POLYHEDRAL COMPUTATION. 48:103-114. 2009
- Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. Journal of Combinatorial Optimization. 16:323-323. 2008
- Diameter and Curvature: Intriguing Analogies. Electronic Notes in Discrete Mathematics. 31:221-225. 2008
- The colourful feasibility problem. Discrete Applied Mathematics. 156:2166-2177. 2008
- How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds. Mathematical programming. 113:1-14. 2008
- Polytopes and arrangements: Diameter and curvature. Operations Research Letters. 36:215-222. 2008
- On the Generalized Berge Sorting Conjecture (Numerical Optimization methods, theory and applications). プラズマ・核融合学会年会予稿集. 1584:132-141. 2008
- The complexity of the envelope of line and plane arrangements 2007
- A counterexample to the dominating set conjecture. Optimization Letters. 1:163-169. 2007
- The central path visits all the vertices of the Klee–Minty cube. Optimization Methods and Software. 21:851-865. 2006
- Un des “problèmes plaisans et délectables” de Claude Berge. Discrete Mathematics. 306:2299-2302. 2006
- Colourful Simplicial Depth. Discrete and Computational Geometry. 35:597-615. 2006
- The isometries of the cut, metric and hypermetric cones. Journal of Algebraic Combinatorics. 23:197-203. 2006
- Berge Sorting 2005
- A counterexample to a conjecture of Laurent and Poljak 2005
- Solitaire Lattices. Graphs and Combinatorics. 18:227-243. 2002
- On the solitaire cone and its relationship to multi-commodity flows. Mathematical programming. 90:27-57. 2001
- A Combinatorial Approach to the Solitaire Game. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 83:656-661. 2000
- A combinatorial approach to the solitaire game. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E83A:656-661. 2000
- A combinatorial approach to the solitaire game. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E83-A:656-661. 2000
- Odd Central Square Solitaire (Continuous and Discrete Mathematics for Optimization). プラズマ・核融合学会年会予稿集. 1114:96-105. 1999
- Fullerenes and coordination polyhedra versus half-cube embeddings. Discrete Mathematics. 192:41-80. 1998
- Skeletons of some relatives of the $n$-cube(Optimization Theory and its Applications in Mathematical Systems). プラズマ・核融合学会年会予稿集. 899:114-120. 1995
- Skeletons of some relatives of the $n$-cube(Optimization Theory and its Applications in Mathematical Systems). プラズマ・核融合学会年会予稿集. 899:114-120. 1995
- Skeletons of some relatives of the $n$-cube(Optimization Theory and its Applications in Mathematical Systems). プラズマ・核融合学会年会予稿集. 114-120. 1995
- McMullen's conditions and some lower bounds for general convex polytopes. Geometriae Dedicata. 52:165-173. 1994
- Wagner's theorem and combinatorial enumeration of 3-polytopes(Computational Geometry and Discrete Geometry). プラズマ・核融合学会年会予稿集. 872:30-34. 1994
- On the skeleton of the dual cut polytope. Research reports on information sciences. Ser. B, Operations research. 275:1-10. 1993
- The ridge graph of the metric polytope and some relatives. Research reports on information sciences. Ser. B, Operations research. 272:1-12. 1993
- Wagner's theorem and combinatorial enumeration of 3-polytopes. Research reports on information sciences. Ser. B, Operations research. 271:1-5. 1993
- McMullen's conditions and some lower bounds for general convex polytopes. Research reports on information sciences. Ser. B, Operations research. 266:1-8. 1993
preprints