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: Author="Bienstock, Dan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Chance-constrained optimal power flow: Risk-aware network control under uncertainty
Daniel Bienstock
,
Michael Chertkov
,
Sean Harnett
SIAM Review
56
(3), 2014, pp. 461-495
Solving LP relaxations of large-scale precedence constrained problems
Daniel Bienstock
,
Mark Zuckerberg
Lecture Notes in Computer Science
6080
, 2010, pp. 1-14
Eigenvalue techniques for convex objective, nonconvex optimization problems
Daniel Bienstock
Lecture Notes in Computer Science
6080
, 2010, pp. 29-42
Minsquare factors and maxfix covers of graphs
Nicola Apollonio
,
András Sebŏ
Lecture Notes in Computer Science
3064
, 2004, pp. 388-400
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
Metric inequalities and the network loading problem
Pasquale Avella
,
Sara Mattia
,
Antonio Sassano
Lecture Notes in Computer Science
3064
, 2004, pp. 16-32
A robust optimization approach to supply chain management
Dimitris Bertsimas
,
Aurélie Thiele
Lecture Notes in Computer Science
3064
, 2004, pp. 86-100
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
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
Combinatorial Benders' cuts
Gianni Codato
,
Matteo Fischetti
Lecture Notes in Computer Science
3064
, 2004, pp. 178-195
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
Single machine scheduling with precedence constraints
José R. Correa
,
Andreas S. Schulz
Lecture Notes in Computer Science
3064
, 2004, pp. 283-297
Valid inequalities based on simple mixed-integer sets
Sanjeeb Dash
,
Oktay Günlük
Lecture Notes in Computer Science
3064
, 2004, pp. 33-45
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
All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables
Jesus De Loera
,
Shmuel Onn
Lecture Notes in Computer Science
3064
, 2004, pp. 338-351
Optimizing over semimetric polytopes
Antonio Frangioni
,
Andrea Lodi
,
Giovanni Rinaldi
Lecture Notes in Computer Science
3064
, 2004, pp. 431-443
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
A capacity scaling algorithm for
M
-convex submodular flow
Satoru Iwata
,
Satoko Moriguchi
,
Kazuo Murota
Lecture Notes in Computer Science
3064
, 2004, pp. 352-367
Low-dimensional faces of random 0/1-polytopes
Volker Kaibel
Lecture Notes in Computer Science
3064
, 2004, pp. 401-415
Integer concave cocirculations and honeycombs
Alexander V. Karzanov
Lecture Notes in Computer Science
3064
, 2004, pp. 368-387
On polyhedra related to even factors
Tamás Király
,
Márton Makai
Lecture Notes in Computer Science
3064
, 2004, pp. 416-430
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
More on a binary-encoded coloring formulation
Jon Lee
,
François Margot
Lecture Notes in Computer Science
3064
, 2004, pp. 271-282
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
Seiten 1
2
>