default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Orestes Cerdeira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j20]Jorge Orestes Cerdeira
, Maria João Martins, Marcos Raydan:
The max-out min-in problem: A tool for data analysis. Comput. Oper. Res. 154: 106218 (2023)- 2021
- [j19]J. Orestes Cerdeira, Pedro C. Silva:
A centrality notion for graphs based on Tukey depth. Appl. Math. Comput. 409: 126409 (2021) - 2019
- [j18]Jorge Orestes Cerdeira, Carlos Iglésias, Pedro C. Silva:
The train frequency compatibility problem. Discret. Appl. Math. 269: 18-26 (2019) - [j17]Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
A computational comparison of compact MILP formulations for the zero forcing number. Discret. Appl. Math. 269: 169-183 (2019) - 2017
- [j16]Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86: 79-85 (2017) - 2013
- [j15]Raul Brás, J. Orestes Cerdeira, Diogo Alagador, Miguel B. Araújo:
Linking habitats for multiple species. Environ. Model. Softw. 40: 336-339 (2013) - [j14]Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
Using decomposition to improve greedy solutions of the optimal diversity management problem. Int. Trans. Oper. Res. 20(5): 617-625 (2013) - 2012
- [j13]J. Orestes Cerdeira, Maria João Martins, Pedro C. Silva:
A Combinatorial Approach to Assess the Separability of Clusters. J. Classif. 29(1): 7-22 (2012) - 2011
- [j12]J. Orestes Cerdeira, Rosa M. V. Figueiredo, António Pereira, Cristina Requejo:
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry. Int. J. Math. Model. Numer. Optimisation 2(3): 273-287 (2011) - 2008
- [j11]Domingos Moreira Cardoso, J. Orestes Cerdeira, Charles Delorme, Pedro C. Silva:
Efficient edge domination in regular graphs. Discret. Appl. Math. 156(15): 3060-3065 (2008) - 2005
- [j10]Paulo Bárcia, J. Orestes Cerdeira:
k-Colour Partitions of Acyclic Tournaments. Electron. J. Comb. 12 (2005) - [j9]J. Orestes Cerdeira, Leonor Santiago Pinto:
Requiring Connectivity in the Set Covering Problem. J. Comb. Optim. 9(1): 35-47 (2005) - [j8]Paulo Bárcia, J. Orestes Cerdeira:
The k-Track Assignment Problem on Partial Orders. J. Sched. 8(2): 135-143 (2005) - 2004
- [j7]Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto:
Computational aspects of algorithms for variable selection in the context of principal components. Comput. Stat. Data Anal. 47(2): 225-236 (2004) - 2003
- [j6]Paulo Bárcia, J. Orestes Cerdeira:
Node packings on cocomparability graphs. Oper. Res. Lett. 31(3): 341-342 (2003) - 1996
- [j5]J. Orestes Cerdeira, Paulo Bárcia:
Ordered matroids and regular independence systems. Discret. Math. 154(1-3): 255-261 (1996) - [j4]Sjoerd M. Baas, J. Orestes Cerdeira:
Minimum costK-forest covers. Math. Methods Oper. Res. 44(2): 255-265 (1996) - 1995
- [j3]J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia:
Establishing Determinantal Inequalities for Positive-definite Matrices. Discret. Appl. Math. 63(1): 13-24 (1995) - 1994
- [j2]J. Orestes Cerdeira:
Matroids and a forest cover problem. Math. Program. 66: 403-405 (1994) - 1991
- [j1]F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman:
Label-connected graphs and the gossip problem. Discret. Math. 87(1): 29-40 (1991)
Conference and Workshop Papers
- 2006
- [c1]Manuel Lameiras Campagnolo, J. Orestes Cerdeira:
Contextual classification of remotely sensed images with integer linear programming. CompIMAGE 2006: 123-128
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 2024-04-24 22:48 CEST 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:
