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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On an extremal problem concerning the interval number of a graph
Thomas Andreae
Discrete Applied Mathematics
14
, 1986, pp. 1-9
Linear objective functions on certain classes of greedoids
Roy H., Jr. Goetschel
Discrete Applied Mathematics
14
, 1986, pp. 11-16
The Linzertorte problem, or a unified approach to painting, baking and weaving
Dorit S. Hochbaum
,
Edna Wigderson
Discrete Applied Mathematics
14
, 1986, pp. 17-32
A polymatroid associated with convex games
Hiroshi Kaneko
,
Masanori Fushimi
Discrete Applied Mathematics
14
, 1986, pp. 33-45
A system of linear equations related to the transportation problem with application to probability theory
T.F. Lin
Discrete Applied Mathematics
14
, 1986, pp. 47-56
A duality property for the set of all feasible solutions to an integer program
Azaria Paz
Discrete Applied Mathematics
14
, 1986, pp. 57-66
Schedule-induced posets
F.J. Radermacher
Discrete Applied Mathematics
14
, 1986, pp. 67-91
Algorithms and complexity for least median of squares regression
J.M. Steele
,
W.L. Steiger
Discrete Applied Mathematics
14
, 1986, pp. 93-100
An optimization problem on graphs
Ding-Zhu Du
Discrete Applied Mathematics
14
, 1986, pp. 101-104
A decision procedure on partially commutative free monoids
Aldo de Luca
,
Antonio Massarotti
Discrete Applied Mathematics
14
, 1986, pp. 105-108
Polyhedral proof methods in combinatorial optimization
A. Schrijver
Discrete Applied Mathematics
14
, 1986, pp. 111-133
An introduction to parallelism in combinatorial optimization
G.A.P. Kindervater
,
J.K. Lenstra
Discrete Applied Mathematics
14
, 1986, pp. 135-156
Randomized algorithms in combinatorial optimization: A survey
Francesco Maffioli
Discrete Applied Mathematics
14
, 1986, pp. 157-170
An introduction to the analysis of approximation algorithms
A.H.G. Rinnooy Kan
Discrete Applied Mathematics
14
, 1986, pp. 171-185
The rate of convergence to optimality of the LPT rule
J.B.G. Frenk
,
A.H.G. Rinnooy Kan
Discrete Applied Mathematics
14
, 1986, pp. 187-197
Valid inequalities for mixed
0-1
-programs
Tony J. van Roy
,
Laurence A. Wolsey
Discrete Applied Mathematics
14
, 1986, pp. 199-213
Search problems on graphs
M. Aigner
Discrete Applied Mathematics
14
, 1986, pp. 215-230
Recognition of Gilmore-Gomory traveling salesman problem
R. Chandrasekaran
Discrete Applied Mathematics
14
, 1986, pp. 231-238
Some NP-complete problems for hypergraph degree sequences
Charles J. Colbourn
,
W.L. Kocay
,
D.R. Stinson
Discrete Applied Mathematics
14
, 1986, pp. 239-254
Largest polygons with vertices in a given finite set
Craig Cordes
,
K.B. Reid
Discrete Applied Mathematics
14
, 1986, pp. 255-262
On equivalent knapsack problems
H. Greenberg
Discrete Applied Mathematics
14
, 1986, pp. 263-268
Unimodular functions
Pierre Hansen
,
Bruno Simeone
Discrete Applied Mathematics
14
, 1986, pp. 269-281
An asymptotically exact polynomial algorithm for equipartition problems
Bruno Simeone
Discrete Applied Mathematics
14
, 1986, pp. 283-293
Computation on binary tree-networks
Maurice Tchuente
Discrete Applied Mathematics
14
, 1986, pp. 295-310