( en | de | ru )

 

Disambiguation of "de Souza, Maurício C."

Author of the publication

copydeleteadd this publication to your clipboard
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations.

, , and . Int. Trans. Oper. Res., 19 (3): 323-352 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Philippe De Souza

Maurício Aredes

Maurício Hunsche

Maurício Campos Porath

Ana Leticia /de Souza Vanz

 

Other publications of authors with the same name

md-MST is NP-hard for d>=3., , and . Electron. Notes Discret. Math., (2010)Flowshop scheduling problem with parallel semi-lines and final synchronization operation., , , and . Comput. Oper. Res., (2019)Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre., , , , , and . Comput. Ind. Eng., (2016)Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration., , , and . J. Sched., 13 (3): 245-259 (2010)Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem., and . Int. Trans. Oper. Res., 29 (2): 729-759 (2022)Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods., , , , and . Int. Trans. Oper. Res., 28 (1): 296-326 (2021)Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs., , and . Networks, 51 (2): 133-141 (2008)VNS and second order heuristics for the min-degree constrained minimum spanning tree problem., and . Comput. Oper. Res., 36 (11): 2969-2982 (2009)Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations., , and . Int. Trans. Oper. Res., 19 (3): 323-352 (2012)Local optimality conditions for multicommodity flow problems with separable piecewise convex costs., and . Oper. Res. Lett., 35 (2): 221-226 (2007)