Jonathan M. Thompson

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 Wasin Padungwech

> Home > Persons > Jonathan M. Thompson

Publications

2020
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/PadungwechTL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/PadungwechTL20
Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Effects of update frequencies in a dynamic capacitated arc routing problem. Networks 76(4): 522-538 (2020)
2017
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/ukci/AlrajhiTP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ukci/AlrajhiTP17
Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech:
A Heuristic Approach for the Dynamic Frequency Assignment Problem. UKCI 2017: 91-103
2016
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/hm/PadungwechTL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hm/PadungwechTL16
Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem. HM 2016: 62-74
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/hm/AlrajhiTP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hm/AlrajhiTP16
Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech:
Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem. HM 2016: 157-170

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.