Maurício C. de Souza
Orcid: 0000-0001-6558-958X
According to our database1,
Maurício C. de Souza
authored at least 29 papers
between 1998 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem.
Int. Trans. Oper. Res., 2022
2021
RAIRO Oper. Res., 2021
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.
Int. Trans. Oper. Res., 2021
Approaches for the joint resolution of lot-sizing and scheduling with infeasibilities occurrences.
Comput. Ind. Eng., 2021
2019
Flowshop scheduling problem with parallel semi-lines and final synchronization operation.
Comput. Oper. Res., 2019
2017
Crane scheduling problem with non-interference constraints in a steel coil distribution centre.
Int. J. Prod. Res., 2017
2016
Models for scheduling charges in continuous casting: application to a Brazilian steel plant.
Optim. Lett., 2016
Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre.
Comput. Ind. Eng., 2016
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem.
4OR, 2016
2015
Eur. J. Oper. Res., 2015
2014
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks.
Eur. J. Oper. Res., 2014
2012
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem.
Networks, 2012
Models and heuristics for the <i>k</i> -degree constrained minimum spanning tree problem with node-degree costs.
Networks, 2012
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations.
Int. Trans. Oper. Res., 2012
Variable neighborhood descent with iterated local search for routing and wavelength assignment.
Comput. Oper. Res., 2012
2011
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration.
J. Sched., 2010
2009
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem.
J. Heuristics, 2009
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem.
Comput. Oper. Res., 2009
2008
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.
Networks, 2008
Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem.
Eur. J. Oper. Res., 2008
Electron. Notes Discret. Math., 2008
2007
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs.
Oper. Res. Lett., 2007
2002
Variable neighborhood search for the degree-constrained minimum spanning tree problem.
Discret. Appl. Math., 2002
2000
1998
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998