Thomas M. Liebling

Rudini Menezes Sampaio

Discret. Appl. Math., 2018

2014

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.

[BibT_eX]

[DOI]

Flavia Bonomo

Javier Marenco

Mario Valencia-Pabon

Discret. Appl. Math., 2014

2013

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.

[BibT_eX]

[DOI]

Flavia Bonomo

Javier Marenco

Mario Valencia-Pabon

Electron. Notes Discret. Math., 2011

2010

Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems.

[BibT_eX]

[DOI]

Alain Prodon

Scott DeNegre

Math. Program., 2010

Traces of the XII Aussois Workshop on Combinatorial Optimization.

[BibT_eX]

[DOI]

Michael Jünger

Denis Naddef

William R. Pulleyblank

Gerhard Reinelt

Giovanni Rinaldi

Laurence A. Wolsey

Math. Program., 2010

Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

Preface.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Fábio Protti

Electron. Notes Discret. Math., 2009

2008

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis.

[BibT_eX]

[DOI]

Lionel Pournin

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Constrained paths in the flip-graph of regular triangulations.

[BibT_eX]

[DOI]

Lionel Pournin

Comput. Geom., 2007

2006

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.

[BibT_eX]

[DOI]

Denis Naddef

Laurence A. Wolsey

Math. Program., 2006

Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem.

[BibT_eX]

[DOI]

Michela Spada

Michel Bierlaire

Transp. Sci., 2005

Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm.

[BibT_eX]

[DOI]

J.-A. Ferrez

Komei Fukuda

Eur. J. Oper. Res., 2005

2004

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2004

The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs.

[BibT_eX]

[DOI]

Gautier Stauffer

Electron. Notes Discret. Math., 2004

Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

2003

The Aussois 2000 workshop in combinatorial optimization introduction.

[BibT_eX]

[DOI]

Denis Naddef

Laurence A. Wolsey

Math. Program., 2003

Computational analysis of mesh simplification using global error.

[BibT_eX]

[DOI]

Laurent Balmelli

Martin Vetterli

Comput. Geom., 2003

2002

Mesh Optimization Using Global Error with Application to Geometry Simplification.

[BibT_eX]

[DOI]

Laurent Balmelli

Martin Vetterli

Graph. Model., 2002

School Bus Routing and Scheduling Problem.

[BibT_eX]

[DOI]

Michela Spada

Michel Bierlaire

Proceedings of the Operations Research Proceedings 2002, 2002

2001

Voronoi diagrams on piecewise flat surfaces and an application to biological growth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

A polynomial case of unconstrained zero-one quadratic optimization.

[BibT_eX]

[DOI]

Math. Program., 2001

Extended convex hull.

[BibT_eX]

[DOI]

Komei Fukuda

Christine Lütolf

Comput. Geom., 2001

Parallel DEM Simulations of Granular Materials.

[BibT_eX]

[DOI]

J.-A. Ferrez

Proceedings of the High-Performance Computing and Networking, 9th International Conference, 2001

Computational analysis of 4-8 meshes with application to surface simplification using global error.

[BibT_eX]

[DOI]

Laurent Balmelli

Martin Vetterli

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999

An evolutionary heuristic for quadratic 0-1 programming.

[BibT_eX]

[DOI]

Andrea Lodi

Kim Allemand

Eur. J. Oper. Res., 1999

1997

Finding minimum area simple pentagons.

[BibT_eX]

[DOI]

Jean-François Hêche

Oper. Res. Lett., 1997

Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron.

[BibT_eX]

[DOI]

Komei Fukuda

François Margot

Comput. Geom., 1997

Rolling horizon scheduling in a rolling-mill.

[BibT_eX]

[DOI]

Lynn Stauffer

Jean-François Pusztaszeri

Ann. Oper. Res., 1997

1996

Tracking elementary particles near their primary vertex: A combinatorial approach.

[BibT_eX]

[DOI]

Paul E. Rensing

J. Glob. Optim., 1996

1995

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results.

[BibT_eX]

[DOI]

François Margot

Alain Prodon

Math. Methods Oper. Res., 1995

Disjoint Paths in the Plane.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1995

1994

Tree polytope on 2-trees.

[BibT_eX]

[DOI]

François Margot

Alain Prodon

Math. Program., 1994

1991

Building Refurbishment as One-of-a-Kind Process.

[BibT_eX]

Proceedings of the 'One-Of-A-Kind' Production: New Approaches, 1991

1988

From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

1987

Reconstruction of polycrystalline structures: a new application of combinatorial optimization.

[BibT_eX]

[DOI]

Hubert Telley

Alain Mocellin

Computing, 1987

1986

On the average length of lexicographic paths.

[BibT_eX]

[DOI]

Michel L. Balinski

A.-E. Nobs

Math. Program., 1986

Euclidean matching problems and the metropolis algorithm.

[BibT_eX]

[DOI]

Mats Weber

Raymond A. Cuninghame-Green

Z. Oper. Research, 1986

1985

Book reviews.

[BibT_eX]

[DOI]

Franz Josef Radermacher

Z. Oper. Research, 1985

1981

Connected and alternating vectors: Polyhedra and algorithms.

[BibT_eX]

[DOI]

Heinz Gröflin