Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Túlio Ângelo Machado Toffolo"'
Publikováno v:
Computers & Operations Research. 109:12-27
Three-dimensional Cutting and Packing Problems consist of a set of items that must be placed inside one or more larger items (containers). Such problems enforce non-overlapping constraints which ensure that the smaller items being assigned must compl
Publikováno v:
Computers & Operations Research. 104:98-112
When applying periodic re-optimization for handling a dynamic scheduling problem, the objective of the problem solved in each period (its short term objective) significantly impacts the quality of final solutions (its long term solutions). Meanwhile,
Publikováno v:
Pesquisa Operacional para o Desenvolvimento. 11:127-138
O pacote Python-MIP oferece um conjunto abrangente de ferramentas para modelagem e resolucao de Problemas de Programacao Inteira Mista em Python. Alem de oferecer uma linguagem de modelagem de alto nivel, o pacote permite o desenvolvimento de metodos
Crane-operated warehouses constitute an essential asset for the many industries which must temporarily store products on their way from manufacturers to consumers. Such warehouses are a practical necessity rather than an explicitly desired service an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dffa98421317776994f06a8374304b1c
https://lirias.kuleuven.be/handle/123456789/632963
https://lirias.kuleuven.be/handle/123456789/632963
Autor:
Haroldo Gambini Santos, Greet Van den Berghe, Cristiano Luís Turbino de França e Silva, Túlio Ângelo Machado Toffolo
Publikováno v:
International Transactions in Operational Research. 26:707-724
This work addresses the unrelated parallel machine scheduling problem with sequence-dependent setup times, in which a set of jobs must be scheduled for execution by one of the several available machines. Each job has a machine-dependent processing ti
Autor:
Haroldo Gambini Santos, George H. G. Fonseca, Marcone Jamilson Freitas Souza, Samuel Souza Brito, Túlio Ângelo Machado Toffolo
Publikováno v:
Annals of Operations Research. 239:77-97
This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational insti
Autor:
Sabir Ribas, Haroldo Gambini Santos, Túlio Ângelo Machado Toffolo, Rafael Antonio Marques Gomes
Publikováno v:
Annals of Operations Research. 239:225-251
This work presents integer programming techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut gene
Publikováno v:
Repositório Institucional da UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
The Traveling Umpire Problem (TUP) is an optimization problem in which umpires have to be assigned to games in a double round robin tournament. The objective is to obtain a solution with minimum total travel distance over all umpires, while respectin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4336ac512888bc3d6191f508ce149b9e
http://www.repositorio.ufop.br/handle/123456789/7013
http://www.repositorio.ufop.br/handle/123456789/7013
Autor:
George H. G. Fonseca, Túlio Ângelo Machado Toffolo, Marcone Jamilson Freitas Souza, Haroldo Gambini Santos, Samuel Souza Brito
Publikováno v:
Repositório Institucional da UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Compet
Autor:
Túlio Ângelo Machado Toffolo, Alexandre Xavier Martins, Ricardo Fukasawa, Mauricio C. de Souza, Eduardo Uchoa
Publikováno v:
Repositório Institucional da UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
We propose algorithms to compute tight lower bounds and high quality upper bounds (UBs) for the multilevel capacitated minimum spanning tree problem. We first develop a branch-and-cut algorithm, introducing some new features: (i) the exact separation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb6e1ef4a71de1a33b322ce982564820
http://www.repositorio.ufop.br/handle/123456789/7176
http://www.repositorio.ufop.br/handle/123456789/7176