default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbilio Lucena
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]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)- [c7]Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha:
Compact and non-compact formulations for the Dominated Coloring Problem. INOC 2024: 46-51 - [c6]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
- [j41]Vinicius Leal do Forte
, Saïd Hanafi, Abilio Lucena:
Extended formulations for perfect domination problems and their algorithmic implications. Eur. J. Oper. Res. 310(2): 566-581 (2023) - [c5]Lívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter:
Mixed integer programming and quadratic programming formulations for the interval count problem. LAGOS 2023: 283-291 - 2022
- [j40]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) - [i1]Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Some New Results on Efficient and Perfect Edge Domination of Graphs. CoRR abs/2204.11785 (2022) - 2021
- [j39]Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França:
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77(4): 520-537 (2021) - 2020
- [j38]Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Modelling and solving the perfect edge domination problem. Optim. Lett. 14(2): 369-394 (2020)
2010 – 2019
- 2019
- [j37]Alexandre Salles da Cunha, Abilio Lucena:
Modeling and solving the angular constrained minimum spanning tree problem. Comput. Oper. Res. 112 (2019) - [c4]Carlos E. Marciano, Abilio Lucena, Felipe M. G. França, Luidi Gelabert Simonetti:
Minimum Concurrency for Assembling Computer Music. INOC 2019: 83-88 - 2016
- [j36]Jesus Ossian Cunha, Luidi Simonetti, Abilio Lucena:
Lagrangian heuristics for the Quadratic Knapsack Problem. Comput. Optim. Appl. 63(1): 97-120 (2016) - [j35]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) - [j34]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) - [j33]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) - 2015
- [j32]Sebastián Urrutia, Abilio Lucena:
Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]. Discret. Appl. Math. 185: 254-255 (2015) - [j31]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) - [j30]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) - 2014
- [j29]Sebastián Urrutia, Abilio Lucena:
Characterizing acyclic graphs by labeling edges. Discret. Appl. Math. 164: 492-499 (2014) - [j28]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) - 2013
- [j27]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) - [j26]Vinicius Leal do Forte, Abilio Lucena, Nelson Maculan:
Formulations for the Minimum 2-Connected Dominating Set Problem. Electron. Notes Discret. Math. 41: 415-422 (2013) - [j25]Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Formulating and Solving the Minimum Dominating Cycle Problem. Electron. Notes Discret. Math. 41: 423-430 (2013) - [j24]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) - [j23]Fernanda Bravo, Guillermo Durán, Abilio Lucena, Javier Marenco, Diego Morán, Andrés Weintraub:
Mathematical models for optimizing production chain planning in salmon farming. Int. Trans. Oper. Res. 20(5): 731-766 (2013) - [j22]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) - 2011
- [j21]Sebastián Urrutia, Abilio Lucena:
A New Formulation for Spanning Trees. Electron. Notes Discret. Math. 37: 195-200 (2011) - [c3]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 - [c2]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 - 2010
- [j20]Abilio Lucena, Nelson Maculan, Luidi Simonetti:
Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Manag. Sci. 7(3): 289-311 (2010) - [j19]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) - [j18]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) - [j17]Abilio Lucena, Celso C. Ribeiro, Andréa C. Santos:
A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Glob. Optim. 46(3): 363-381 (2010)
2000 – 2009
- 2009
- [j16]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) - 2008
- [j15]Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena:
A Relax-and-Cut algorithm for the set partitioning problem. Comput. Oper. Res. 35(6): 1963-1981 (2008) - [j14]Isabel Méndez-Díaz, Paula Zabala, Abilio Lucena:
A new formulation for the Traveling Deliveryman Problem. Discret. Appl. Math. 156(17): 3223-3237 (2008) - [j13]Alfredo N. Iusem, Abilio Lucena, Nelson Maculan:
Preface. Math. Program. 112(1): 1 (2008) - 2007
- [j12]Alexandre Salles da Cunha, Abilio Lucena:
Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks 50(1): 55-66 (2007) - 2006
- [j11]Rafael Andrade, Abilio Lucena, Nelson Maculan:
Using Lagrangian dual information to generate degree constrained spanning trees. Discret. Appl. Math. 154(5): 703-717 (2006) - [p1]Abilio Lucena:
Lagrangian Relax-and-Cut Algorithms. Handbook of Optimization in Telecommunications 2006: 129-145 - 2005
- [j10]Abilio Lucena:
Non Delayed Relax-and-Cut Algorithms. Ann. Oper. Res. 140(1): 375-410 (2005) - [j9]Alexandre Salles da Cunha, Abilio Lucena:
Algorithms for the degree-constrained minimum spanning tree problem. Electron. Notes Discret. Math. 19: 403-409 (2005) - 2004
- [j8]Abilio Lucena, Mauricio G. C. Resende:
Strong lower bounds for the prize collecting Steiner problem in graphs. Discret. Appl. Math. 141(1-3): 277-294 (2004) - [j7]Carlos A. J. Martinhon, Abilio Lucena, Nelson Maculan:
Stronger K-tree relaxations for the vehicle routing problem. Eur. J. Oper. Res. 158(1): 56-71 (2004) - [c1]Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro:
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. WEA 2004: 458-467 - 2003
- [j6]Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza:
Optimal rectangular partitions. Networks 41(1): 51-67 (2003) - 2001
- [j5]Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena:
Maximum flow problems under special nonnegative lower bounds on arc flows. Electron. Notes Discret. Math. 7: 66-69 (2001) - [j4]Abilio Lucena, Mauricio G. C. Resende:
Generating lower bounds for the prize collecting Steiner problem in graphs. Electron. Notes Discret. Math. 7: 70-73 (2001)
1990 – 1999
- 1998
- [j3]Abilio Lucena, John E. Beasley:
A branch and cut algorithm for the Steiner problem in graphs. Networks 31(1): 39-59 (1998) - 1992
- [j2]Nagraj Balakrishnan, Abilio Lucena, Richard T. Wong:
Scheduling examinations to reduce second-order conflicts. Comput. Oper. Res. 19(5): 353-361 (1992) - 1990
- [j1]Abilio Lucena:
Time-dependent traveling salesman problem-the deliveryman case. Networks 20(6): 753-763 (1990)
Coauthor Index
aka: Luidi Gelabert Simonetti
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-03-04 21:23 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:
