Thomas M. Liebling

Publication Activity (10 Years)

Years Active: 1975-2018
Publications (10 Years): 1

Top Topics

Optimization Procedure

Representational Power

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

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