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

• Simple extensions of polytopes
  Volker Kaibel, Matthias Walter
  Lecture Notes in Computer Science 8494, 2014, pp. 309-320
• Lower bounds on the sizes of integer programs without additional variables
  Volker Kaibel, Stefan Weltge
  Lecture Notes in Computer Science 8494, 2014, pp. 321-332
• On the configuration LP for maximum budgeted allocation
  Christos Kalaitzis, Aleksander Ma̧dry, Alantha Newman, Lukás̑ Polác̑ek, Ola Svensson
  Lecture Notes in Computer Science 8494, 2014, pp. 333-344
• Two-term disjunctions on the second-order cone
  Fatma Kılınç-Karzan, Sercan Yıldız
  Lecture Notes in Computer Science 8494, 2014, pp. 345-356
• Coupled and k-sided placements: Generalizing generalized assignment
  Madhukar Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku
  Lecture Notes in Computer Science 8494, 2014, pp. 357-368
• A unified algorithm for degree bounded survivable network design
  Lap Chi Lau, Hong Zhou
  Lecture Notes in Computer Science 8494, 2014, pp. 369-380
• Scheduling and fixed-parameter tractability
  Matthias Mnich, Andreas Wiese
  Lecture Notes in Computer Science 8494, 2014, pp. 381-392
• Improved branch-cut-and-price for capacitated vehicle routing
  Diego Pecin, Artur Pessoa, Marcus Poggi, Eduardo Uchoa
  Lecture Notes in Computer Science 8494, 2014, pp. 393-403
• Claw-free t-perfect graphs can be recognised in polynomial time
  Henning Bruhn, Oliver Schaudt
  Lecture Notes in Computer Science 8494, 2014, pp. 404-415