Alysson M. Costa

Orcid: 0000-0002-3135-793X

According to our database1, Alysson M. Costa authored at least 32 papers between 2002 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles.
Comput. Oper. Res., 2025

2024
Instance space analysis for 2D bin packing mathematical models.
Eur. J. Oper. Res., 2024

2022
Conserving workforce while temporarily rebalancing assembly lines under demand disruption.
Int. J. Prod. Res., 2022

The vehicle allocation problem: Alternative formulation and branch-and-price method.
Comput. Oper. Res., 2022

2021
A note to: A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem.
J. Intell. Manuf., 2021

Network scheduling problem with cross-docking and loading constraints.
Comput. Oper. Res., 2021

2020
Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems.
Eur. J. Oper. Res., 2020

2019
A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem.
Eur. J. Oper. Res., 2019

2018
Algorithms for the power-p Steiner tree problem in the Euclidean plane.
RITA, 2018

Improved integer programming models for simple assembly line balancing and related problems.
Int. Trans. Oper. Res., 2018

Parallel local search algorithms for high school timetabling problems.
Eur. J. Oper. Res., 2018

A sequential stochastic mixed integer programming model for tactical master surgery scheduling.
Eur. J. Oper. Res., 2018

2017
Using optimization to develop a "designer" environmental flow regime.
Environ. Model. Softw., 2017

The multi-objective assembly line worker integration and balancing problem of type-2.
Comput. Oper. Res., 2017

2016
Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption.
Environ. Model. Softw., 2016

2015
A hybrid path-relinking method for solving two-stage stochastic integer problems.
Int. Trans. Oper. Res., 2015

A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes.
Eur. J. Oper. Res., 2015

Model and heuristics for the Assembly Line Worker Integration and Balancing Problem.
Comput. Oper. Res., 2015

Robust assembly line balancing with heterogeneous workers.
Comput. Ind. Eng., 2015

2014
Influence of consumer purchasing behaviour on the production planning of perishable food.
OR Spectr., 2014

Sustainable vegetable crop supply problem with perishable stocks.
Ann. Oper. Res., 2014

2013
Balancing parallel assembly lines with disabled workers
CoRR, 2013

2012
Simple heuristics for the assembly line worker assignment and balancing problem.
J. Heuristics, 2012

2011
A comparison of formulations for the simple assembly line balancing problem
CoRR, 2011

2010
Operations research/management science tools for integrating people with disabilities into employment. A study on Valencia's Sheltered Work Centres for Disabled.
Int. Trans. Oper. Res., 2010

Sustainable vegetable crop supply problem.
Eur. J. Oper. Res., 2010

2009
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.
Networks, 2009

An integer linear programming approach for approximate string comparison.
Eur. J. Oper. Res., 2009

Benders, metric and cutset inequalities for multicommodity capacitated network design.
Comput. Optim. Appl., 2009

2008
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.
Eur. J. Oper. Res., 2008

2005
A survey on benders decomposition applied to fixed-charge network design problems.
Comput. Oper. Res., 2005

2002
Makespan minimization on parallel processors: an immune-based approach.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002


  Loading...