Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Letchford, Adam N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized network design polyhedra
Corinne Feremans
,
Martine Labbé
,
Adam N. Letchford
,
Juan-José Salazar-González
Networks
58
(2), 2011, pp. 125-136
A new approach to the stable set problem based on ellipsoids
Monia Giandomenico
,
Adam N. Letchford
,
Fabrizio Rossi
,
Stefano Smriglio
Lecture Notes in Computer Science
6655
, 2011, pp. 223-234
Integer quadratic quasi-polyhedra
Adam N. Letchford
Lecture Notes in Computer Science
6080
, 2010, pp. 258-270
Odd minimum cut sets and
b
-matchings revisited
Adam N. Letchford
,
Gerhard Reinelt
,
Dirk Oliver Theis
SIAM Journal on Discrete Mathematics
22
(4), 2008, pp. 1480-1487
Binary positive semidefinite matrices and associated integer polytopes
Adam N. Letchford
,
Michael M. Srensen
Lecture Notes in Computer Science
5035
, 2008, pp. 125-139
A faster exact separation algorithm for blossom inequalities
Adam N. Letchford
,
Gerhard Reinelt
,
Dirk Oliver Theis
Lecture Notes in Computer Science
3064
, 2004, pp. 196-205
Polynomial-time separation of simple comb inequalities
Adam N. Letchford
,
Andrea Lodi
Lecture Notes in Computer Science
2337
, 2002, pp. 93-108
On the separation of maximally violated mod-
k
cuts
Alberto Caprara
,
Matteo Fischetti
,
Adam N. Letchford
Lecture Notes in Computer Science
1610
, 1999, pp. 87-98