Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Dilson Lucas Pereira"'
Autor:
Dilson Lucas Pereira
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFMGUniversidade Federal de Minas GeraisUFMG.
This work adresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery,where routes must be devised to fulfil the pickup and delivery requests of a setof customers. Each customer must be served by only one route, the load it receives is
Externí odkaz:
http://hdl.handle.net/1843/ESBF-9KHJA4
Autor:
Dilson Lucas Pereira
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFMGUniversidade Federal de Minas GeraisUFMG.
This work adresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery, where routes must be devised to fulfil the pickup and delivery requests of a set of customers. Each customer must be served by only one route, the load it receives
Externí odkaz:
http://hdl.handle.net/1843/SLSS-85BJG5
Publikováno v:
INFORMS Journal on Computing. 34:1970-1986
A formulation, a heuristic, and branch-and-cut algorithms are investigated for the chordless cycle problem. This is the problem of finding a largest simple cycle for a given graph so that no edge between nonimmediately subsequent cycle vertices is co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::161494e2550605f6210c864f53aea460
https://doi.org/10.1287/ijoc.2022.1164
https://doi.org/10.1287/ijoc.2022.1164
Publikováno v:
International Transactions in Operational Research. 29:1520-1546
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::475b7cb570879b249ae683481af03430
https://doi.org/10.1111/itor.12971
https://doi.org/10.1111/itor.12971
Publikováno v:
European Journal of Operational Research. 284:413-426
In this paper, we introduce a dynamic Dantzig–Wolfe (DW) reformulation framework for the Adjacent Only Quadratic Minimum Spanning Tree Problem (AQMSTP). The approach is dynamic in the sense that the structures over which the DW reformulation takes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59b61fbee189d197e3e948fa7b079991
https://doi.org/10.1016/j.ejor.2019.12.042
https://doi.org/10.1016/j.ejor.2019.12.042
Publikováno v:
European Journal of Operational Research. 280:46-58
In this paper, we investigate Semidefinite Programming (SDP) lower bounds for the Quadratic Minimum Spanning Tree Problem (QMSTP). Two SDP lower bounding approaches are introduced here. Both apply Lagrangian Relaxation to an SDP relaxation for the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74e55c0eef5ce8f5f4239fa24889d98e
https://doi.org/10.1016/j.ejor.2019.07.038
https://doi.org/10.1016/j.ejor.2019.07.038
In this paper, we study a new Workforce Scheduling and Routing Problem, denoted Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks. In this problem, customers request services from a company. Each service is composed of depende
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7170b9eb1a1957a5ff548d2713e87488
http://arxiv.org/abs/2008.02849
http://arxiv.org/abs/2008.02849
Publikováno v:
Computers & Operations Research. 98:38-55
The Minimum Cost Hop-and-root Constrained Forest Problem (MCHCFP) is a combinatorial optimization problem that arises in the design of energy efficient wireless sensor networks with mobile sinks. It aims at providing a communication topology that min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::566281f70a79efc7fc92d555d124f53f
https://doi.org/10.1016/j.cor.2018.05.013
https://doi.org/10.1016/j.cor.2018.05.013
Publikováno v:
Networks. 71:31-50
Given a complete and undirected graph G, the adjacent only quadratic minimum spanning tree problem (AQMSTP) consists of finding a spanning tree that minimizes a quadratic function of its adjacent edges. The strongest AQMSTP linear integer programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7aec117dd327a81e699b1ea83e54bbd0
https://doi.org/10.1002/net.21787
https://doi.org/10.1002/net.21787
Publikováno v:
Computers & Operations Research. 63:149-160
We address the quadratic minimum spanning tree problem (QMSTP), the problem of finding a spanning tree of a connected and undirected graph such that a quadratic cost function is minimized. We first propose an integer programming formulation based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49a18832ac3e6aaa6ada1628b19ba0b3
https://doi.org/10.1016/j.cor.2015.04.020
https://doi.org/10.1016/j.cor.2015.04.020