Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andrew J. Parkes

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 Ahmed Kheiri

> Home > Persons > Andrew J. Parkes

Publications

2016
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/KheiriOP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/KheiriOP16
Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Ann. Oper. Res. 239(1): 135-151 (2016)
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/isci/AstaKKOP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/AstaKKOP16
Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf. Sci. 373: 476-498 (2016)
2015
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AstaKKOP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AstaKKOP15
Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem. CoRR abs/1511.04387 (2015)

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.