default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurício C. de Souza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j27]Guido Pantuza Jr., Maurício C. de Souza
:
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem. Int. Trans. Oper. Res. 29(2): 729-759 (2022)- 2021
- [j26]Fernanda F. Alves, Thiago Henrique Nogueira, Maurício C. de Souza, Martín Gómez Ravetti:
Approaches for the joint resolution of lot-sizing and scheduling with infeasibilities occurrences. Comput. Ind. Eng. 155: 107176 (2021) - [j25]Rui Sa Shibasaki, Mourad Baïou, Francisco Barahona, Philippe Mahey, Maurício C. de Souza:
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. Int. Trans. Oper. Res. 28(1): 296-326 (2021) - [j24]Natã Goulart da Silva, Thiago F. Noronha, Martín Gómez Ravetti, Maurício C. de Souza:
The integrated uncapacitated lot sizing and bin packing problem. RAIRO Oper. Res. 55(3): 1197-1212 (2021)
2010 – 2019
- 2019
- [j23]Irce F. G. Guimarães, Yassine Ouazene, Maurício C. de Souza, Farouk Yalaoui:
Flowshop scheduling problem with parallel semi-lines and final synchronization operation. Comput. Oper. Res. 108: 121-133 (2019) - 2017
- [j22]Gabriela N. Maschietto, Yassine Ouazene, Martín Gómez Ravetti, Maurício C. de Souza, Farouk Yalaoui:
Crane scheduling problem with non-interference constraints in a steel coil distribution centre. Int. J. Prod. Res. 55(6): 1607-1622 (2017) - 2016
- [j21]Christophe Duhamel, Philippe Mahey, Alexandre Xavier Martins, Rodney Rezende Saldanha, Maurício C. de Souza:
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR 14(2): 201-220 (2016) - [j20]Priscila M. Cota, Bárbara M. R. Gimenez, Dhiego P. M. Araújo, Thiago Henrique Nogueira, Maurício C. de Souza, Martín Gómez Ravetti:
Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre. Comput. Ind. Eng. 95: 135-143 (2016) - [j19]Maurício C. de Souza, Aloísio C. Gomes Jr., Allan M. C. Bretas, Martín Gómez Ravetti:
Models for scheduling charges in continuous casting: application to a Brazilian steel plant. Optim. Lett. 10(4): 667-683 (2016) - 2015
- [j18]Thiago Augusto de Oliveira Silva, Maurício C. de Souza, Rodney R. Saldanha, Edmund K. Burke:
Surgical scheduling with simultaneous employment of specialised human resources. Eur. J. Oper. Res. 245(3): 719-730 (2015) - 2014
- [j17]Reinaldo Morabito, Maurício C. de Souza, Mariana Vazquez:
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks. Eur. J. Oper. Res. 232(3): 618-629 (2014) - 2012
- [j16]Alexandre Xavier Martins, Christophe Duhamel, Philippe Mahey, Rodney Rezende Saldanha, Maurício C. de Souza:
Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput. Oper. Res. 39(9): 2133-2141 (2012) - [j15]Ana Maria de Almeida, Pedro Martins, Maurício C. de Souza:
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations. Int. Trans. Oper. Res. 19(3): 323-352 (2012) - [j14]Eduardo Uchoa, Túlio A. M. Toffolo, Maurício C. de Souza, Alexandre Xavier Martins, Ricardo Fukasawa:
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. Networks 59(1): 148-160 (2012) - [j13]Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. Networks 60(1): 1-18 (2012) - 2011
- [c2]Alexandre Xavier Martins, Christophe Duhamel, Maurício Cardoso de Souza, Rodney Rezende Saldanha, Philippe Mahey:
A VND-ILS Heuristic to Solve the RWA Problem. INOC 2011: 577-582 - 2010
- [j12]Ana Maria de Almeida, Pedro Martins, Maurício C. de Souza:
md-MST is NP-hard for d>=3. Electron. Notes Discret. Math. 36: 9-15 (2010) - [j11]Geraldo Robson Mateus, Martín Gómez Ravetti, Maurício C. de Souza, Taís M. Valeriano:
Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. J. Sched. 13(3): 245-259 (2010)
2000 – 2009
- 2009
- [j10]Pedro Martins, Maurício C. de Souza:
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. Comput. Oper. Res. 36(11): 2969-2982 (2009) - [j9]Alexandre Xavier Martins, Maurício C. de Souza, Marcone J. F. Souza, Túlio A. M. Toffolo:
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. J. Heuristics 15(2): 133-151 (2009) - 2008
- [j8]Alexandre Salles da Cunha, Maurício Cardoso de Souza:
Stronger upper and lower bounds for a hard batching problem to feed assembly lines. Electron. Notes Discret. Math. 30: 159-164 (2008) - [j7]Maurício C. de Souza, Carlos Roberto Venâncio de Carvalho, Wellington B. Brizon:
Packing items to feed assembly lines. Eur. J. Oper. Res. 184(2): 480-489 (2008) - [j6]Maurício C. de Souza, Pedro Martins:
Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. Eur. J. Oper. Res. 191(3): 677-690 (2008) - [j5]Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for a minimum arborescence problem. Networks 51(1): 34-47 (2008) - [j4]Maurício C. de Souza, Philippe Mahey, Bernard Gendron:
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. Networks 51(2): 133-141 (2008) - 2007
- [j3]Philippe Mahey, Maurício C. de Souza:
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. Oper. Res. Lett. 35(2): 221-226 (2007) - 2002
- [j2]Celso C. Ribeiro, Maurício C. de Souza:
Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discret. Appl. Math. 118(1-2): 43-54 (2002) - 2000
- [j1]Celso C. Ribeiro, Maurício C. de Souza:
Tabu search for the Steiner problem in graphs. Networks 36(2): 138-146 (2000)
1990 – 1999
- 1998
- [c1]Simone L. Martins, Celso C. Ribeiro, Maurício C. de Souza:
A Parallel GRASP for the Steiner Problem in Graphs. IRREGULAR 1998: 285-297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
