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=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
O. Bahn
,
J.L. Goffin
,
J.P. Vial
,
O. Du Merle
Discrete Applied Mathematics
49
, 1994, pp. 3-23
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Hans-Jürgen Bandelt
,
Yves Crama
,
Frits C.R. Spieksma
Discrete Applied Mathematics
49
, 1994, pp. 25-50
Solving the uncapacited plant location problem on trees
Alain Billionnet
,
Marie-Christine Costa
Discrete Applied Mathematics
49
, 1994, pp. 51-59
Decompositions into linear forests and difference labelings of graphs
Gary S. Bloom
,
Sergio Ruiz
Discrete Applied Mathematics
49
, 1994, pp. 61-75
Balancing problems in acyclic networks
Endre Boros
,
Peter L. Hammer
,
Mark E. Hartmann
,
Ron Shamir
Discrete Applied Mathematics
49
, 1994, pp. 77-93
The complexity of colouring symmetric relational systems
Richard Brewster
Discrete Applied Mathematics
49
, 1994, pp. 95-105
A branch and bound algorithm for the job-shop scheduling problem
Peter Brucker
,
Bernd Jurisch
,
Bernd Sievers
Discrete Applied Mathematics
49
, 1994, pp. 107-127
Tree scheduling with communication delays
Philippe Chretienne
Discrete Applied Mathematics
49
, 1994, pp. 129-141
Probabilistic estimates for the generalized maximum satisfiability problem
M. Cochand
Discrete Applied Mathematics
49
, 1994, pp. 143-163
Chromatic scheduling and frequency assignment
D. de Werra
,
Y. Gay
Discrete Applied Mathematics
49
, 1994, pp. 165-174
An exact algorithm for the 0-1 collapsing knapsack problem
Didier Fayard
,
Gérard Plateau
Discrete Applied Mathematics
49
, 1994, pp. 175-187
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
Arnaud Freville
,
Gérard Plateau
Discrete Applied Mathematics
49
, 1994, pp. 189-212
A guide to the graph labeling zoo
Joseph A. Gallian
Discrete Applied Mathematics
49
, 1994, pp. 213-229
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Fred Glover
Discrete Applied Mathematics
49
, 1994, pp. 231-255
Local optima topology for the
k
-coloring problem
Alain Hertz
,
Brigitte Jaumard
,
Marcus Poggi de Arag\~ao
Discrete Applied Mathematics
49
, 1994, pp. 257-280
Medians for weight metrics in the covering graphs of semilattices
Bruno Leclerc
Discrete Applied Mathematics
49
, 1994, pp. 281-297
Some complexity results about threshold graphs
F. Margot
Discrete Applied Mathematics
49
, 1994, pp. 299-308
An
O(nm)
-time algorithm for computing the dual of a regular Boolean function
Uri N. Peled
,
Bruno Simeone
Discrete Applied Mathematics
49
, 1994, pp. 309-323
Total matchings and total coverings of threshold graphs
Uri Peled
,
Feng Sun
Discrete Applied Mathematics
49
, 1994, pp. 325-330
On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
Fred S. Roberts
,
Yonghua Xu
Discrete Applied Mathematics
49
, 1994, pp. 331-356
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
Hanif D. Sherali
,
Sridhar Ramachandran
,
Seong-in Kim
Discrete Applied Mathematics
49
, 1994, pp. 357-378