Laura Bahiense

From MaRDI portal
(Redirected from Person:496691)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time
International Transactions in Operational Research
2024-03-12Paper
Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem
Computers & Operations Research
2023-07-04Paper
Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions
European Journal of Operational Research
2021-11-09Paper
Using multiflow formulations to solve the Steiner tree problem in graphs
RAIRO - Operations Research
2021-07-27Paper
Multi-objective model for the problem of locating tows for incident servicing on expressways
Top
2021-05-05Paper
Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels
European Journal of Operational Research
2019-01-18Paper
Long-term integrated surgery room optimization and recovery ward planning, with a case study in the Brazilian national institute of traumatology and orthopedics (INTO)
European Journal of Operational Research
2017-11-23Paper
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
Discrete Applied Mathematics
2015-09-22Paper
A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
Electronic Notes in Discrete Mathematics
2013-07-19Paper
A branch \& cut algorithm for the maximum common edge subgraph problem
Electronic Notes in Discrete Mathematics
2013-07-19Paper
The maximum common edge subgraph problem: A polyhedral investigation
Discrete Applied Mathematics
2012-11-22Paper
The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
Computers & Operations Research
2012-11-15Paper
A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
Electronic Notes in Discrete Mathematics
2012-05-13Paper
Solving Steiner tree problems in graphs with Lagrangian relaxation
Journal of Combinatorial Optimization
2004-01-06Paper


Research outcomes over time


This page was built for person: Laura Bahiense