Antoine Deza

Sebastian Pokutta

Lionel Pournin

Oper. Res. Lett., 2024

2022

Preface: Optimization and Discrete Geometry.

[BibT_eX]

[DOI]

Tal Raviv

Discret. Optim., 2022

Charging station optimization for balanced electric car sharing.

[BibT_eX]

[DOI]

Kai Huang

Michael R. Metel

Discret. Appl. Math., 2022

A linear optimization oracle for zonotope computation.

[BibT_eX]

[DOI]

Lionel Pournin

Comput. Geom., 2022

Multiperiod refinery optimization for mitigating the impact of process unit shutdowns.

[BibT_eX]

[DOI]

Ariel Boucheikhchoukh

Valentin Berger

Christopher L. E. Swartz

Alexander Nguyen

Shaffiq Jaffer

Comput. Chem. Eng., 2022

2021

Polytopal balls arising in optimization.

[BibT_eX]

[DOI]

Jean-Baptiste Hiriart-Urruty

Lionel Pournin

Contributions Discret. Math., 2021

2020

Correction to: Distance between vertices of lattice polytopes.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Distance between vertices of lattice polytopes.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Preface: Workshop on Advances in Optimization.

[BibT_eX]

[DOI]

Tomonari Kitahara

Noriyoshi Sukegawa

Discret. Appl. Math., 2020

On inventory allocation for periodic review assemble-to-order systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Hypergraphic Degree Sequences are Hard.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

2018

Optimization over Degree Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Managing losses in exotic horse race wagering.

[BibT_eX]

[DOI]

Kai Huang

Michael R. Metel

J. Oper. Res. Soc., 2018

Primitive Zonotopes.

[BibT_eX]

[DOI]

George Manoussakis

Shmuel Onn

Discret. Comput. Geom., 2018

Preface: Linear optimization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On component commonality for periodic review assemble-to-order systems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Paths, pivots, and practice: the power of optimization.

[BibT_eX]

[DOI]

Miguel F. Anjos

Ann. Oper. Res., 2018

2017

Computational determination of the largest lattice polytope diameter.

[BibT_eX]

[DOI]

Nathan Chadder

Electron. Notes Discret. Math., 2017

Bannai et al. method proves the d-step conjecture for strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22].

[BibT_eX]

[DOI]

Haoyue Bai

J. Discrete Algorithms, 2016

A computational substantiation of the d-step approach to the number of distinct squares problem.

[BibT_eX]

[DOI]

Mei Jiang

Discret. Appl. Math., 2016

2015

A primal-simplex based Tardos' algorithm.

[BibT_eX]

[DOI]

Shinji Mizuno

Noriyoshi Sukegawa

Oper. Res. Lett., 2015

On a lemma of Crochemore and Rytter.

[BibT_eX]

[DOI]

Haoyue Bai

J. Discrete Algorithms, 2015

How many double squares can a string contain?

[BibT_eX]

[DOI]

Adrien Thierry

Discret. Appl. Math., 2015

2014

A Combinatorial Approach to Colourful Simplicial Depth.

[BibT_eX]

[DOI]

Pauline Sarrabezolles

SIAM J. Discret. Math., 2014

A d-step approach to the maximum number of distinct squares and runs in strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Chance Constrained Optimization for Targeted Internet Advertising.

[BibT_eX]

[DOI]

Kai Huang

Michael R. Metel

CoRR, 2014

2013

A Note on Lower Bounds for Colourful Simplicial Depth.

[BibT_eX]

[DOI]

Tamon Stephen

Symmetry, 2013

More bounds on the diameters of convex polytopes.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2013

A computational framework for determining run-maximal strings.

[BibT_eX]

[DOI]

Andrew Baker

J. Discrete Algorithms, 2013

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2012

On a conjecture of Erdős for multiplicities of cliques.

[BibT_eX]

[DOI]

Min Jing Liu

J. Discrete Algorithms, 2012

On the structure of run-maximal strings.

[BibT_eX]

[DOI]

Andrew Baker

J. Discrete Algorithms, 2012

Computational Lower Bounds for Colourful Simplicial Depth

[BibT_eX]

[DOI]

Tamon Stephen

CoRR, 2012

A Computational Framework for Determining Square-maximal Strings.

[BibT_eX]

[DOI]

Mei Jiang

Proceedings of the Prague Stringology Conference 2012, 2012

2011

More Colourful Simplices.

[BibT_eX]

[DOI]

Tamon Stephen

Discret. Comput. Geom., 2011

A further generalization of the colourful Carathéodory theorem

[BibT_eX]

[DOI]

CoRR, 2011

A Parameterized Formulation for the Maximum Number of Runs Problem.

[BibT_eX]

[DOI]

Andrew Baker

Proceedings of the Prague Stringology Conference 2011, 2011

A <i>d</i>-Step Approach for Distinct Squares in Strings.

[BibT_eX]

[DOI]

Mei Jiang

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Small Octahedral Systems.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Pushing the boundaries of polytopal realizability.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

On the generalized Berge sorting conjecture.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

2009

A Continuous <i>d</i> -Step Conjecture for Polytopes.

[BibT_eX]

[DOI]

Tamás Terlaky

Yuriy Zinchenko

Discret. Comput. Geom., 2009

2008

Polytopes and arrangements: Diameter and curvature.

[BibT_eX]

[DOI]

Tamás Terlaky

Yuriy Zinchenko

Oper. Res. Lett., 2008

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.

[BibT_eX]

[DOI]

Eissa Nematollahi

Tamás Terlaky

Math. Program., 2008

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.

[BibT_eX]

[DOI]

David Bremner

Michael Soltys

J. Comb. Optim., 2008

Diameter and Curvature: Intriguing Analogies.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

The colourful feasibility problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

A counterexample to the dominating set conjecture.

[BibT_eX]

[DOI]

Gabriel Indik

Optim. Lett., 2007

2006

The central path visits all the vertices of the Klee-Minty cube.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2006

Un des "problèmes plaisans et délectables" de Claude Berge.

[BibT_eX]

[DOI]

David Avis

Discret. Math., 2006

Colourful Simplicial Depth.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

2002

Solitaire Lattices.

[BibT_eX]

[DOI]

Shmuel Onn

Graphs Comb., 2002

On the Face Lattice of the Metric Polytope.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001

On the solitaire cone and its relationship to multi-commodity flows.

[BibT_eX]

[DOI]

David Avis

Math. Program., 2001

On the binary solitaire cone.

[BibT_eX]

[DOI]

David Avis

Discret. Appl. Math., 2001

2000

On the Skeleton of the Metric Polytope.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998

Fullerenes and coordination polyhedra versus half-cube embeddings.

[BibT_eX]

[DOI]

Viatcheslav P. Grishukhin

Michel Deza

Discret. Math., 1998

1995

On Skeletons, Diameters and Volumes of Metric Polyhedra.

[BibT_eX]

[DOI]