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: Series=LNCS AND Volume=5035

• 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
• Disjunctive cuts for non-convex mixed integer quadratically constrained programs
  Anureet Saxena, Pierre Bonami, Jon Lee
  Lecture Notes in Computer Science 5035, 2008, pp. 17-33
• 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
• The induced disjoint paths problem
  Ken-ichi Kawarabayashi, Yusuke Kobayashi
  Lecture Notes in Computer Science 5035, 2008, pp. 47-61
• A weighted K_{t,t}-free t-factor algorithm for bipartite graphs
  Kenjiro Takazawa
  Lecture Notes in Computer Science 5035, 2008, pp. 62-76
• 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
• A polynomial algorithm for weighted abstract flow
  Maren Martens, S. Thomas McCormick
  Lecture Notes in Computer Science 5035, 2008, pp. 97-111
• 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
• Binary positive semidefinite matrices and associated integer polytopes
  Adam N. Letchford, Michael M. Srensen
  Lecture Notes in Computer Science 5035, 2008, pp. 125-139
• 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
• Tight bounds for permutation flow shop scheduling
  Viswanath Nagarajan, Maxim Sviridenko
  Lecture Notes in Computer Science 5035, 2008, pp. 154-168
• The stochastic machine replenishment problem
  Kamesh Munagala, Peng Shi
  Lecture Notes in Computer Science 5035, 2008, pp. 169-183
• 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
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
  Juan Pablo Vielma, George L. Nemhauser
  Lecture Notes in Computer Science 5035, 2008, pp. 199-213
• Computing with multi-row Gomory cuts
  Daniel G. Espinoza
  Lecture Notes in Computer Science 5035, 2008, pp. 214-224
• Constraint orbital branching
  James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
  Lecture Notes in Computer Science 5035, 2008, pp. 225-239
• A fast, simpler algorithm for the matroid parity problem
  James B. Orlin
  Lecture Notes in Computer Science 5035, 2008, pp. 240-258
• 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
• 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
• Primal-dual schema for capacitated covering problems
  Tim Carnes, David Shmoys
  Lecture Notes in Computer Science 5035, 2008, pp. 288-302
• Offline and online facility leasing
  Chandrashekhar Nagarajan, David P. Williamson
  Lecture Notes in Computer Science 5035, 2008, pp. 303-315
• Importance sampling via load-balanced facility location
  Aaron Archer, Shankar Krishnan
  Lecture Notes in Computer Science 5035, 2008, pp. 316-330
• A constant approximation algorithm for the a priori Traveling Salesman Problem
  David Shmoys, Kunal Talwar
  Lecture Notes in Computer Science 5035, 2008, pp. 331-343
• 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
• 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