Laura Bahiense

Orcid: 0000-0001-8175-8320

According to our database1, Laura Bahiense authored at least 25 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time.
Int. Trans. Oper. Res., July, 2024

2023
Metaheuristics with variable diversity control and neighborhood search for the Heterogeneous Site-Dependent Multi-depot Multi-trip Periodic Vehicle Routing Problem.
Comput. Oper. Res., May, 2023

Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2021
Using multiflow formulations to solve the Steiner tree problem in graphs.
RAIRO Oper. Res., 2021

A practical approach to support end-of-life commercial aircraft parking, market relocation, retirement and decommissioning strategic decisions.
Int. J. Prod. Res., 2021

Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions.
Eur. J. Oper. Res., 2021

2020
A progressive hybrid set covering based algorithm for the traffic counting location problem.
Expert Syst. Appl., 2020

Dimensionality reduction for multi-criteria problems: An application to the decommissioning of oil and gas installations.
Expert Syst. Appl., 2020

Optimisation and control of the supply of blood bags in hemotherapic centres via Markov decision process with discounted arrival rate.
Artif. Intell. Medicine, 2020

Mine-to-client planning with Markov Decision Process.
Proceedings of the 18th European Control Conference, 2020

2019
Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels.
Eur. J. Oper. Res., 2019

2018
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., 2018

2014
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.
Discret. Appl. Math., 2014

Logistics network planning for offshore air transport of oil rig crews.
Comput. Ind. Eng., 2014

2013
Scheduling a multi-product pipeline network.
Comput. Chem. Eng., 2013

2012
The maximum common edge subgraph problem: A polyhedral investigation.
Discret. Appl. Math., 2012

The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics.
Comput. Oper. Res., 2012

Planning and scheduling a fleet of rigs using simulation-optimization.
Comput. Ind. Eng., 2012

2010
Graph isomorphism and QAP variances.
Stud. Inform. Univ., 2010

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem.
Electron. Notes Discret. Math., 2010

2009
A branch&cut algorithm for the maximum common edge subgraph problem.
Electron. Notes Discret. Math., 2009

A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electron. Notes Discret. Math., 2009

2008
On the Facial Structure of the Common Edge Subgraph polytope.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2003
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation.
J. Comb. Optim., 2003

2002
The volume algorithm revisited: relation with bundle methods.
Math. Program., 2002


  Loading...