default search action
Dorabela Gamboa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Óscar Oliveira
, Dorabela Gamboa
An introduction to the two-dimensional rectangular cutting and packing problem. Int. Trans. Oper. Res. 30(6): 3238-3266 (2023) - 2021
- [j6]Telmo Matos
RAMP algorithms for the capacitated facility location problem. Ann. Math. Artif. Intell. 89(8-9): 799-813 (2021) - [j5]Óscar Oliveira
A dual RAMP algorithm for single source capacitated facility location problems. Ann. Math. Artif. Intell. 89(8-9): 815-834 (2021)
2010 – 2019
- 2019
- [c9]Óscar Oliveira
Adaptive Sequence-Based Heuristic for the Three-Dimensional Bin Packing Problem. LION 2019: 69-76 - [c8]Óscar Oliveira
A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems. LION 2019: 171-183 - [c7]Telmo Matos
A Simple Dual-RAMP Algorithm for the Capacitated Facility Location Problem. LION 2019: 240-252 - 2018
- [c6]Telmo Matos
A Simple Dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem. HIS 2018: 331-339 - [c5]Óscar Oliveira
Adaptive Sequence-Based Heuristic for the Two-Dimensional Non-guillotine Bin Packing Problem. HIS 2018: 370-375 - [c4]Telmo Matos
Improving Traditional Dual Ascent Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem: A RAMP Approach. LOD 2018: 243-253 - 2017
- [c3]Telmo Matos
Dual-RAMP for the Capacitated Single Allocation Hub Location Problem. ICCSA (2) 2017: 696-708 - [e1]Ana Maria Madureira
Intelligent Systems Design and Applications - 16th International Conference on Intelligent Systems Design and Applications (ISDA 2016) held in Porto, Portugal, December 16-18, 2016. Advances in Intelligent Systems and Computing 557, Springer 2017, ISBN 978-3-319-53479-4 [contents] - 2016
- [j4]César Rego
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem. Networks 68(1): 23-33 (2016) - [c2]Óscar Oliveira
An Information System for the Furniture Industry to Optimize the Cutting Process and the Waste Generated. CENTERIS/ProjMAN/HCist 2016: 711-716 - 2015
- [c1]Óscar Oliveira
Prototyping the One-Dimensional Cutting Stock Problem with Usable Leftovers for the Furniture Industry. WorldCIST (1) 2015: 671-677 - 2011
- [j3]César Rego
Traveling salesman problem heuristics: Leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3): 427-441 (2011)
2000 – 2009
- 2006
- [j2]Dorabela Gamboa
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Comput. Oper. Res. 33: 1154-1172 (2006) - 2005
- [j1]Dorabela Gamboa
Data structures and ejection chains for solving large-scale traveling salesman problems. Eur. J. Oper. Res. 160(1): 154-171 (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 2024-05-08 21:01 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: