Reinaldo Morabito
Orcid: 0000-0002-3948-305XAffiliations:
- Federal University of São Carlos, SP, Brazil
According to our database1,
Reinaldo Morabito
authored at least 93 papers
between 1998 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on publons.com
-
on orcid.org
On csauthors.net:
Bibliography
2023
A hierarchical supply chain model for the sugar-alcohol energy sector with robust optimization analysis.
Int. Trans. Oper. Res., July, 2023
An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands.
Eur. J. Oper. Res., July, 2023
A location-transportation problem under demand uncertainty for a pharmaceutical network in Brazil.
Comput. Chem. Eng., June, 2023
Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks.
Int. J. Prod. Res., May, 2023
EURO J. Transp. Logist., 2023
Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem.
CoRR, 2023
2022
Model-based solution approach for a short-term flight rescheduling problem in aerial passenger transportation to maritime units.
Int. Trans. Oper. Res., 2022
Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations.
Int. J. Prod. Res., 2022
Integrated approaches for logistics network planning: a systematic literature review.
Int. J. Prod. Res., 2022
EURO J. Transp. Logist., 2022
Comput. Oper. Res., 2022
Time-dependent performance evaluation of tire repair emergency systems in the agricultural stage of sugarcane mills.
Comput. Electron. Agric., 2022
2021
A top-down cutting approach for modeling the constrained two- and three-dimensional guillotine cutting problems.
J. Oper. Res. Soc., 2021
Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm.
Expert Syst. Appl., 2021
2020
J. Oper. Res. Soc., 2020
Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern.
Int. Trans. Oper. Res., 2020
The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm.
Int. J. Prod. Res., 2020
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products.
Eur. J. Oper. Res., 2020
Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen.
Comput. Oper. Res., 2020
A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem.
Comput. Oper. Res., 2020
Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings.
Comput. Chem. Eng., 2020
Comput. Ind. Eng., 2020
Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems.
Ann. Oper. Res., 2020
2019
The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method.
Transp. Sci., 2019
Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings.
INFOR Inf. Syst. Oper. Res., 2019
Expert Syst. Appl., 2019
An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem.
Comput. Oper. Res., 2019
Central Eur. J. Oper. Res., 2019
Comput. Ind. Eng., 2019
2018
Optimizing multiship routing and scheduling with constraints on inventory levels in a Brazilian oil company.
Int. Trans. Oper. Res., 2018
Iterated local search and simulated annealing algorithms for the inventory routing problem.
Int. Trans. Oper. Res., 2018
Expert Syst. Appl., 2018
Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements.
Expert Syst. Appl., 2018
Eur. J. Oper. Res., 2018
Benders decomposition applied to a robust multiple allocation incomplete hub location problem.
Comput. Oper. Res., 2018
Comput. Oper. Res., 2018
Analyzing an emergency maintenance system in the agriculture stage of a Brazilian sugarcane mill using an approximate hypercube method.
Comput. Electron. Agric., 2018
2017
Oper. Res. Lett., 2017
Towards hypercube queuing models for dispatch policies with priority in queue and partial backup.
Comput. Oper. Res., 2017
2016
Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics.
Syst., 2016
MIP models for production lot sizing problems with distribution costs and cargo arrangement.
J. Oper. Res. Soc., 2016
Int. Trans. Oper. Res., 2016
The dynamic vehicle allocation problem with application in trucking companies in Brazil.
Comput. Oper. Res., 2016
Production and logistics planning in the tomato processing industry: A conceptual scheme and mathematical model.
Comput. Electron. Agric., 2016
Comput. Ind. Eng., 2016
2015
Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil.
Eur. J. Oper. Res., 2015
Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines.
Comput. Oper. Res., 2015
Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier.
Comput. Ind. Eng., 2015
2014
Scheduling of production and logistics operations of steam production systems in food industries: a case study of the tomato processing industry.
J. Oper. Res. Soc., 2014
MIP models for two-dimensional non-guillotine cutting problems with usable leftovers.
J. Oper. Res. Soc., 2014
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks.
Eur. J. Oper. Res., 2014
A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem.
Comput. Oper. Res., 2014
Comput. Ind. Eng., 2014
An optimization approach for the lot sizing and scheduling problem in the brewery industry.
Comput. Ind. Eng., 2014
2013
An optimization model for the vehicle routing problem with practical three-dimensional loading constraints.
Int. Trans. Oper. Res., 2013
2012
Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm.
J. Oper. Res. Soc., 2012
Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW.
Eur. J. Oper. Res., 2012
Three-dimensional container loading models with cargo stability and load bearing constraints.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
Ann. Oper. Res., 2012
A Memetic Framework for Solving the Lot Sizing and Scheduling Problem in Soft Drink Plants.
Proceedings of the Variants of Evolutionary Algorithms for Real-World Applications, 2012
2011
Erratum to: Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.
J. Sched., 2011
A Tabu search algorithm for solving the extended maximal availability location problem.
Int. Trans. Oper. Res., 2011
Application of network flow models for the cash management of an agribusiness company.
Comput. Ind. Eng., 2011
2010
Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.
J. Sched., 2010
An effective recursive partitioning approach for the packing of identical rectangles in a rectangle.
J. Oper. Res. Soc., 2010
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants.
Comput. Oper. Res., 2010
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem.
Ann. Oper. Res., 2010
2009
An optimization approach for ambulance location and the districting of the response segments on highways.
Eur. J. Oper. Res., 2009
Solution approaches for the soft drink integrated production lot sizing and scheduling problem.
Eur. J. Oper. Res., 2009
Comput. Ind. Eng., 2009
Combining Process Selection and lot sizing Models for Production Scheduling of Electrofused Grains.
Asia Pac. J. Oper. Res., 2009
An optimization model for the aggregate production planning of a Brazilian sugar and ethanol milling company.
Ann. Oper. Res., 2009
Ann. Oper. Res., 2009
2008
Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study.
Proceedings of the Metaheuristics for Scheduling in Industrial and Manufacturing Applications, 2008
Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems.
Int. Trans. Oper. Res., 2008
A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways.
Ann. Oper. Res., 2008
2007
Eur. J. Oper. Res., 2007
Analysis of ambulance decentralization in an urban emergency medical service using the hypercube queueing model.
Comput. Oper. Res., 2007
Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry.
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007
2006
Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem.
Comput. Oper. Res., 2006
2005
A note on an <i>L</i>-approach for solving the manufacturer's pallet loading problem.
J. Oper. Res. Soc., 2005
Towards unified formulations and extensions of two classical probabilistic location models.
Comput. Oper. Res., 2005
2003
An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces.
J. Oper. Res. Soc., 2003
Comput. Oper. Res., 2003
2002
Stud. Inform. Univ., 2002
An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container.
Eur. J. Oper. Res., 2002
2001
Analysing emergency medical service ambulance deployment on a Brazilian highway using the hypercube model.
J. Oper. Res. Soc., 2001
1998
A simple and effective recursive procedure for the manufacturer's pallet loading problem.
J. Oper. Res. Soc., 1998
Comput. Oper. Res., 1998