default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas M. Liebling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j38]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: 1-3 (2018)- 2014
- [j37]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: 357-359 (2014) - 2013
- [j36]Jesús A. De Loera, Thomas M. Liebling, Miguel A. Pizaña, Gelasio Salazar:
Preface. Electron. Notes Discret. Math. 44: 1-2 (2013) - 2011
- [j35]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: 1-2 (2011) - 2010
- [j34]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): 1213-1215 (2010) - [j33]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): 1-6 (2010) - [j32]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): 119-141 (2010) - [e1]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2009
- [j31]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti:
Preface. Electron. Notes Discret. Math. 35: 1-2 (2009) - 2008
- [j30]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala:
Preface. Electron. Notes Discret. Math. 30: 1-2 (2008) - [c6]Lionel Pournin, Thomas M. Liebling:
From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis. Bonn Workshop of Combinatorial Optimization 2008: 347-363 - 2007
- [j29]Lionel Pournin, Thomas M. Liebling:
Constrained paths in the flip-graph of regular triangulations. Comput. Geom. 37(2): 134-140 (2007) - 2006
- [j28]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): 1771-1772 (2006) - [j27]Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105(2-3): 157-160 (2006) - 2005
- [j26]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): 35-50 (2005) - [j25]Michela Spada, Michel Bierlaire, Thomas M. Liebling:
Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem. Transp. Sci. 39(4): 477-490 (2005) - 2004
- [j24]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: 1-4 (2004) - [j23]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: 213-218 (2004) - [j22]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): 25-35 (2004) - 2003
- [j21]Laurent Balmelli, Thomas M. Liebling, Martin Vetterli:
Computational analysis of mesh simplification using global error. Comput. Geom. 25(3): 171-196 (2003) - [j20]Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. 94(2-3): 189-191 (2003) - 2002
- [j19]Laurent Balmelli, Martin Vetterli, Thomas M. Liebling:
Mesh Optimization Using Global Error with Application to Geometry Simplification. Graph. Model. 64(3-4): 230-257 (2002) - [c5]Michela Spada, Michel Bierlaire, Thomas M. Liebling:
School Bus Routing and Scheduling Problem. OR 2002: 180-186 - 2001
- [j18]Komei Fukuda, Thomas M. Liebling, Christine Lütolf:
Extended convex hull. Comput. Geom. 20(1-2): 13-23 (2001) - [j17]Kim Allemand, Komei Fukuda, Thomas M. Liebling, Erich Steiner:
A polynomial case of unconstrained zero-one quadratic optimization. Math. Program. 91(1): 49-52 (2001) - [j16]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): 263-274 (2001) - [c4]Laurent Balmelli, Thomas M. Liebling, Martin Vetterli:
Computational analysis of 4-8 meshes with application to surface simplification using global error. CCCG 2001: 33-36 - [c3]J.-A. Ferrez, Thomas M. Liebling:
Parallel DEM Simulations of Granular Materials. HPCN Europe 2001: 211-220 - 2000
- [c2]Komei Fukuda, Thomas M. Liebling, Christine Lütolf:
Extended Convex Hull. CCCG 2000
1990 – 1999
- 1999
- [j15]Andrea Lodi, Kim Allemand, Thomas M. Liebling:
An evolutionary heuristic for quadratic 0-1 programming. Eur. J. Oper. Res. 119(3): 662-670 (1999) - 1997
- [j14]Lynn Stauffer, Thomas M. Liebling:
Rolling horizon scheduling in a rolling-mill. Ann. Oper. Res. 69: 323-349 (1997) - [j13]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: 1-12 (1997) - [j12]Jean-François Hêche, Thomas M. Liebling:
Finding minimum area simple pentagons. Oper. Res. Lett. 21(5): 229-233 (1997) - 1996
- [j11]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): 41-64 (1996) - 1995
- [j10]Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer:
Disjoint Paths in the Plane. INFORMS J. Comput. 7(1): 84-88 (1995) - [j9]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): 325-346 (1995) - 1994
- [j8]François Margot, Alain Prodon, Thomas M. Liebling:
Tree polytope on 2-trees. Math. Program. 63: 183-191 (1994) - 1991
- [c1]C. Glardon, L. Kling, N. Kohler, Thomas M. Liebling:
Building Refurbishment as One-of-a-Kind Process. One-Of-A-Kind Production 1991: 341-352
1980 – 1989
- 1988
- [j7]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): 174-184 (1988) - 1987
- [j6]Hubert Telley, Thomas M. Liebling, Alain Mocellin:
Reconstruction of polycrystalline structures: a new application of combinatorial optimization. Computing 38(1): 1-11 (1987) - 1986
- [j5]Mats Weber, Thomas M. Liebling:
Euclidean matching problems and the metropolis algorithm. Z. Oper. Research 30(3) (1986) - [j4]Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs:
On the average length of lexicographic paths. Math. Program. 35(3): 362-364 (1986) - 1985
- [j3]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): 224-228 (1985) - 1981
- [j2]Heinz Gröflin, Thomas M. Liebling:
Connected and alternating vectors: Polyhedra and algorithms. Math. Program. 20(1): 233-244 (1981)
1970 – 1979
- 1975
- [j1]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): B141-B148 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
