Author/Creator: Pereira, Dilson Lucas - British Library Electronic Legal Deposit Catalogue-Journal Issues and Articles Search Results

Author/Creator Pereira, Dilson Lucas

1. A comparison of several models for the hamiltonian p‐median problem. Issue 4 (7th March 2014)

Authors:: Gollowitzer, Stefan; Gouveia, Luis; Laporte, Gilbert; Pereira, Dilson Lucas; Wojciechowski, Adam
Journal:: Networks
Issue:: Volume 63:Issue 4(2014:Jul.)
Page Start:: 350
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

2. A comparison of several models for the hamiltonian p‐median problem. Issue 4 (7th March 2014)

Authors:: Gollowitzer, Stefan; Gouveia, Luis; Laporte, Gilbert; Pereira, Dilson Lucas; Wojciechowski, Adam
Journal:: Networks
Issue:: Volume 63:Issue 4(2014:Jul.)
Page Start:: 350
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

3. A multiperiod workforce scheduling and routing problem with dependent tasks. (June 2020)

Authors:: Pereira, Dilson Lucas; Alves, Júlio César; Moreira, Mayron César de Oliveira
Journal:: Computers & operations research
Issue:: Volume 118(2020)
Page Start:
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

4. Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. (22nd March 2021)

Authors:: Notini Pontes, Vitor; Pereira, Dilson Lucas
Journal:: International transactions in operational research
Issue:: Volume 29:Number 3(2022)
Page Start:: 1520
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

5. Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem. Issue 4 (2nd February 2015)

Authors:: Pereira, Dilson Lucas; Gendreau, Michel; Salles da Cunha, Alexandre
Journal:: Networks
Issue:: Volume 65:Issue 4(2015:Jul.)
Page Start:: 367
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

6. Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. (November 2015)

Authors:: Pereira, Dilson Lucas; Gendreau, Michel; da Cunha, Alexandre Salles
Journal:: Computers & operations research
Issue:: Volume 63(2015)
Page Start:: 149
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

7. Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. Issue 1 (31st October 2017)

Authors:: Pereira, Dilson Lucas; da Cunha, Alexandre Salles
Journal:: Networks
Issue:: Volume 71:Issue 1(2018)
Page Start:: 31
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

8. Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem. (October 2018)

Authors:: Pereira, Dilson Lucas; da Cunha, Alexandre Salles
Journal:: Computers & operations research
Issue:: Volume 98(2018)
Page Start:: 38
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗