Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Alexandre Salles da Cunha"'
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:
Computers & Industrial Engineering. 180:109238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::369f74f23e42efdc57e11de6cfae7647
https://doi.org/10.1016/j.cie.2023.109238
https://doi.org/10.1016/j.cie.2023.109238
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
Autor:
Alexandre Salles da Cunha
The Angular Constrained Minimum Spanning Tree Problem ($\alpha$-MSTP) is defined in terms of a complete undirected graph $G=(V,E)$ and an angle $\alpha \in (0,2\pi]$. Vertices of $G$ define points in the Euclidean plane while edges, the line segments
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9a5af4001b4c738391b2d130e40244e
Publikováno v:
European Journal of Operational Research. 271:57-71
The Multi-period Degree Constrained Minimum Spanning Tree Problem (MP-DCMSTP) is defined in terms of a finite discretized planning horizon, an edge weighted undirected graph G, degree bounds and latest installation dates assigned to the vertices of G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ca49692033eb8397f74289e3bbc5947
https://doi.org/10.1016/j.ejor.2018.05.010
https://doi.org/10.1016/j.ejor.2018.05.010
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:
Computational Geometry. 97:101771
The Minimum Area Spanning Tree Problem (MASTP) is defined in terms of a complete undirected graph G, where every vertex represents a point in the two dimensional Euclidean plane. Associated to each edge, there is a disk placed right at its midpoint,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75c866e984ec7d4f14fd85e243f74d06
https://doi.org/10.1016/j.comgeo.2021.101771
https://doi.org/10.1016/j.comgeo.2021.101771
Publikováno v:
European Journal of Operational Research. 262:817-834
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the cas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb6788ac37bf484b17471d7956205315
https://doi.org/10.1016/j.ejor.2017.03.069
https://doi.org/10.1016/j.ejor.2017.03.069
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