May 2016

**David Avis**and Conor Meagher

Journal of Combinatorial Optimization, 31(4), 1685–1708, 2016
BibTeX reference

Group for Research in Decision Analysis

May 2016

Journal of Combinatorial Optimization, 31(4), 1685–1708, 2016
BibTeX reference

Oct 2015

Mathematical Programming, 153(1), 95–115, 2015
BibTeX reference

Jun 2015

Information Processing Letters, 115(6-8), 588–593, 2015
BibTeX reference

May 2014

Conor Meagher, Roussos Dimitrakopoulos, and
Journal of Mining Science, 50(3), 508–526, 2014
BibTeX reference

Mar 2014

Discrete Applied Mathematics, 166, 1–13, 2014
BibTeX reference

Feb 2014

Ground metric learning

Marco Cuturi and
Journal of Machine Learning Research, 15, 533–564, 2014
BibTeX reference

Apr 2013

Computational Geometry, 46(3), 382–393, 2013
BibTeX reference

Jan 2012

On the existence of hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes

Yoshikazu Aoshima,
Discrete Applied Mathematics, 160(15), 2104–2115, 2012
BibTeX reference

Jan 2010

Leggett-Garg inequalities and the geometry of the cut polytope

Physical Review A, 82, 2010
BibTeX reference

Jan 2009

Enumeration of optimal pin jointed bistable compliant mechanisms with non-crossing members

Makoto Ohsaki, Naoki Katoh, Takuya Kinoshita, Shin-ichi Tanigawa, and
Journal of Structural and Multidisciplinary Optimization, 37, 645–665, 2009
BibTeX reference

Jan 2009

From Bell inequalities to Tsirelson’s theorem

Proceedings IECIE, E92-A, 1254–1267, 2009
BibTeX reference

Jan 2008

Computing monotone disjoint paths on polytopes

Journal of Combinatorial Optimization, 16(4), 328–343, 2008
BibTeX reference

Jan 2008

Distributed compression and multiparty squashed entanglement

Journal of Physics, A41(11), 115301–115326, 2008
BibTeX reference

Jan 2008

Generating facets of the cut polytope by triangular elimination

Mathematical Programming, 112, 303–325, 2008
BibTeX reference

Jan 2007

A list heuristic for vertex cove

Operations Research Letters, 35(2), 201–204, 2007
BibTeX reference

Jan 2006

Bell inequalities stronger than the CHSH inequality for 3 by 3 isotropic states

Tsuyoshi Ito, Hiroshi Imai, and
Physical Review A, 73(4), 2006
BibTeX reference

Jan 2006

On the relationship between convex bodies related to correlation experiments with dichotomic observables

Physical Review A, 39(36), 11283–11299, 2006
BibTeX reference

Jan 2006

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

Discrete Mathematics, 306(19-20), 2299–2302, 2006
BibTeX reference

Jan 2005

On the fractional chromatic index of a graph and its complement

Operations Research Letters, 33, 385–388, 2005
BibTeX reference

Jan 2004

Solving inequalities and proving Farkas' lemma made easy

American Mathematical Monthly, 111, 152–157, 2004
BibTeX reference

Jan 2003

Stronger linear-programming relaxations of max-cut

Mathematical Programming, 97(3), 451–469, 2003
BibTeX reference

Jan 2005

Graph theory and combinatorial optimization

Springer, 264 pages, 2005
BibTeX reference

Jan 2009

On combinatorial properties of linear program digraphs

Polyhedral Computation, 49, 1–14, 2009
BibTeX reference

Jan 2003

On the Complexity of Testing Hypermetric, Negative Type, *k*-gonal and Gap Inequalities

Discrete and Computational Geometry, Lecture Notes in Computer Science, 2866, 51–59, 2003
BibTeX reference

Dec 2013

Combinatorial Optimization and Applications, Vol. 8287, Springer, 414–429, 2013
BibTeX reference

Jan 2011

Enumerating hamiltonian paths on acyclic USO cubes with history based pivot rules

Yoshikazu Aoshima,
AAAC 2011, 2011
BibTeX reference

Jan 2011

Verifying Nash equilibria in page rank games in undirected web graphs

ISAAC 2011, Tokyo, 415–424, 2011
BibTeX reference

Jan 2009

A family of polytopal digraphs that do not satisfy the shelling property

6-th Japanese-Hungarian Symposium, 2009
BibTeX reference

Jan 2009

The quantum locker puzzle

ICQNM2009, IEEE Digital Library, 2009
BibTeX reference

Jan 2007

Comparison of two bounds of the quantum correlation set

Proc. ICQNM07, Guadeloupe, 2007
BibTeX reference

Jan 2006

Enumerating non-crossing minimally rigid frameworks

Computing and Combinatorics, Proceedings Lecture Notes in Computer Science, 4112, 205–215, 2006
BibTeX reference

Jan 2006

Enumeration of optimal pin-jointed bistable mechanisms

Naoki Katoh, Makoto Ohsaki, Takuya Kinoshita, Shin-ichi Tanigawa,
4th China-Japan-Korea Symposium of Structural and Mechanical Systems, Beijing, Chine, 2006
BibTeX reference

Jan 2006

Polyhedral and semidefinite approaches to classical and quantum bell inequalities

AQIS 2006, Beijing, Chine, 2006
BibTeX reference

fr |
en

GERAD is a multi university research center founded in 1979, financed by FRQNT. It involves some seventy experts from a mix of disciplines: quantitative methods for management, operations researchers, computer scientists, mathematicians and mathematical engineers, from HEC Montréal, Polytechnique Montréal, McGill University and Université du Québec à Montréal.

GERAD – HEC Montreal

3000, Côte-Sainte-Catherine Rd

Montreal (Quebec) H3T 2A7

Canada