Franklina Maria Bragion Toledo

Orcid: 0000-0003-2823-7600

According to our database1, Franklina Maria Bragion Toledo authored at least 26 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery.
Eur. J. Oper. Res., 2024

2022
An expert system to react to defective areas in nesting problems.
Expert Syst. Appl., 2022

2021
An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery.
Comput. Oper. Res., 2021

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

2020
Irregular packing problems: A review of mathematical models.
Eur. J. Oper. Res., 2020

A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints.
Comput. Oper. Res., 2020

Integrating irregular strip packing and cutting path determination problems: A discrete exact approach.
Comput. Ind. Eng., 2020

2019
The production planning problem of orders in small foundries.
RAIRO Oper. Res., 2019

Exact approaches for the cutting path determination problem.
Comput. Oper. Res., 2019

2018
An innovative data structure to handle the geometry of nesting problems.
Int. J. Prod. Res., 2018

2017
A clique covering MIP model for the irregular strip packing problem.
Comput. Oper. Res., 2017

2016
Robust mixed-integer linear programming models for the irregular strip packing problem.
Eur. J. Oper. Res., 2016

2014
Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover.
J. Oper. Res. Soc., 2014

A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company.
Eur. J. Oper. Res., 2014

HOPS - Hamming-Oriented Partition Search for production planning in the spinning industry.
Eur. J. Oper. Res., 2014

2012
Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries.
J. Oper. Res. Soc., 2012

A knapsack problem as a tool to solve the production planning problem in small foundries.
Comput. Oper. Res., 2012

Semantic Wordification of Document Collections.
Comput. Graph. Forum, 2012

A hybrid heuristic for the k-medoids clustering problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2010
An approach for solving the lot-sizing problem of a market-driven foundry.
J. Oper. Res. Soc., 2010

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem.
Eur. J. Oper. Res., 2010

Investigation of a new GRASP-based clustering algorithm applied to biological data.
Comput. Oper. Res., 2010

2008
A Hybrid Heuristic for the Multi-Plant Capacitated Lot Sizing Problem With Setup Carry-Over.
J. Braz. Comput. Soc., 2008

A coupling cutting stock-lot sizing problem in the paper industry.
Ann. Oper. Res., 2008

Consensus Clustering Using Spectral Theory.
Proceedings of the Advances in Neuro-Information Processing, 15th International Conference, 2008

2006
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines.
Eur. J. Oper. Res., 2006


  Loading...