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: Journal=Discrete Appl.~Math. AND Volume=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the dominant of the Steiner 2-edge connected subgraph polytope
Mourad Baïou
Discrete Applied Mathematics
112
(1-3), 2001, pp. 3-10
Discrete relaxations of combinatorial programs
Ralf Borndörfer
,
Robert Weismantel
Discrete Applied Mathematics
112
(1-3), 2001, pp. 11-26
Scheduling projects with labor constraints
C.C.B. Cavalcante
,
C. Carvalho de Souza
,
M.W.P. Savelsbergh
,
Y. Wang
,
L.A. Wolsey
Discrete Applied Mathematics
112
(1-3), 2001, pp. 27-52
An aproximation result for a periodic allocation problem
Giuseppe Confessore
,
Paolo Dell'Olmo
,
Stefano Giordani
Discrete Applied Mathematics
112
(1-3), 2001, pp. 53-72
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Teodor Gabriel Crainic
,
Antonio Frangioni
,
Bernard Gendron
Discrete Applied Mathematics
112
(1-3), 2001, pp. 73-99
Steiner trees and polyhedra
M. Didi Biha
,
H. Kerivin
,
A.R. Mahjoub
Discrete Applied Mathematics
112
(1-3), 2001, pp. 101-120
Determining the automorphism group of the linear ordering polytope
Samuel Fiorini
Discrete Applied Mathematics
112
(1-3), 2001, pp. 121-128
The asymmetric Travelling Salesman problem: On generalization of disaggregated Miller-Tucker-Zemlin constraints
Luis Gouveia
,
Jose Manuel Pires
Discrete Applied Mathematics
112
(1-3), 2001, pp. 129-145
Facets of the
p
-cycle polytope
Mark Hartmann
,
Özgür Özlük
Discrete Applied Mathematics
112
(1-3), 2001, pp. 147-178
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
Johann Hurink
,
Jens Keuchel
Discrete Applied Mathematics
112
(1-3), 2001, pp. 179-197
Makespan minimization for flow-shop problems with transportation times and a single robot
Johann Hurink
,
Sigrid Knust
Discrete Applied Mathematics
112
(1-3), 2001, pp. 199-216
Comparison of column generation models for channel assignment in cellular networks
Brigitte Jaumard
,
Odile Marcotte
,
Christophe Meyer
,
Tsevi Vovor
Discrete Applied Mathematics
112
(1-3), 2001, pp. 217-240
A comparison of Steiner tree relaxations
Tobias Polzin
,
Siavash Vahdati Daneshmand
Discrete Applied Mathematics
112
(1-3), 2001, pp. 241-261
Improved algorithms for the Steiner problem in networks
Tobias Polzin
,
Siavash Vahdati Daneshmand
Discrete Applied Mathematics
112
(1-3), 2001, pp. 263-300
A probabilistic analysis of the multi-period single-sourcing problem
H. Edwin Romeijn
,
Dolores Romero Morales
Discrete Applied Mathematics
112
(1-3), 2001, pp. 301-328