Risto Lahdelma

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 Henri Hakonen

> Home > Persons > Risto Lahdelma

Publications

2008
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/RongHL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/RongHL08
Aiying Rong, Henri Hakonen, Risto Lahdelma:
A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems. Eur. J. Oper. Res. 190(3): 741-755 (2008)
2006
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/RongHL06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/RongHL06
Aiying Rong, Henri Hakonen, Risto Lahdelma:
An efficient linear model and optimisation algorithm for multi-site combined heat and power production. Eur. J. Oper. Res. 168(2): 612-632 (2006)
2003
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/LahdelmaH03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/LahdelmaH03
Risto Lahdelma, Henri Hakonen:
An efficient linear programming algorithm for combined heat and power production. Eur. J. Oper. Res. 148(1): 141-151 (2003)
2002
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/GreerHLM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/GreerHLM02
Brian Greer, Henri Hakonen, Risto Lahdelma, Risto Miikkulainen:
Numerical optimization with neuroevolution. IEEE Congress on Evolutionary Computation 2002: 396-401

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.