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 YEAR=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling jobs with fixed start and end times
Esther M. Arkin
,
Ellen B. Silverberg
Discrete Applied Mathematics
18
, 1987, pp. 1-8
Monotonically labelled Motzkin trees
Johann Blieberger
Discrete Applied Mathematics
18
, 1987, pp. 9-24
On the complexity of cutting-plane proofs
W. Cook
,
C.R. Coullard
,
Gy. Turán
Discrete Applied Mathematics
18
, 1987, pp. 25-38
Properties of positive functions and the dynamics of associated automata networks
Eric Goles-Chacc
,
Servet Martínez
Discrete Applied Mathematics
18
, 1987, pp. 39-46
Multiterminal duality and three-terminal series-parallelness
T.A. McKee
Discrete Applied Mathematics
18
, 1987, pp. 47-53
UET scheduling with unit interprocessor communication delays
V.J. Rayward-Smith
Discrete Applied Mathematics
18
, 1987, pp. 55-71
Divisor generating functions and insertion into a heap
Keisuke Uchimura
Discrete Applied Mathematics
18
, 1987, pp. 73-81
Réseaux et polynomes de dénombrement
Ph. Borie
Discrete Applied Mathematics
18
, 1987, pp. 83-86
On non-intersecting Eulerian circuits
Samuel W. Bent
,
Udi Manber
Discrete Applied Mathematics
18
, 1987, pp. 87-94
Some lower bound for constant weight codes
Iiro Honkala
,
Heikki Hämäläinen
,
Markku Kaikkonen
Discrete Applied Mathematics
18
, 1987, pp. 95-98
On Frieze's
\zeta(3)
limit for lengths of minimal spanning trees
J. Michael Steele
Discrete Applied Mathematics
18
, 1987, pp. 99-103
Constructive dual methods for discrete programming
Paolo Barcia
Discrete Applied Mathematics
18
, 1987, pp. 107-117
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
Ruy Eduardo Campello
,
Nelson F. Maculan
Discrete Applied Mathematics
18
, 1987, pp. 119-136
Primal-dual algorithms for the assignment problem
Giorgio Carpaneto
,
Paolo Toth
Discrete Applied Mathematics
18
, 1987, pp. 137-153
Algorithms for finding
K
-best perfect matchings
Chandra R. Chegireddy
,
Horst W. Hamacher
Discrete Applied Mathematics
18
, 1987, pp. 155-165
Adding activities to the dual instead of cuts to the primal problem
Sren Holm
Discrete Applied Mathematics
18
, 1987, pp. 167-174
Hierarchical approach to the process planning problem
Andrew Kusiak
,
Gerd Finke
Discrete Applied Mathematics
18
, 1987, pp. 175-184
Generalized travelling salesman problem through
n
sets of nodes: The asymmetrical case
Gilbert Laporte
,
Hélène Mercure
,
Yves Nobert
Discrete Applied Mathematics
18
, 1987, pp. 185-197
The telephonic switching centre network problem: Formalization and computational experience
Henrique Pacca L. Luna
,
Nivio Ziviani
,
Regina Helena B. Cabral
Discrete Applied Mathematics
18
, 1987, pp. 199-210
A parallel branch and bound algorithm for the quadratic assignment problem
Catherine Roucairol
Discrete Applied Mathematics
18
, 1987, pp. 211-225
Job shop scheduling with unit time operations under resource constraints and release dates
Jayme Luiz Szwarcfiter
Discrete Applied Mathematics
18
, 1987, pp. 227-233
A new enumeration scheme for the knapsack problem
Horacio Hideki Yanasse
,
Nei Yoshihiro Soma
Discrete Applied Mathematics
18
, 1987, pp. 235-245
Graphical partially ordered sets
L. Borzacchini
Discrete Applied Mathematics
18
, 1987, pp. 247-262
Half-integral five-terminus flows
A.V. Karzanov
Discrete Applied Mathematics
18
, 1987, pp. 263-278
Bipartite permutation graphs
Jeremy Spinrad
,
Andreas Brandstädt
,
Lorna Stewart
Discrete Applied Mathematics
18
, 1987, pp. 279-292
Seiten 1
2
3
>