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=65
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polynomial algorithm for the parity path problem on perfectly orientable graphs
Srinivasa R. Arikati
,
Uri N. Peled
Discrete Applied Mathematics
65
(1-3), 1996, pp. 5-20
Reverse search for enumeration
David Avis
,
Komei Fukuda
Discrete Applied Mathematics
65
(1-3), 1996, pp. 21-46
The simulated trading heuristic for solving vehicle routing problems
A. Bachem
,
W. Hochstättler
,
M. Malich
Discrete Applied Mathematics
65
(1-3), 1996, pp. 47-72
Some properties of non-bicolorable hypergraphs and the four-color problem
Claude Berge
Discrete Applied Mathematics
65
(1-3), 1996, pp. 73-79
Deadline scheduling of multiprocessor tasks
J. Bƚażewicz
,
M. Drozdowski
,
D. de Werra
,
J. Weglarz
Discrete Applied Mathematics
65
(1-3), 1996, pp. 81-95
Improving local search heuristics for some scheduling problems-I
Peter Brucker
,
Johann Hurink
,
Frank Werner
Discrete Applied Mathematics
65
(1-3), 1996, pp. 97-122
Three-dimensional axial assignment problems with decomposable cost coefficients
Rainer E. Burkard
,
Rüdiger Rudolf
,
Gerhard J. Woeginger
Discrete Applied Mathematics
65
(1-3), 1996, pp. 123-139
A decomposition algorithm for network reliability evaluation
Jacques Carlier
,
Corinne Lucet
Discrete Applied Mathematics
65
(1-3), 1996, pp. 141-156
On preemptive scheduling: A general setting for the two-phase method
M. Cochand
,
A. Gaillard
Discrete Applied Mathematics
65
(1-3), 1996, pp. 157-166
A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
Yang Dai
,
Hiroshi Imai
,
Kazuo Iwano
,
Naoki Katoh
,
Keiji Ohtsuka
,
Nobuhiko Yoshimura
Discrete Applied Mathematics
65
(1-3), 1996, pp. 167-190
On some multicriteria arborescence problems: Complexity and algorithms
Mauro Dell'Amico
,
Francesco Maffioli
Discrete Applied Mathematics
65
(1-3), 1996, pp. 191-206
Time-tables, polyhedra and the greedy algorithm
R. Euler
,
H. Le Verge
Discrete Applied Mathematics
65
(1-3), 1996, pp. 207-221
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Fred Glover
Discrete Applied Mathematics
65
(1-3), 1996, pp. 223-253
Laplacian spectra and spanning trees of threshold graphs
P.L. Hammer
,
A.K. Kelmans
Discrete Applied Mathematics
65
(1-3), 1996, pp. 255-273
Shortest shortest path trees of a network
Pierre Hansen
,
Maolin Zheng
Discrete Applied Mathematics
65
(1-3), 1996, pp. 275-284
On a scheduling problem in a robotized analytical system
Alain Hertz
,
Yves Mottet
,
Yves Rochat
Discrete Applied Mathematics
65
(1-3), 1996, pp. 285-318
An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
Alain Hertz
,
Marino Widmer
Discrete Applied Mathematics
65
(1-3), 1996, pp. 319-345
Graphs that admit 3-to-1 or 2-to-1 maps onto the circle
A.J.W. Hilton
,
J.P. Liu
,
C. Zhao
Discrete Applied Mathematics
65
(1-3), 1996, pp. 347-377
A note on perfectly orderable graphs
Chính T. Hoàng
Discrete Applied Mathematics
65
(1-3), 1996, pp. 379-386
Graphs with largest number of minimum cuts
Jenö Lehel
,
Frédéric Maffray
,
Myriam Preissmann
Discrete Applied Mathematics
65
(1-3), 1996, pp. 387-407
Lot-size scheduling of two types of jobs on identical machines
Marcus Pattloch
,
Günter Schmidt
Discrete Applied Mathematics
65
(1-3), 1996, pp. 409-419
Cardinality-restricted chains and antichains in partially ordered sets
Henry Shum
,
L.E., Jr. Trotter
Discrete Applied Mathematics
65
(1-3), 1996, pp. 421-439