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=6655

• An excluded minor characterization of Seymour graphs
  Alexander Ageev, Yohann Benchetrit, András Sebŏ, Zoltán Szigeti
  Lecture Notes in Computer Science 6655, 2011, pp. 1-13
• Complexity analyses of Bienstock-Zuckerberg and Lasserre relaxations on the matching and stable set polytopes
  Yu Hin Au, Levent Tunçel
  Lecture Notes in Computer Science 6655, 2011, pp. 14-26
• A probabilistic analysis of the strength of the split and triangle closures
  Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
  Lecture Notes in Computer Science 6655, 2011, pp. 27-38
• Partial convexification of general MIPs by Dantzig-Wolfe reformulation
  Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi
  Lecture Notes in Computer Science 6655, 2011, pp. 39-51
• Lift-and-project cuts for mixed integer convex programs
  Pierre Bonami
  Lecture Notes in Computer Science 6655, 2011, pp. 52-64
• TSP on cubic and subcubic graphs
  Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
  Lecture Notes in Computer Science 6655, 2011, pp. 65-77
• Approximability of capacitated network design
  Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
  Lecture Notes in Computer Science 6655, 2011, pp. 78-91
• Facility location with client latencies: Linear programming based techniques for minimum latency problems
  Deeparnab Chakrabarty, Chaitanya Swamy
  Lecture Notes in Computer Science 6655, 2011, pp. 92-103
• An exact rational mixed-integer programming solver
  William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
  Lecture Notes in Computer Science 6655, 2011, pp. 104-116
• Valid inequalities for the pooling problem with binary variables
  Claudia D'Ambrosio, Jeff Linderoth, James Luedtke
  Lecture Notes in Computer Science 6655, 2011, pp. 117-129
• On the Chvátal-Gomory closure of a compact convex set
  Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
  Lecture Notes in Computer Science 6655, 2011, pp. 130-142
• Design and verify: A new scheme for generating cutting-planes
  Santanu S. Dey, Sebastian Pokutta
  Lecture Notes in Computer Science 6655, 2011, pp. 143-155
• Contact center scheduling with strict resource requirements
  Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy
  Lecture Notes in Computer Science 6655, 2011, pp. 156-169
• Set covering with ordered replacement: Additive and multiplicative gaps
  Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
  Lecture Notes in Computer Science 6655, 2011, pp. 170-182
• Backdoor branching
  Matteo Fischetti, Michele Monaci
  Lecture Notes in Computer Science 6655, 2011, pp. 183-191
• A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
  Oliver Friedmann
  Lecture Notes in Computer Science 6655, 2011, pp. 192-206
• An iterative scheme for valid polynomial inequality generation in binary polynomial programming
  Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos
  Lecture Notes in Computer Science 6655, 2011, pp. 207-222
• 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
• Capacitated vehicle routing with non-uniform speeds
  Inge Li Grtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
  Lecture Notes in Computer Science 6655, 2011, pp. 235-247
• Approximation algorithms for single and multi-commodity connected facility location
  Fabrizio Grandoni, Thomas Rothvoß
  Lecture Notes in Computer Science 6655, 2011, pp. 248-260
• Safe lower bounds for graph coloring
  Stephan Held, William Cook, Edward C. Sewell
  Lecture Notes in Computer Science 6655, 2011, pp. 261-273
• Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
  Satoru Iwata, Mizuyo Takamatsu
  Lecture Notes in Computer Science 6655, 2011, pp. 274-286
• Constructing extended formulations from reflection relations
  Volker Kaibel, Kanstantsin Pashkovich
  Lecture Notes in Computer Science 6655, 2011, pp. 287-300
• Integrality gaps of linear and semi-definite programming relaxations for knapsack
  Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
  Lecture Notes in Computer Science 6655, 2011, pp. 301-314
• Degree bounded forest covering
  Tamás Király, Lap Chi Lau
  Lecture Notes in Computer Science 6655, 2011, pp. 315-323