default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Bahiense
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Isaac Balster
, Joyce Azevedo Caetano, Glaydston Mattos Ribeiro, Laura Bahiense:
Optimizing the Transport of Organs for Transplantation. Comput. Oper. Res. 176: 106934 (2025)- 2024
- [j22]Roberto Edward Cruz, André Bergsten Mendes, Laura Bahiense:
Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time. Int. Trans. Oper. Res. 31(4): 2338-2365 (2024) - 2023
- [j21]Bruno Salezze Vieira, Glaydston Mattos Ribeiro, Laura Bahiense:
Metaheuristics with variable diversity control and neighborhood search for the Heterogeneous Site-Dependent Multi-depot Multi-trip Periodic Vehicle Routing Problem. Comput. Oper. Res. 153: 106189 (2023) - [c3]Matheus Simões, Laura Bahiense, Celina M. H. de Figueiredo:
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel. LAGOS 2023: 35-42 - 2021
- [j20]Bruno Salezza Vieira, Glaydston Mattos Ribeiro, Laura Bahiense, Roberto Edward Cruz, André Bergsten Mendes, Gilbert Laporte:
Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions. Eur. J. Oper. Res. 295(3): 908-923 (2021) - [j19]Flavio Soares de Oliveira Junior, Elton Fernandes, Laura Bahiense, Carlos Moacir Grandi:
A practical approach to support end-of-life commercial aircraft parking, market relocation, retirement and decommissioning strategic decisions. Int. J. Prod. Res. 59(17): 5144-5163 (2021) - [j18]Laura Bahiense, Arthur Besso, Rogerio Tostas, Nelson Maculan:
Using multiflow formulations to solve the Steiner tree problem in graphs. RAIRO Oper. Res. 55(Supplement): S343-S350 (2021) - 2020
- [j17]Henrique L. F. Soares, Edilson F. Arruda, Laura Bahiense, Daniel Gartner, Luiz Amorim Filho:
Optimisation and control of the supply of blood bags in hemotherapic centres via Markov decision process with discounted arrival rate. Artif. Intell. Medicine 104: 101791 (2020) - [j16]Isabelle D. Martins, Laura Bahiense, Carlos E. D. Infante, Edilson F. Arruda:
Dimensionality reduction for multi-criteria problems: An application to the decommissioning of oil and gas installations. Expert Syst. Appl. 148: 113236 (2020) - [j15]Bruno Salezza Vieira, Thayse Ferrari, Glaydston Mattos Ribeiro, Laura Bahiense, Romulo Dante Orrico Filho, Carlos Alberto Abramides, Nilo Flavio Rosa Campos Júnior:
A progressive hybrid set covering based algorithm for the traffic counting location problem. Expert Syst. Appl. 160: 113641 (2020) - [c2]João Marcelo Leal Gomes Leite, Edilson F. Arruda, Laura Bahiense, Lino G. Marujo:
Mine-to-client planning with Markov Decision Process. ECC 2020: 1123-1128
2010 – 2019
- 2019
- [j14]Roberto Edward Cruz, André Bergsten Mendes, Laura Bahiense, Yue Wu:
Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels. Eur. J. Oper. Res. 275(1): 334-346 (2019) - 2018
- [j13]Cecília L. Siqueira, Edilson F. Arruda, Laura Bahiense, Germana L. Bahr, Geraldo R. Motta:
Long-term integrated surgery room optimization and recovery ward planning, with a case study in the Brazilian National Institute of Traumatology and Orthopedics (INTO). Eur. J. Oper. Res. 264(3): 870-883 (2018) - 2014
- [j12]Nathália da Silva Sena Hermeto, Virgílio José Martins Ferreira Filho, Laura Bahiense:
Logistics network planning for offshore air transport of oil rig crews. Comput. Ind. Eng. 75: 41-54 (2014) - [j11]Laura Bahiense, Yuri Frota, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discret. Appl. Math. 164: 34-46 (2014) - 2013
- [j10]Erito Marques de Souza Filho, Laura Bahiense, Virgílio José Martins Ferreira Filho:
Scheduling a multi-product pipeline network. Comput. Chem. Eng. 53: 55-69 (2013) - 2012
- [j9]Hugo Vinícius Bassi, Virgílio José Martins Ferreira Filho, Laura Bahiense:
Planning and scheduling a fleet of rigs using simulation-optimization. Comput. Ind. Eng. 63(4): 1074-1088 (2012) - [j8]Geiza Cristina da Silva, Laura Bahiense, Luiz Satoru Ochi, Paulo Oswaldo Boaventura Netto:
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics. Comput. Oper. Res. 39(3): 671-677 (2012) - [j7]Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza:
The maximum common edge subgraph problem: A polyhedral investigation. Discret. Appl. Math. 160(18): 2523-2541 (2012) - 2010
- [j6]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) - [j5]Valdir Agustinho de Melo, Paulo Oswaldo Boaventura Netto, Peter Hahn, Laura Bahiense:
Graph isomorphism and QAP variances. Stud. Inform. Univ. 8(2): 209-234 (2010)
2000 – 2009
- 2009
- [j4]Gordana Manic, Laura Bahiense, Cid C. de Souza:
A branch&cut algorithm for the maximum common edge subgraph problem. Electron. Notes Discret. Math. 35: 47-52 (2009) - [j3]Laura Bahiense, Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives. Electron. Notes Discret. Math. 35: 347-352 (2009) - 2008
- [c1]Gordana Manic, Laura Bahiense, Cid C. de Souza:
On the Facial Structure of the Common Edge Subgraph polytope. CTW 2008: 62-65 - 2003
- [j2]Laura Bahiense, Francisco Barahona, Oscar Porto:
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. J. Comb. Optim. 7(3): 259-282 (2003) - 2002
- [j1]Laura Bahiense, Nelson Maculan, Claudia A. Sagastizábal:
The volume algorithm revisited: relation with bundle methods. Math. Program. 94(1): 41-69 (2002)
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-27 00:44 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:
