Thomas M. Liebling

45 papers Journal 38Unranked 6
YearRankTypeTitle / Venue / Authors
2018 J jnl
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015.
Discret. Appl. Math.
Manoel B. Campêlo, Thomas M. Liebling, Rudini Menezes Sampaio
2014 J jnl
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.
Discret. Appl. Math.
Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon
2013 J jnl
Preface.
Electron. Notes Discret. Math.
Jesús A. De Loera, Thomas M. Liebling, Miguel A. Pizaña, Gelasio Salazar
2011 J jnl
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math.
Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon
2010 — book
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art
Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010 J jnl
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems.
Math. Program.
Alain Prodon, Scott DeNegre, Thomas M. Liebling
2010 J jnl
Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.
Discret. Appl. Math.
Guillermo Durán, Thomas M. Liebling, Martín Matamala, Jayme Luiz Szwarcfiter
2010 J jnl
Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program.
Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2009 J jnl
Preface.
Electron. Notes Discret. Math.
Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti
2008 — conf
From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis.
Bonn Workshop of Combinatorial Optimization
Lionel Pournin, Thomas M. Liebling
2008 J jnl
Preface.
Electron. Notes Discret. Math.
Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala
2007 J jnl
Constrained paths in the flip-graph of regular triangulations.
Comput. Geom.
Lionel Pournin, Thomas M. Liebling
2006 J jnl
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.
Math. Program.
Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2006 J jnl
Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile.
Discret. Appl. Math.
Guillermo Durán, Thomas M. Liebling, Martín Matamala
2005 J jnl
Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem.
Transp. Sci.
Michela Spada, Michel Bierlaire, Thomas M. Liebling
2005 J jnl
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm.
Eur. J. Oper. Res.
J.-A. Ferrez, Komei Fukuda, Thomas M. Liebling
2004 J jnl
Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004.
Electron. Notes Discret. Math.
Thomas M. Liebling, Guillermo Durán, Martín Matamala
2004 J jnl
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.
Math. Methods Oper. Res.
Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer
2004 J jnl
The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs.
Electron. Notes Discret. Math.
Gautier Stauffer, Thomas M. Liebling
2003 J jnl
Computational analysis of mesh simplification using global error.
Comput. Geom.
Laurent Balmelli, Thomas M. Liebling, Martin Vetterli
2003 J jnl
The Aussois 2000 workshop in combinatorial optimization introduction.
Math. Program.
Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2002 J jnl
Mesh Optimization Using Global Error with Application to Geometry Simplification.
Graph. Model.
Laurent Balmelli, Martin Vetterli, Thomas M. Liebling
2002 — conf
School Bus Routing and Scheduling Problem.
OR
Michela Spada, Michel Bierlaire, Thomas M. Liebling
2001 J jnl
A polynomial case of unconstrained zero-one quadratic optimization.
Math. Program.
Kim Allemand, Komei Fukuda, Thomas M. Liebling, Erich Steiner
2001 — conf
Computational analysis of 4-8 meshes with application to surface simplification using global error.
CCCG
Laurent Balmelli, Thomas M. Liebling, Martin Vetterli
2001 J jnl
Extended convex hull.
Comput. Geom.
Komei Fukuda, Thomas M. Liebling, Christine Lütolf
2001 — conf
Parallel DEM Simulations of Granular Materials.
HPCN Europe
J.-A. Ferrez, Thomas M. Liebling
2001 J jnl
Voronoi diagrams on piecewise flat surfaces and an application to biological growth.
Theor. Comput. Sci.
Claude Indermitte, Thomas M. Liebling, Marc Troyanov, Heinz Clémençon
2000 — conf
Extended Convex Hull.
CCCG
Komei Fukuda, Thomas M. Liebling, Christine Lütolf
1999 J jnl
An evolutionary heuristic for quadratic 0-1 programming.
Eur. J. Oper. Res.
Andrea Lodi, Kim Allemand, Thomas M. Liebling
1997 J jnl
Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron.
Comput. Geom.
Komei Fukuda, Thomas M. Liebling, François Margot
1997 J jnl
Finding minimum area simple pentagons.
Oper. Res. Lett.
Jean-François Hêche, Thomas M. Liebling
1997 J jnl
Rolling horizon scheduling in a rolling-mill.
Ann. Oper. Res.
Lynn Stauffer, Thomas M. Liebling
1996 J jnl
Tracking elementary particles near their primary vertex: A combinatorial approach.
J. Glob. Optim.
Jean-François Pusztaszeri, Paul E. Rensing, Thomas M. Liebling
1995 J jnl
Disjoint Paths in the Plane.
INFORMS J. Comput.
Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer
1995 J jnl
Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results.
Math. Methods Oper. Res.
François Margot, Alain Prodon, Thomas M. Liebling
1994 J jnl
Tree polytope on 2-trees.
Math. Program.
François Margot, Alain Prodon, Thomas M. Liebling
1991 — conf
Building Refurbishment as One-of-a-Kind Process.
One-Of-A-Kind Production
C. Glardon, L. Kling, N. Kohler, Thomas M. Liebling
1988 J jnl
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
SIAM J. Discret. Math.
Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra
1987 J jnl
Reconstruction of polycrystalline structures: a new application of combinatorial optimization.
Computing
Hubert Telley, Thomas M. Liebling, Alain Mocellin
1986 J jnl
Euclidean matching problems and the metropolis algorithm.
Z. Oper. Research
Mats Weber, Thomas M. Liebling
1986 J jnl
On the average length of lexicographic paths.
Math. Program.
Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs
1985 J jnl
Book reviews.
Z. Oper. Research
Franz Josef Radermacher, Thomas M. Liebling, Hansjörg Wacker, Siegfried Schaible, Rainer E. Burkard, A. Aigner, Raymond A. Cuninghame-Green
1981 J jnl
Connected and alternating vectors: Polyhedra and algorithms.
Math. Program.
Heinz Gröflin, Thomas M. Liebling
1975 J jnl
Buchbesprechungen.
Z. Oper. Research
Helmuth Späth, Helmut Wegmann, K. Fallaschinski, F. Münnich, Rainer E. Burkard, Thomas M. Liebling, Wolfgang Bühler, Josef Heinhold, K. Eicher, H. Läpple