Kathryn A. Dowsland

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 Julia A. Bennell

> Home > Persons > Kathryn A. Dowsland

Publications

2016
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/itor/ZhaoBBD16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/itor/ZhaoBBD16
Xiaozhou Zhao, Julia A. Bennell, Tolga Bektas, Kathryn A. Dowsland:
A comparative review of 3D container loading algorithms. Int. Trans. Oper. Res. 23(1-2): 287-320 (2016)
2001
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/BennellDD01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/BennellDD01
Julia A. Bennell, Kathryn A. Dowsland, William B. Dowsland:
The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3): 271-287 (2001)
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/mansci/BennellD01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mansci/BennellD01
Julia A. Bennell, Kathryn A. Dowsland:
Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting. Manag. Sci. 47(8): 1160-1172 (2001)
1998
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jors/DowslandDB98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jors/DowslandDB98
Kathryn A. Dowsland, William B. Dowsland, Julia A. Bennell:
Jostling for position: local improvement for irregular cutting patterns. J. Oper. Res. Soc. 49(6): 647-658 (1998)

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.