Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Georg Ch. Pflug

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Walter J. Gutjahr

> Home > Persons > Georg Ch. Pflug

Publications

1999
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/GutjahrHP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/GutjahrHP99
Walter J. Gutjahr, A. Hellmayr, Georg Ch. Pflug:
Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound. Eur. J. Oper. Res. 117(2): 396-413 (1999)
1996
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/GutjahrP96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/GutjahrP96
Walter J. Gutjahr, Georg Ch. Pflug:
Simulated Annealing for noisy cost functions. J. Glob. Optim. 8(1): 1-13 (1996)
1992
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/GutjahrP92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/GutjahrP92
Walter J. Gutjahr, Georg Ch. Pflug:
The asymptotic distribution of leaf heights in binary trees. Graphs Comb. 8(3): 243-251 (1992)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ita/GutjahrP92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/GutjahrP92
Walter J. Gutjahr, Georg Ch. Pflug:
The limiting common distribution of two leaf heights in a random brinary tree. RAIRO Theor. Informatics Appl. 26: 1-18 (1992)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.