default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Salles da Cunha
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Abilio Lucena, Alexandre Salles da Cunha:
Stable set reformulations for the degree preserving spanning tree problem. Eur. J. Oper. Res. 319(1): 50-61 (2024)- [c10]Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha:
Compact and non-compact formulations for the Dominated Coloring Problem. INOC 2024: 46-51 - [c9]Dilson Lucas Pereira, Dilson Almeida Guimarães, Alexandre Salles da Cunha, Abilio Lucena:
Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem. ISCO 2024: 30-42 - 2023
- [j44]Henrique Favarini Alves da Cruz
, Alexandre Salles da Cunha:
The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms. Comput. Ind. Eng. 180: 109238 (2023) - 2022
- [j43]Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34(4): 1970-1986 (2022) - [j42]Alexandre Salles da Cunha:
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem. J. Comb. Optim. 44(1): 379-413 (2022) - 2021
- [j41]Dilson Almeida Guimarães, Alexandre Salles da Cunha:
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms. Comput. Geom. 97: 101771 (2021) - 2020
- [j40]Dilson Almeida Guimarães, Alexandre Salles da Cunha, Dilson Lucas Pereira:
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem. Eur. J. Oper. Res. 280(1): 46-58 (2020) - [j39]Dilson Lucas Pereira, Alexandre Salles da Cunha:
Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem. Eur. J. Oper. Res. 284(2): 413-426 (2020) - [i2]Alexandre Salles da Cunha:
Improved Formulations and Branch-and-cut Algorithms for the Angular Constrained Minimum Spanning Tree Problem. CoRR abs/2005.12245 (2020)
2010 – 2019
- 2019
- [j38]Alexandre Salles da Cunha, Abilio Lucena:
Modeling and solving the angular constrained minimum spanning tree problem. Comput. Oper. Res. 112 (2019) - [c8]Alexandre Salles da Cunha:
Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem. INOC 2019: 25-30 - 2018
- [j37]Dilson Lucas Pereira, Alexandre Salles da Cunha:
Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem. Comput. Oper. Res. 98: 38-55 (2018) - [j36]Rosklin Juliano Chagas, Cristiano Arbex Valle, Alexandre Salles da Cunha:
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem. Eur. J. Oper. Res. 271(1): 57-71 (2018) - [j35]Dilson Lucas Pereira, Alexandre Salles da Cunha:
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 71(1): 31-50 (2018) - 2017
- [j34]Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262(3): 817-834 (2017) - [i1]Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Optimally solving the joint order batching and picker routing problem. CoRR abs/1703.06531 (2017) - 2016
- [j33]Luis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena:
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem. Comput. Optim. Appl. 63(3): 755-792 (2016) - [j32]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 52: 237-244 (2016) - [j31]Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha:
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm. Electron. Notes Discret. Math. 52: 285-292 (2016) - [j30]Vinicius Morais, Alexandre Salles da Cunha, Philippe Mahey:
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game. Electron. Notes Discret. Math. 52: 309-316 (2016) - [c7]Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories. ISCO 2016: 81-97 - 2015
- [j29]Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Comput. Oper. Res. 63: 149-160 (2015) - [j28]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. Eur. J. Oper. Res. 246(2): 392-399 (2015) - [j27]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron:
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65(4): 329-343 (2015) - [j26]Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 65(4): 367-379 (2015) - [j25]Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Transp. Sci. 49(2): 355-368 (2015) - 2014
- [j24]Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm. Discret. Appl. Math. 164: 210-224 (2014) - [j23]Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26(4): 645-657 (2014) - [c6]Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza:
Finding Totally Independent Spanning Trees with Linear Integer Programming. ISCO 2014: 149-160 - 2013
- [j22]Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
The Pickup and Delivery Problem with Cross-Docking. Comput. Oper. Res. 40(4): 1085-1093 (2013) - [j21]Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41: 173-180 (2013) - [j20]Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs. Electron. Notes Discret. Math. 41: 229-236 (2013) - [j19]Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Formulating and Solving the Minimum Dominating Cycle Problem. Electron. Notes Discret. Math. 41: 423-430 (2013) - [j18]Ramon Lopes, Vitor A. A. Souza, Alexandre Salles da Cunha:
A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem. Electron. Notes Discret. Math. 44: 61-66 (2013) - [j17]Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
A New Formulation and Computational Results for the Simple Cycle Problem. Electron. Notes Discret. Math. 44: 83-88 (2013) - [j16]Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena:
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem. Math. Program. 142(1-2): 511-538 (2013) - [j15]Fernando Afonso Santos, Alexandre Salles da Cunha, Geraldo Robson Mateus:
Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem. Optim. Lett. 7(7): 1537-1547 (2013) - 2012
- [c5]Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem. ISCO 2012: 237-248 - 2011
- [j14]Wagner Moro Aioffi, Cristiano Arbex Valle, Geraldo Robson Mateus, Alexandre Salles da Cunha:
Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks. Comput. Networks 55(13): 2803-2820 (2011) - [j13]Cristiano Arbex Valle, Leonardo Conegundes Martinez, Alexandre Salles da Cunha, Geraldo Robson Mateus:
Heuristic and exact algorithms for a min-max selective vehicle routing problem. Comput. Oper. Res. 38(7): 1054-1065 (2011) - [j12]Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. Electron. Notes Discret. Math. 37: 249-254 (2011) - [j11]Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus:
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. Electron. Notes Discret. Math. 37: 315-320 (2011) - [c4]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. INOC 2011: 43-50 - [c3]Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena:
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. INOC 2011: 162-169 - [c2]Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking. INOC 2011: 412-425 - 2010
- [j10]Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena:
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. Discret. Appl. Math. 158(12): 1305-1314 (2010) - [j9]Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm. Electron. Notes Discret. Math. 36: 311-318 (2010) - [j8]Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza:
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem. Electron. Notes Discret. Math. 36: 623-630 (2010)
2000 – 2009
- 2009
- [j7]Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende:
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discret. Appl. Math. 157(6): 1198-1217 (2009) - [j6]Cristiano Arbex Valle, Alexandre Salles da Cunha, Geraldo Robson Mateus, Leonardo C. Martinez:
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized. Electron. Notes Discret. Math. 35: 133-138 (2009) - [j5]Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus:
The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks. Electron. Notes Discret. Math. 35: 139-144 (2009) - 2008
- [j4]Alexandre Salles da Cunha, Maurício Cardoso de Souza:
Stronger upper and lower bounds for a hard batching problem to feed assembly lines. Electron. Notes Discret. Math. 30: 159-164 (2008) - [j3]Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus:
Integer Programming Formulations for the k-Cardinality Tree Problem. Electron. Notes Discret. Math. 30: 225-230 (2008) - [c1]Cristiano Arbex Valle, Alexandre Salles da Cunha, Wagner Moro Aioffi, Geraldo Robson Mateus:
Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks. MSWiM 2008: 239-243 - 2007
- [j2]Alexandre Salles da Cunha, Abilio Lucena:
Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks 50(1): 55-66 (2007) - 2005
- [j1]Alexandre Salles da Cunha, Abilio Lucena:
Algorithms for the degree-constrained minimum spanning tree problem. Electron. Notes Discret. Math. 19: 403-409 (2005)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
