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

• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
  Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato F. Werneck
  Lecture Notes in Computer Science 3064, 2004, pp. 1-15
• Metric inequalities and the network loading problem
  Pasquale Avella, Sara Mattia, Antonio Sassano
  Lecture Notes in Computer Science 3064, 2004, pp. 16-32
• Valid inequalities based on simple mixed-integer sets
  Sanjeeb Dash, Oktay Günlük
  Lecture Notes in Computer Science 3064, 2004, pp. 33-45
• The price of anarchy when costs are non-separable and asymmetric
  G. Perakis
  Lecture Notes in Computer Science 3064, 2004, pp. 46-58
• Computational complexity, fairness, and the price of anarchy of the maximum latency problem
  José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
  Lecture Notes in Computer Science 3064, 2004, pp. 59-73
• Polynomial time algorithm for determining optimal strategies in cyclic games
  Dmitrii Lozovanu
  Lecture Notes in Computer Science 3064, 2004, pp. 74-85
• A robust optimization approach to supply chain management
  Dimitris Bertsimas, Aurélie Thiele
  Lecture Notes in Computer Science 3064, 2004, pp. 86-100
• Hedging uncertainty: Approximation algorithms for stochastic optimization problems
  R. Ravi, Amitabh Sinha
  Lecture Notes in Computer Science 3064, 2004, pp. 101-115
• Scheduling an industrial production facility
  Eyjolfur Asgeirsson, Jonathan Berry, Cynthia A. Phillips, David J. Phillips, Cliff Stein, Joel Wein
  Lecture Notes in Computer Science 3064, 2004, pp. 116-131
• Three min-max theorems concerning cyclic orders of strong digraphs
  Stéphane Bessy, Stéphan Thomassé
  Lecture Notes in Computer Science 3064, 2004, pp. 132-138
• A TDI description of restricted 2-matching polytopes
  Gyula Pap
  Lecture Notes in Computer Science 3064, 2004, pp. 139-151
• Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems
  E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan
  Lecture Notes in Computer Science 3064, 2004, pp. 152-162
• Semi-continuous cuts for mixed-integer programming
  I.R., Jr. de Farias
  Lecture Notes in Computer Science 3064, 2004, pp. 163-177
• Combinatorial Benders' cuts
  Gianni Codato, Matteo Fischetti
  Lecture Notes in Computer Science 3064, 2004, pp. 178-195
• 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
• LP-based approximation algorithms for capacitated facility location
  Retsef Levi, David B. Shmoys, Chaitanya Swamy
  Lecture Notes in Computer Science 3064, 2004, pp. 206-218
• A multi-exchange local search algorithm for the capacitated facility location problem
  Jiawei Zhang, Bo Chen, Yinyu Ye
  Lecture Notes in Computer Science 3064, 2004, pp. 219-233
• Separable concave optimization approximately equals piecewise linear optimization
  Thomas L. Magnanti, Dan Stratila
  Lecture Notes in Computer Science 3064, 2004, pp. 234-243
• Three kinds of integer programming algorithms based on Barvinok's rational functions
  J.A. De Loera, D. Haws, R. Hemmecke, P. Huggins, R. Yoshida
  Lecture Notes in Computer Science 3064, 2004, pp. 244-255
• The path-packing structure of graphs
  András Sebŏ, László Szegŏ
  Lecture Notes in Computer Science 3064, 2004, pp. 256-270
• More on a binary-encoded coloring formulation
  Jon Lee, François Margot
  Lecture Notes in Computer Science 3064, 2004, pp. 271-282
• Single machine scheduling with precedence constraints
  José R. Correa, Andreas S. Schulz
  Lecture Notes in Computer Science 3064, 2004, pp. 283-297
• The constrained minimum weighted sum of job completion times problem
  Asaf Levin, Gerhard J. Woeginger
  Lecture Notes in Computer Science 3064, 2004, pp. 298-307
• Near-optimum global routing with coupling, delay bounds, and power consumption
  Jens Vygen
  Lecture Notes in Computer Science 3064, 2004, pp. 308-324
• A flow-based method for improving the expansion or conductance of graph cuts
  Kevin Lang, Satish Rao
  Lecture Notes in Computer Science 3064, 2004, pp. 325-337