Thomas M. Liebling

According to our database1, Thomas M. Liebling authored at least 43 papers between 1975 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015.
Discret. Appl. Math., 2018

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

2013
Preface.
Electron. Notes Discret. Math., 2013

2011
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2011

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

Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program., 2010

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

2009
Preface.
Electron. Notes Discret. Math., 2009

2008
Preface.
Electron. Notes Discret. Math., 2008

From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
Constrained paths in the flip-graph of regular triangulations.
Comput. Geom., 2007

2006
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.
Math. Program., 2006

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

2005
Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem.
Transp. Sci., 2005

Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm.
Eur. J. Oper. Res., 2005

2004
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.
Math. Methods Oper. Res., 2004

The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs.
Electron. Notes Discret. Math., 2004

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

2003
The Aussois 2000 workshop in combinatorial optimization introduction.
Math. Program., 2003

Computational analysis of mesh simplification using global error.
Comput. Geom., 2003

2002
Mesh Optimization Using Global Error with Application to Geometry Simplification.
Graph. Model., 2002

School Bus Routing and Scheduling Problem.
Proceedings of the Operations Research Proceedings 2002, 2002

2001
Voronoi diagrams on piecewise flat surfaces and an application to biological growth.
Theor. Comput. Sci., 2001

A polynomial case of unconstrained zero-one quadratic optimization.
Math. Program., 2001

Extended convex hull.
Comput. Geom., 2001

Parallel DEM Simulations of Granular Materials.
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.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999
An evolutionary heuristic for quadratic 0-1 programming.
Eur. J. Oper. Res., 1999

1997
Finding minimum area simple pentagons.
Oper. Res. Lett., 1997

Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron.
Comput. Geom., 1997

Rolling horizon scheduling in a rolling-mill.
Ann. Oper. Res., 1997

1996
Tracking elementary particles near their primary vertex: A combinatorial approach.
J. Glob. Optim., 1996

1995
Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results.
Math. Methods Oper. Res., 1995

Disjoint Paths in the Plane.
INFORMS J. Comput., 1995

1994
Tree polytope on 2-trees.
Math. Program., 1994

1991
Building Refurbishment as One-of-a-Kind Process.
Proceedings of the 'One-Of-A-Kind' Production: New Approaches, 1991

1988
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
SIAM J. Discret. Math., 1988

1987
Reconstruction of polycrystalline structures: a new application of combinatorial optimization.
Computing, 1987

1986
On the average length of lexicographic paths.
Math. Program., 1986

Euclidean matching problems and the metropolis algorithm.
Z. Oper. Research, 1986

1985
Book reviews.
Z. Oper. Research, 1985

1981
Connected and alternating vectors: Polyhedra and algorithms.
Math. Program., 1981

1975
Buchbesprechungen.
Z. Oper. Research, 1975


  Loading...