Percorrer por autor 515 Subscrever estatísticas do autor Autor

Índice: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

ou inserir as letras iniciais:  

Mostrar 1-20 de um total de 64 resultados.  próximo >
DataTítuloAutor(es)TipoAcesso
2022An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windowsRamos, Bruna; Alves, Cláudio; Valério de Carvalho, José ManuelArtigoAcesso restrito UMinho
2012An exact algorithm for bilevel 0-1 knapsack problemsMansi, Raid; Alves, Cláudio; Carvalho, J. M. Valério de, et al.ArtigoAcesso restrito UMinho
Dez-2016An exact approach based on a new pseudo-polynomial network flow model for integrated planning and schedulingRietz, Jurgen Endre; Alves, Cláudio; Braga, Nuno, et al.ArtigoAcesso restrito autor
2011An exact approach for the location routing problem with multiple routesMacedo, Rita; Alves, Cláudio; Carvalho, J. M. Valério deArtigo em ata de conferênciaAcesso restrito UMinho
Jun-2011An exact solution approach for a multi-follower bilevel optimization problemMansi, Raid; Alves, Cláudio; Carvalho, J. M. Valério de, et al.Artigo em ata de conferênciaAcesso restrito UMinho
2007An extended model and a column generation algorithm for the planar multicommodity flow problemAlvelos, Filipe Pereira e; Carvalho, J. M. Valério deArtigoAcesso restrito UMinho
2015An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhaulsPinto, Telmo; Alves, Cláudio; Carvalho, José Valério de, et al.ArtigoAcesso restrito autor
2010An integer programming model for two- and three-stage two-dimensional cutting stock problemsSilva, Elsa; Alvelos, Filipe Pereira e; Carvalho, J. M. Valério deArtigoAcesso restrito UMinho
Nov-2011An overview on recent approaches for vehicle routing problems with loading constraintsPinto, Telmo; Alves, Cláudio; Carvalho, J. M. Valério deArtigo em ata de conferênciaAcesso restrito UMinho
2022Arc flow formulations based on dynamic programming: theoretical foundations and applicationsLima, Vinícius L. de; Alves, Cláudio; Clautiaux, François, et al.ArtigoAcesso restrito UMinho
2016A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraintsPinto, Telmo; Alves, Cláudio; Valério de Carvalho, José ManuelArtigo em ata de conferênciaAcesso restrito UMinho
2008A branch-and-price-and-cut algorithm for the pattern minimization problemAlves, Cláudio; Valério de Carvalho, José ManuelArtigoAcesso aberto
2012A column generation approach for the bi-objective max-min knapsack problemAlves, Cláudio; Mansi, Raid; Pinto, Telmo, et al.Artigo em ata de conferênciaAcesso restrito UMinho
1-Fev-2018Column generation based approaches for combined routing and schedulingRamos, Bruna; Alves, Cláudio; Valério de Carvalho, José ManuelArtigoAcesso restrito UMinho
2013Column generation based heuristic for a vehicle routing problem with 2-dimensional loading constraints : a prototypePinto, Telmo; Alves, Cláudio; Carvalho, J. M. Valério deArtigo em ata de conferênciaAcesso restrito UMinho
1-Fev-2018Column generation based primal heuristics for routing and loading problemsPinto, Telmo; Alves, Cláudio; Valério de Carvalho, José ManuelArtigoAcesso restrito UMinho
2023A combinatorial flow-based formulation for temporal bin packing problemsMartinovic, J.; Strasdat, N.; Valério de Carvalho, José Manuel, et al.ArtigoAcesso restrito UMinho
2016Combined cutting stock and scheduling: a matheuristic approachBraga, Nuno; Alves, Cláudio; Macedo, Rita Alexandra Santos Gonçalves, et al.ArtigoAcesso restrito UMinho
2018A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problemsMartinovic, J.; Scheithauer, G.; Valério de Carvalho, José ManuelArtigoAcesso restrito UMinho
2010Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problemPimentel, Carina; Alvelos, Filipe Pereira e; Carvalho, J. M. Valério deArtigoAcesso restrito UMinho
Mostrar 1-20 de um total de 64 resultados.  próximo >