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
[1]
Hilfe
Suche: Author="Rinaldi, Giovanni"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Importance sampling via load-balanced facility location
Aaron Archer
,
Shankar Krishnan
Lecture Notes in Computer Science
5035
, 2008, pp. 316-330
A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem
Michael Armbruster
,
Marzena Fügenschuh
,
Christoph Helmberg
,
Alexander Martin
Lecture Notes in Computer Science
5035
, 2008, pp. 112-124
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
André Berger
,
Vincenzo Bonifaci
,
Fabrizio Grandoni
,
Guido Schäfer
Lecture Notes in Computer Science
5035
, 2008, pp. 273-287
A new approach to splitting-off
Attila Bernáth
,
Tamás Király
Lecture Notes in Computer Science
5035
, 2008, pp. 401-415
The air traffic flow management problem: An integer optimization approach
Dimitris Bertsimas
,
Guglielmo Lulli
,
Amedeo Odoni
Lecture Notes in Computer Science
5035
, 2008, pp. 34-46
Primal-dual schema for capacitated covering problems
Tim Carnes
,
David Shmoys
Lecture Notes in Computer Science
5035
, 2008, pp. 288-302
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
Deeparnab Chakrabarty
,
Nikhil R. Devanur
,
Vijay V. Vazirani
Lecture Notes in Computer Science
5035
, 2008, pp. 344-358
The mixing set with divisible capacities
Michele Conforti
,
Marco Di Summa
,
Laurence A. Wolsey
Lecture Notes in Computer Science
5035
, 2008, pp. 435-449
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles
Santanu S. Dey
,
Laurence A. Wolsey
Lecture Notes in Computer Science
5035
, 2008, pp. 463-475
Computing with multi-row Gomory cuts
Daniel G. Espinoza
Lecture Notes in Computer Science
5035
, 2008, pp. 214-224
The stable roommates problem with choice functions
Tamás Fleiner
Lecture Notes in Computer Science
5035
, 2008, pp. 385-400
Vertex cover resists SDPs tightened by local hypermetric inequalities
Konstantinos Georgiou
,
Avner Magen
,
Iannis Tourlakis
Lecture Notes in Computer Science
5035
, 2008, pp. 140-153
A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging
Yongpei Guan
,
Andrew Miller
Lecture Notes in Computer Science
5035
, 2008, pp. 450-462
Perspective relaxation of mixed integer nonlinear programs with indicator variables
Oktay Günlük
,
Jeff Linderoth
Lecture Notes in Computer Science
5035
, 2008, pp. 1-16
Min sum edge coloring in multigraphs via configuration LP
Magnús M. Halldórsson
,
Guy Kortsarz
,
Maxim Sviridenko
Lecture Notes in Computer Science
5035
, 2008, pp. 359-373
A polynomial time approximation scheme for the square packing problem
Klaus Jansen
,
Roberto Solis-Oba
Lecture Notes in Computer Science
5035
, 2008, pp. 184-198
The induced disjoint paths problem
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Lecture Notes in Computer Science
5035
, 2008, pp. 47-61
An improved algorithm for finding cycles through elements
Ken-ichi Kawarabayashi
Lecture Notes in Computer Science
5035
, 2008, pp. 374-384
Degree bounded matroids and submodular flows
Tamás Király
,
Lap Chi Lau
,
Mohit Singh
Lecture Notes in Computer Science
5035
, 2008, pp. 259-272
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 polynomial algorithm for weighted abstract flow
Maren Martens
,
S. Thomas McCormick
Lecture Notes in Computer Science
5035
, 2008, pp. 97-111
The stochastic machine replenishment problem
Kamesh Munagala
,
Peng Shi
Lecture Notes in Computer Science
5035
, 2008, pp. 169-183
Tight bounds for permutation flow shop scheduling
Viswanath Nagarajan
,
Maxim Sviridenko
Lecture Notes in Computer Science
5035
, 2008, pp. 154-168
Offline and online facility leasing
Chandrashekhar Nagarajan
,
David P. Williamson
Lecture Notes in Computer Science
5035
, 2008, pp. 303-315
A new algorithm for the maximum weighted stable set problem in claw-free graphs
Gianpaolo Oriolo
,
Ugo Pietropaoli
,
Gautier Stauffer
Lecture Notes in Computer Science
5035
, 2008, pp. 77-96
Seiten 1
2
3
>