Pedro Munari
Orcid: 0000-0001-5929-593X
According to our database1,
Pedro Munari
authored at least 34 papers
between 2010 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm.
Comput. Oper. Res., October, 2023
Transp. Sci., September, 2023
An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands.
Eur. J. Oper. Res., July, 2023
2022
Production planning with parallel lines and limited batch splitting: Mathematical model and a case study in the white goods sector.
J. Oper. Res. Soc., 2022
Metaheuristic, models and software for the heterogeneous fleet pickup and delivery problem with split loads.
J. Comput. Sci., 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
A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service.
Eur. J. Oper. Res., 2022
Comput. Oper. Res., 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
A Branch-and-Cut Algorithm for Aircraft Routing with Crew Assignment for On-Demand Air Transportation.
Proceedings of the Computational Logistics - 12th International Conference, 2021
2020
A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows.
Oper. Res. Forum, 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
Decomposition-based algorithms for the crew scheduling and routing problem in road restoration.
Comput. Oper. Res., 2020
A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem.
Comput. Oper. Res., 2020
Comput. Ind. Eng., 2020
2019
The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method.
Transp. Sci., 2019
A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration.
Eur. J. Oper. Res., 2019
Central Eur. J. Oper. Res., 2019
2018
Iterated local search and simulated annealing algorithms for the inventory routing problem.
Int. Trans. Oper. Res., 2018
2017
Oper. Res. Lett., 2017
An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen.
Comput. Oper. Res., 2017
2016
Math. Program. Comput., 2016
2015
A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes.
Eur. J. Oper. Res., 2015
2013
Aspectos teóricos e computacionais para a melhoria do desempenho de métodos de otimização linear.
PhD thesis, 2013
Eur. J. Oper. Res., 2013
Using the primal-dual interior point algorithm within the branch-price-and-cut method.
Comput. Oper. Res., 2013
2011
Electron. Notes Discret. Math., 2011
2010