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="Bixby, Robert E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances
Karen Aardal
,
Robert E. Bixby
,
Cor A.J. Hurkens
,
Arjen K. Lenstra
,
Job W. Smeltink
Lecture Notes in Computer Science
1610
, 1999, pp. 1-16
Solving a linear diophantine equation with lower and upper bounds on the variables
Karen Aardal
,
Cor Hurkens
,
Arjen K. Lenstra
Lecture Notes in Computer Science
1412
, 1998, pp. 229-242
Polyhedral combinatorics of benzenoid problems
Hernán Abeledo
,
Gary Atkinson
Lecture Notes in Computer Science
1412
, 1998, pp. 202-212
The maximum traveling salesman problem under polyhedral norms
Alexander Barvinok
,
David S. Johnson
,
Gerhard J. Woeginger
,
Russell Woodroofe
Lecture Notes in Computer Science
1412
, 1998, pp. 195-201
Multicuts in unweighted graphs with bounded degree and bounded tree-width
Gruia Călinescu
,
Cristina G. Fernandes
,
Bruce Reed
Lecture Notes in Computer Science
1412
, 1998, pp. 137-152
A new bound for the 2-edge connected subgraph problem
Robert Carr
,
R. Ravi
Lecture Notes in Computer Science
1412
, 1998, pp. 112-125
Solving integer and disjunctive programs by lift and project
Sebastián Ceria
,
Gábor Pataki
Lecture Notes in Computer Science
1412
, 1998, pp. 271-283
An efficient approximation algorithm for minimizing makespan on uniformly related machines
Chandra Chekuri
,
Michael Bender
Lecture Notes in Computer Science
1412
, 1998, pp. 383-393
An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs
Joseph Cheriyan
,
András Sebŏ
,
Zoltán Szigeti
Lecture Notes in Computer Science
1412
, 1998, pp. 126-136
Consecutive ones and a betweenness problem in computational biology
Thomas Christof
,
Marcus Oswald
,
Gerhard Reinelt
Lecture Notes in Computer Science
1412
, 1998, pp. 213-228
Improved approximation algorithms for uncapacitated facility location
Fabián A. Chudak
Lecture Notes in Computer Science
1412
, 1998, pp. 180-194
A theorem of Truemper
Michele Conforti
,
Ajai Kapoor
Lecture Notes in Computer Science
1412
, 1998, pp. 53-68
A class of hard small 0-1 programs
Gérard Cornuéjols
,
Milind Dawande
Lecture Notes in Computer Science
1412
, 1998, pp. 284-293
The packing property
Gérard Cornuéjols
,
Bertrand Guenin
,
François Margot
Lecture Notes in Computer Science
1412
, 1998, pp. 1-8
New classes of lower bounds for bin packing problems
Sándor P. Fekete
,
Jörg Schepers
Lecture Notes in Computer Science
1412
, 1998, pp. 257-270
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
Lisa Fleischer
Lecture Notes in Computer Science
1412
, 1998, pp. 294-309
Bipartite designs
Grigor Gasparyan
Lecture Notes in Computer Science
1412
, 1998, pp. 23-36
An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
Andrew V. Goldberg
,
Jeffrey D. Oldham
,
Serge Plotkin
,
Cliff Stein
Lecture Notes in Computer Science
1412
, 1998, pp. 338-352
A characterization of weakly bipartite graphs
Bertrand Guenin
Lecture Notes in Computer Science
1412
, 1998, pp. 9-22
Incorporating inequality constraints in the spectral bundle method
Christoph Helmberg
,
Krzysztof C. Kiwiel
,
Franz Rendl
Lecture Notes in Computer Science
1412
, 1998, pp. 423-435
The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem
Dorit S. Hochbaum
Lecture Notes in Computer Science
1412
, 1998, pp. 325-337
Non-approximability results for scheduling problems with minsum criteria
Han Hoogeveen
,
Petra Schuurman
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
1412
, 1998, pp. 353-366
Polyhedral combinatorics of quadratic assignment problems with less objects than locations
Volker Kaibel
Lecture Notes in Computer Science
1412
, 1998, pp. 409-422
Approximating disjoint-path problems using greedy algorithms and packing integer programs
Stavros G. Kolliopoulos
,
Clifford Stein
Lecture Notes in Computer Science
1412
, 1998, pp. 153-168
The intersection of knapsack polyhedra and extensions
Alexander Martin
,
Robert Weismantel
Lecture Notes in Computer Science
1412
, 1998, pp. 243-256
Seiten 1
2
>