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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The effect of two cycles on the complexity of colourings by directed graphs
Jrgen Bang-Jensen
,
Pavol Hell
Discrete Applied Mathematics
26
, 1990, pp. 1-23
On minimum matrix representation of closure operations
F.E. Bennett
,
Lisheng Wu
Discrete Applied Mathematics
26
, 1990, pp. 25-40
A constrained sports scheduling problem
D. de Werra
,
L. Jacot-Descombes
,
P. Masson
Discrete Applied Mathematics
26
, 1990, pp. 41-49
On the
r,s
-SAT satisfiability problem and a conjecture of Tovey
Olivier Dubois
Discrete Applied Mathematics
26
, 1990, pp. 51-60
A new linear storage, polynomial-time approximation scheme for the subset-sum problem
Matteo Fischetti
Discrete Applied Mathematics
26
, 1990, pp. 61-77
The optimal procedures for quantitative group testing
Fred H. Hao
Discrete Applied Mathematics
26
, 1990, pp. 79-86
On totally dual integral systems
S.N. Kabadi
,
R. Chandrasekaran
Discrete Applied Mathematics
26
, 1990, pp. 87-104
The complexity of finding two disjoint paths with min-max objective function
Chung-Lun Li
,
S. Thomas McCormick
,
David Simchi-Levi
Discrete Applied Mathematics
26
, 1990, pp. 105-115
Size of context in regenerative IL systems
Alica Kelemenová
Discrete Applied Mathematics
26
, 1990, pp. 117-119
Asymptotic number of symmetries in locally restricted trees
J.W. Kennedy
,
K.A. McKeon
,
E.M. Palmer
,
R.W. Robinson
Discrete Applied Mathematics
26
, 1990, pp. 121-124
Two mixed integer programming formulations arising in manufacturing management
Robert G. Jeroslow
Discrete Applied Mathematics
26
, 1990, pp. 137-157
On an optimization problem with nested constraints
M.E. Dyer
,
A.M. Frieze
Discrete Applied Mathematics
26
, 1990, pp. 159-173
Resource constrained assignment problems
Ronny Aboudi
,
Kurt Jrnsten
Discrete Applied Mathematics
26
, 1990, pp. 175-191
The selective travelling salesman problem
Gilbert Laporte
,
Silvano Martello
Discrete Applied Mathematics
26
, 1990, pp. 193-207
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
T.H.C. Smith
,
T.W.S. Meyer
,
G.L. Thompson
Discrete Applied Mathematics
26
, 1990, pp. 209-217
Combinatorial optimisation algorithms for a CAD workstation
W.L. Price
,
F.W. Woodhams
Discrete Applied Mathematics
26
, 1990, pp. 219-233
A survey of algorithms for the single machine total weighted tardiness scheduling problem
T.S. Abdul-Razaq
,
C.N. Potts
,
L.N. van Wassenhove
Discrete Applied Mathematics
26
, 1990, pp. 235-253
Formulating the single machine sequencing problem with release dates as a mixed integer program
Martin E. Dyer
,
Laurence A. Wolsey
Discrete Applied Mathematics
26
, 1990, pp. 255-270
A survey of results for sequencing problems with controllable processing times
Eugeniusz Nowicki
,
Stanislaw Zdrzaƚka
Discrete Applied Mathematics
26
, 1990, pp. 271-287
Classification of a class of distance-regular graphs via completely regular codes
Josep Rifà
,
L. Huguet
Discrete Applied Mathematics
26
, 1990, pp. 289-300