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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Invariant sets of arcs in network flow problems
R.P. Anstee
Discrete Applied Mathematics
13
, 1986, pp. 1-7
An assignment algorithm with applications to integrated circuit layout
Mikhail J. Atallah
,
Susanne E. Hambrusch
Discrete Applied Mathematics
13
, 1986, pp. 9-22
A solvable case of quadratic
0-1
-programming
Francisco Barahona
Discrete Applied Mathematics
13
, 1986, pp. 23-26
On an application of convexity to discrete systems
Svatopluk Poljak
,
Daniel Turzík
Discrete Applied Mathematics
13
, 1986, pp. 27-32
On pre-periods of discrete influence systems
Svatopluk Poljak
,
Daniel Turzík
Discrete Applied Mathematics
13
, 1986, pp. 33-39
Structural rigidity II: Almost infinitesimally rigid bar frameworks
I.G. Rosenberg
Discrete Applied Mathematics
13
, 1986, pp. 41-59
Conditions for the existence of solutions of the three-dimensional planar transportation problem
Milan Vlach
Discrete Applied Mathematics
13
, 1986, pp. 61-78
On the membership problem for regular DNLC grammars
I.J. Aalbersberg
,
G. Rozenberg
,
A. Ehrenfeucht
Discrete Applied Mathematics
13
, 1986, pp. 79-85
A note on finding a maximum empty rectangle
Mikhail J. Atallah
,
Greg N. Frederickson
Discrete Applied Mathematics
13
, 1986, pp. 87-91
Une amélioration de la méthode de Dijkstra pour la recherche d'un plus court chemin dans un réseau
Jean Bovet
Discrete Applied Mathematics
13
, 1986, pp. 93-96
Antisymmetrical neural networks
E. Goles
Discrete Applied Mathematics
13
, 1986, pp. 97-100
Testing homotopy equivalence is isomorphism complete
Yechezkel Zalcstein
,
Stanley P. Franklin
Discrete Applied Mathematics
13
, 1986, pp. 101-104
Spatial market equilibrium problems as network models
Oscar Barros
,
Andrés Weintraub
Discrete Applied Mathematics
13
, 1986, pp. 109-130
A variable-dimension homotopy on networks for computing linear spatial equilibria
Philip C. Jones
,
Romesh Saigal
,
Michael H. Schneider
Discrete Applied Mathematics
13
, 1986, pp. 131-156
Multi-terminal maximum flows in node-capacitated networks
Frieda Granot
,
Refael Hassin
Discrete Applied Mathematics
13
, 1986, pp. 157-163
A decomposition algorithm for multi-terminal network flows
M.T. Shing
,
T.C. Hu
Discrete Applied Mathematics
13
, 1986, pp. 165-181
Microcomputer-based algorithms for large scale shortest path problems
Darwin D. Klingman
,
Robert F. Schneider
Discrete Applied Mathematics
13
, 1986, pp. 183-206
A new variant of the partitioning shortest path algorithm
Nancy V. Phillips
Discrete Applied Mathematics
13
, 1986, pp. 207-212
Allowable processing orders in the accelerated cascade algorithm
A.J. Goldman
,
Prasoon Tiwari
Discrete Applied Mathematics
13
, 1986, pp. 213-221
Degeneracy in transportation problems
M.S. Hung
,
W.O. Rom
,
A.D. Waren
Discrete Applied Mathematics
13
, 1986, pp. 223-237
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
Yoshiro Ikura
,
George L. Nemhauser
Discrete Applied Mathematics
13
, 1986, pp. 239-248
The family constrained network problem
John Mote
Discrete Applied Mathematics
13
, 1986, pp. 249-257
The asymmetric
m
-travelling salesmen problem: A duality based branch-and-bound algorithm
A. Iqbal Ali
,
Jeff L. Kennington
Discrete Applied Mathematics
13
, 1986, pp. 259-276
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
Fred Glover
,
Beth Novick
Discrete Applied Mathematics
13
, 1986, pp. 277-286
A linear algorithm for finding a minimum dominating set in a cactus
S.T. Hedetniemi
,
Renu Laskar
,
John Pfaff
Discrete Applied Mathematics
13
, 1986, pp. 287-292