The complexity of geometric scaling.

Antoine Deza

Antoine Deza Sebastian Pokutta Lionel Pournin The complexity of geometric scaling. 107057 2024 52 Oper. Res. Lett. https://doi.org/10.1016/j.orl.2023.11.010 db/journals/orl/orl52.html#DezaPP24

Antoine Deza Shmuel Onn Sebastian Pokutta Lionel Pournin Kissing Polytopes. 2643-2664 2024 38 SIAM J. Discret. Math. 4 https://doi.org/10.1137/24m1640859 db/journals/siamdm/siamdm38.html#DezaOPP24 streams/journals/siamdm

Ariel Boucheikhchoukh Valentin Berger Christopher L. E. Swartz Antoine Deza Alexander Nguyen Shaffiq Jaffer Multiperiod refinery optimization for mitigating the impact of process unit shutdowns. 107873 2022 164 Comput. Chem. Eng. https://doi.org/10.1016/j.compchemeng.2022.107873 db/journals/cce/cce164.html#Boucheikhchoukh22

Antoine Deza Lionel Pournin A linear optimization oracle for zonotope computation. 101809 2022 100 Comput. Geom. https://doi.org/10.1016/j.comgeo.2021.101809 db/journals/comgeo/comgeo100.html#DezaP22

Antoine Deza Kai Huang 0003 Michael R. Metel Charging station optimization for balanced electric car sharing. 187-197 2022 308 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.01.042 db/journals/dam/dam308.html#DezaHM22

Antoine Deza Frédéric Meunier Tal Raviv Preface: Optimization and Discrete Geometry. 100658 2022 44 Discret. Optim. Part https://doi.org/10.1016/j.disopt.2021.100658 db/journals/disopt/disopt44.html#DezaMR22

Antoine Deza Jean-Baptiste Hiriart-Urruty Lionel Pournin Polytopal balls arising in optimization. 125-138 2021 16 Contributions Discret. Math. 3 https://doi.org/10.11575/cdm.v16i3.71526 https://doi.org/10.55016/ojs/cdm.v16i3.71526 db/journals/cdm/cdm16.html#DezaHP21

Antoine Deza Tomonari Kitahara Noriyoshi Sukegawa Preface: Workshop on Advances in Optimization. 1-2 2020 275 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.12.013 https://www.wikidata.org/entity/Q126403641 db/journals/dam/dam275.html#DezaKS20

Antoine Deza Kai Huang 0003 Hongfeng Liang Xiao Jiao Wang On inventory allocation for periodic review assemble-to-order systems. 29-41 2020 275 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.04.004 db/journals/dam/dam275.html#DezaHLW20

Nathan Chadder Antoine Deza Computational determination of the largest lattice polytope diameter. 106-110 2020 281 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.10.026 https://www.wikidata.org/entity/Q126865503 db/journals/dam/dam281.html#ChadderD20

Anna Deza Antoine Deza Zhongyan Guan Lionel Pournin Distance between vertices of lattice polytopes. 309-326 2020 14 Optim. Lett. 2 https://doi.org/10.1007/s11590-018-1338-7 db/journals/ol/ol14.html#DezaDGP20

Anna Deza Antoine Deza Zhongyan Guan Lionel Pournin Carlos Aníbal Suárez Correction to: Distance between vertices of lattice polytopes. 327-328 2020 14 Optim. Lett. 2 https://doi.org/10.1007/s11590-020-01534-x db/journals/ol/ol14.html#DezaDGPS20

Antoine Deza Asaf Levin Syed Mohammad Meesum Shmuel Onn Hypergraphic Degree Sequences are Hard. 2019 127 Bull. EATCS http://bulletin.eatcs.org/index.php/beatcs/article/view/573/572 db/journals/eatcs/eatcs127.html#DezaLMO19

Antoine Deza Asaf Levin Syed Mohammad Meesum Shmuel Onn Hypergraphic Degree Sequences are Hard. 2019 abs/1901.02272 CoRR https://arxiv.org/abs/1901.02272 db/journals/corr/corr1901.html#abs-1901-02272

Miguel F. Anjos Antoine Deza Paths, pivots, and practice: the power of optimization. 1-4 2018 265 Ann. Oper. Res. 1 https://doi.org/10.1007/s10479-018-2853-8 https://www.wikidata.org/entity/Q130005741 db/journals/anor/anor265.html#AnjosD18

Antoine Deza Kai Huang 0003 Hongfeng Liang Xiao Jiao Wang On component commonality for periodic review assemble-to-order systems. 29-46 2018 265 Ann. Oper. Res. 1 https://doi.org/10.1007/s10479-017-2507-2 db/journals/anor/anor265.html#DezaHLW18

Antoine Deza Frédéric Meunier Preface: Linear optimization. 1-2 2018 240 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.02.001 db/journals/dam/dam240.html#DezaM18

Antoine Deza George Manoussakis Shmuel Onn Primitive Zonotopes. 27-39 2018 60 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-017-9873-z https://www.wikidata.org/entity/Q60691944 db/journals/dcg/dcg60.html#DezaMO18

Antoine Deza Kai Huang 0003 Michael R. Metel Managing losses in exotic horse race wagering. 319-325 2018 69 J. Oper. Res. Soc. 3 https://doi.org/10.1057/s41274-017-0213-8 db/journals/jors/jors69.html#Deza0M18

Antoine Deza Asaf Levin Syed Mohammad Meesum Shmuel Onn Optimization over Degree Sequences. 2067-2079 2018 32 SIAM J. Discret. Math. 3 https://doi.org/10.1137/17M1134482 db/journals/siamdm/siamdm32.html#DezaLMO18

Antoine Deza Frantisek Franek Bannai et al. method proves the d-step conjecture for strings. 488-494 2017 217 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2016.09.036 https://www.wikidata.org/entity/Q123201334 db/journals/dam/dam217.html#DezaF17

Nathan Chadder Antoine Deza Computational determination of the largest lattice polytope diameter. 105-110 2017 62 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2017.10.019 db/journals/endm/endm62.html#ChadderD17

Nathan Chadder Antoine Deza Computational determination of the largest lattice polytope diameter. 2017 abs/1704.01687 CoRR http://arxiv.org/abs/1704.01687 db/journals/corr/corr1704.html#ChadderD17

Antoine Deza Asaf Levin Syed Mohammad Meesum Shmuel Onn Optimization over Degree Sequences. 2017 abs/1706.03951 CoRR http://arxiv.org/abs/1706.03951 db/journals/corr/corr1706.html#abs-1706-03951

Antoine Deza Frantisek Franek Mei Jiang A computational substantiation of the d-step approach to the number of distinct squares problem. 81-87 2016 212 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2016.04.025 db/journals/dam/dam212.html#DezaFJ16

Haoyue Bai 0005 Antoine Deza Frantisek Franek Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22]. 50-51 2016 38-41 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2016.05.003 https://www.wikidata.org/entity/Q125050779 db/journals/jda/jda38.html#BaiDF16

Antoine Deza Frantisek Franek Adrien Thierry How many double squares can a string contain? 52-69 2015 180 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2014.08.016 db/journals/dam/dam180.html#DezaFT15

Haoyue Bai 0005 Antoine Deza Frantisek Franek On a lemma of Crochemore and Rytter. 18-22 2015 34 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2015.05.006 https://www.wikidata.org/entity/Q124828546 db/journals/jda/jda34.html#BaiDF15

Shinji Mizuno Noriyoshi Sukegawa Antoine Deza A primal-simplex based Tardos' algorithm. 625-628 2015 43 Oper. Res. Lett. 6 https://doi.org/10.1016/j.orl.2015.10.002 db/journals/orl/orl43.html#MizunoSD15

Antoine Deza Frantisek Franek A d-step approach to the maximum number of distinct squares and runs in strings. 268-274 2014 163 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2013.10.021 db/journals/dam/dam163.html#DezaF14

Antoine Deza Frédéric Meunier Pauline Sarrabezolles A Combinatorial Approach to Colourful Simplicial Depth. 306-322 2014 28 SIAM J. Discret. Math. 1 https://doi.org/10.1137/130913031 db/journals/siamdm/siamdm28.html#DezaMS14

Antoine Deza Kai Huang 0003 Michael R. Metel Chance Constrained Optimization for Targeted Internet Advertising. 2014 abs/1407.7924 CoRR http://arxiv.org/abs/1407.7924 db/journals/corr/corr1407.html#DezaHM14

David Bremner Antoine Deza Hiroshi Imai Sonoko Moriyama Editorial. 493 2013 46 Comput. Geom. 5 https://doi.org/10.1016/j.comgeo.2012.01.009 db/journals/comgeo/comgeo46.html#BremnerDIM13

Andrew Baker Antoine Deza Frantisek Franek A computational framework for determining run-maximal strings. 43-50 2013 20 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2012.12.004 db/journals/jda/jda20.html#BakerDF13

David Bremner Antoine Deza William Hua Lars Schewe More bounds on the diameters of convex polytopes. 442-450 2013 28 Optim. Methods Softw. 3 https://doi.org/10.1080/10556788.2012.668906 db/journals/oms/oms28.html#BremnerDHS13

Antoine Deza Tamon Stephen Feng Xie 0007 A Note on Lower Bounds for Colourful Simplicial Depth. 47-53 2013 5 Symmetry 1 https://doi.org/10.3390/sym5010047 db/journals/symmetry/symmetry5.html#DezaSX13

Andrew Baker Antoine Deza Frantisek Franek On the structure of run-maximal strings. 10-14 2012 10 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2011.08.005 db/journals/jda/jda10.html#BakerDF12

Antoine Deza Frantisek Franek Min Jing Liu On a conjecture of Erdős for multiplicities of cliques. 9-14 2012 17 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2012.10.005 https://www.wikidata.org/entity/Q123251275 db/journals/jda/jda17.html#DezaFL12

Antoine Deza Frantisek Franek Mei Jiang A Computational Framework for Determining Square-maximal Strings. 111-119 2012 PSC http://www.stringology.org/event/2012/p11.html conf/stringology/2012 db/conf/stringology/stringology2012.html#DezaFJ12

Antoine Deza Tamon Stephen Feng Xie 0007 Computational Lower Bounds for Colourful Simplicial Depth http://arxiv.org/abs/1210.7621 2012 CoRR abs/1210.7621 db/journals/corr/corr1210.html#abs-1210-7621

Antoine Deza Frédéric Meunier Pauline Sarrabezolles A combinatorial approach to colourful simplicial depth http://arxiv.org/abs/1212.4720 2012 CoRR abs/1212.4720 db/journals/corr/corr1212.html#abs-1212-4720

Antoine Deza Tamon Stephen Feng Xie 0007 More Colourful Simplices. 272-278 2011 45 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-010-9291-y db/journals/dcg/dcg45.html#DezaSX11

David Bremner Antoine Deza William Hua Lars Schewe Pushing the boundaries of polytopal realizability. 2011 CCCG http://www.cccg.ca/proceedings/2011/papers/paper44.pdf conf/cccg/2011 db/conf/cccg/cccg2011.html#BremnerDHS11 Grant Custard Antoine Deza Tamon Stephen Feng Xie 0007 Small Octahedral Systems. 2011 CCCG http://www.cccg.ca/proceedings/2011/papers/paper11.pdf conf/cccg/2011 db/conf/cccg/cccg2011.html#CustardDSX11 Antoine Deza Frantisek Franek Mei Jiang A <i>d</i>-Step Approach for Distinct Squares in Strings. 77-89 2011 CPM https://doi.org/10.1007/978-3-642-21458-5_9 conf/cpm/2011 db/conf/cpm/cpm2011.html#DezaFJ11 Andrew Baker Antoine Deza Frantisek Franek A Parameterized Formulation for the Maximum Number of Runs Problem. 74-82 2011 PSC http://www.stringology.org/event/2011/p07.html conf/stringology/2011 db/conf/stringology/stringology2011.html#BakerDF11

Frédéric Meunier Antoine Deza A further generalization of the colourful Carathéodory theorem http://arxiv.org/abs/1107.3380 2011 CoRR abs/1107.3380 db/journals/corr/corr1107.html#abs-1107-3380

Antoine Deza Feng Xie 0007 On the generalized Berge sorting conjecture. 1-7 2010 8 J. Discrete Algorithms 1 https://doi.org/10.1016/j.jda.2009.10.001 https://www.wikidata.org/entity/Q122906557 db/journals/jda/jda8.html#DezaX10

Antoine Deza Tamás Terlaky Yuriy Zinchenko A Continuous <i>d</i> -Step Conjecture for Polytopes. 318-327 2009 41 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-008-9096-4 https://www.wikidata.org/entity/Q122919700 db/journals/dcg/dcg41.html#DezaTZ09

Antoine Deza Sui Huang Tamon Stephen Tamás Terlaky The colourful feasibility problem. 2166-2177 2008 156 Discret. Appl. Math. 11 https://doi.org/10.1016/j.dam.2008.01.016 db/journals/dam/dam156.html#DezaHST08

Antoine Deza Tamás Terlaky Feng Xie 0007 Yuriy Zinchenko Diameter and Curvature: Intriguing Analogies. 221-225 2008 31 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2008.06.044 db/journals/endm/endm31.html#DezaTXZ08

David Bremner Antoine Deza Michael Soltys Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. 323 2008 16 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-008-9155-z db/journals/jco/jco16.html#BremnerDS08

Antoine Deza Eissa Nematollahi Tamás Terlaky How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. 1-14 2008 113 Math. Program. 1 https://doi.org/10.1007/s10107-006-0044-x db/journals/mp/mp113.html#DezaNT08

Antoine Deza Tamás Terlaky Yuriy Zinchenko Polytopes and arrangements: Diameter and curvature. 215-222 2008 36 Oper. Res. Lett. 2 https://doi.org/10.1016/j.orl.2007.06.007 db/journals/orl/orl36.html#DezaTZ08

Antoine Deza Gabriel Indik A counterexample to the dominating set conjecture. 163-169 2007 1 Optim. Lett. 2 https://doi.org/10.1007/s11590-006-0001-x https://www.wikidata.org/entity/Q123267727 db/journals/ol/ol1.html#DezaI07

Antoine Deza Sui Huang Tamon Stephen Tamás Terlaky Colourful Simplicial Depth. 597-615 2006 35 Discret. Comput. Geom. 4 https://doi.org/10.1007/s00454-006-1233-3 db/journals/dcg/dcg35.html#DezaHST06

David Avis Antoine Deza Un des "problèmes plaisans et délectables" de Claude Berge. 2299-2302 2006 306 Discret. Math. 19-20 https://doi.org/10.1016/j.disc.2005.12.027 db/journals/dm/dm306.html#AvisD06

Antoine Deza Eissa Nematollahi M. Reza Peyghami Tamás Terlaky The central path visits all the vertices of the Klee-Minty cube. 851-865 2006 21 Optim. Methods Softw. 5 https://doi.org/10.1080/10556780500407725 db/journals/oms/oms21.html#DezaNPT06

Antoine Deza Shmuel Onn Solitaire Lattices. 227-243 2002 18 Graphs Comb. 2 https://doi.org/10.1007/s003730200016 db/journals/gc/gc18.html#DezaO02

Antoine Deza Komei Fukuda Tomohiko Mizutani Cong Vo On the Face Lattice of the Metric Polytope. 118-128 https://doi.org/10.1007/978-3-540-44400-8_12 2002 conf/jcdcg/2002 JCDCG db/conf/jcdcg/jcdcg2002.html#DezaFMV02

David Avis Antoine Deza On the binary solitaire cone. 3-14 2001 115 Discret. Appl. Math. 1-3 db/journals/dam/dam115.html#AvisD01 https://doi.org/10.1016/S0166-218X(01)00211-6 https://www.wikidata.org/entity/Q126352981

David Avis Antoine Deza On the solitaire cone and its relationship to multi-commodity flows. 27-57 2001 90 Math. Program. 1 https://doi.org/10.1007/PL00011419 https://www.wikidata.org/entity/Q56069004 db/journals/mp/mp90.html#AvisD01

Antoine Deza Komei Fukuda Dmitrii V. Pasechnik Masanori Sato On the Skeleton of the Metric Polytope. 125-136 2000 conf/jcdcg/2000 JCDCG https://doi.org/10.1007/3-540-47738-1_10 https://www.wikidata.org/entity/Q56874391 db/conf/jcdcg/jcdcg2000.html#DezaFPS00

Antoine Deza Michel Deza Viatcheslav P. Grishukhin Fullerenes and coordination polyhedra versus half-cube embeddings. 41-80 1998 192 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(98)00065-X https://www.wikidata.org/entity/Q56566638 db/journals/dm/dm192.html#DezaDG98

Antoine Deza Michel Deza Komei Fukuda On Skeletons, Diameters and Volumes of Metric Polyhedra. 112-128 1995 conf/cococ/1995 Combinatorics and Computer Science db/conf/cococ/cococ1995.html#DezaDF95 https://doi.org/10.1007/3-540-61576-8_78 https://www.wikidata.org/entity/Q56553469 Miguel F. Anjos David Avis Haoyue Bai 0005 Andrew Baker Valentin Berger Ariel Boucheikhchoukh David Bremner Nathan Chadder Grant Custard Anna Deza Michel Deza Frantisek Franek Komei Fukuda Viatcheslav P. Grishukhin Zhongyan Guan Jean-Baptiste Hiriart-Urruty William Hua Kai Huang 0003 Sui Huang Hiroshi Imai Gabriel Indik Shaffiq Jaffer Mei Jiang Tomonari Kitahara Asaf Levin Hongfeng Liang Min Jing Liu George Manoussakis Syed Mohammad Meesum Michael R. Metel Frédéric Meunier Shinji Mizuno Tomohiko Mizutani Sonoko Moriyama Eissa Nematollahi Alexander Nguyen Shmuel Onn Dmitrii V. Pasechnik M. Reza Peyghami Sebastian Pokutta Lionel Pournin Tal Raviv Pauline Sarrabezolles Masanori Sato Lars Schewe Michael Soltys Tamon Stephen Carlos Aníbal Suárez Noriyoshi Sukegawa Christopher L. E. Swartz Tamás Terlaky Adrien Thierry Cong Vo Xiao Jiao Wang Feng Xie 0007 Yuriy Zinchenko