%% This BibTeX bibliography file was created using BibDesk.
%% https://bibdesk.sourceforge.io/

%% Created for Túlio Toffolo at 2019-12-15 21:21:39 -0300 


%% Saved with string encoding Unicode (UTF-8) 



@article{Castellucci2017,
	Author = {Pedro Belin Castellucci},
	Date-Modified = {2019-12-15 21:01:15 -0300},
	Doi = {10.4322/PODes.2017.005},
	Issn = {1984-3534},
	Issue = {2},
	Pages = {48--61},
	Title = {Julia e {JuMP}: Novas ferramentas para programa\c{c}\~{a}o matem\'{a}tica},
	Volume = {9},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.4322/PODes.2017.005}}

@article{Alfandari2010,
	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
	Doi = {10.1016/j.endm.2010.05.061},
	File = {::},
	Issn = {15710653},
	Journal = {Electronic Notes in Discrete Mathematics},
	Keywords = {alarme processing, approximation, integer programming, maximal coverage, np-hardness, set covering},
	Mendeley-Tags = {alarme processing},
	Month = {aug},
	Pages = {479--485},
	Title = {{Approximation of the Clustered Set Covering Problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624 http://www.sciencedirect.com/science/article/pii/S1571065310000624},
	Volume = {36},
	Year = {2010},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624%20http://www.sciencedirect.com/science/article/pii/S1571065310000624},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.endm.2010.05.061}}

@article{Monaci2006,
	Author = {Monaci, Michele and Toth, Paolo},
	Doi = {10.1287/ijoc.1040.0089},
	File = {::},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {column genera-, heuristics, set-covering, tion, two-constraint bin packing, two-dimensional bin packing},
	Month = {jan},
	Number = {1},
	Pages = {71--85},
	Title = {{A set-covering-based heuristic approach for bin-packing problems}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1040.0089 http://joc.journal.informs.org/content/18/1/71.short},
	Volume = {18},
	Year = {2006},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1040.0089%20http://joc.journal.informs.org/content/18/1/71.short},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1040.0089}}

@article{Sapkota2011,
	Author = {Sapkota, Nabin and Reilly, Charles H.},
	Doi = {10.1016/j.cie.2011.02.008},
	File = {::},
	Issn = {03608352},
	Journal = {Computers {\&} Industrial Engineering},
	Keywords = {explicit correlation induction, karush, kuhn, set covering problem, tucker conditions},
	Month = {aug},
	Number = {1},
	Pages = {39--47},
	Publisher = {Elsevier Ltd},
	Title = {{Simulating realistic set covering problems with known optimal solutions}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
	Volume = {61},
	Year = {2011},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cie.2011.02.008}}

@article{Beasley1987,
	Author = {Beasley, J.E.},
	Doi = {10.1016/0377-2217(87)90141-X},
	File = {::},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {optimisation, set covering},
	Month = {jul},
	Number = {1},
	Pages = {85--93},
	Title = {{An algorithm for set covering problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
	Volume = {31},
	Year = {1987},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
	Bdsk-Url-2 = {https://doi.org/10.1016/0377-2217(87)90141-X}}

@book{Finger2002,
	Author = {Finger, Markus and St{\"u}tzle, T and Louren{\c c}o, H},
	File = {::},
	Pages = {61--71},
	Title = {{Exploiting fitness distance correlation of set covering problems}},
	Url = {http://link.springer.com/chapter/10.1007/3-540-46004-7{\_}7},
	Year = {2002},
	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/3-540-46004-7%7B%5C_%7D7}}

@article{Bilal2014,
	Author = {Bilal, Nehme and Galinier, Philippe and Guibault, Francois},
	Doi = {10.1007/s10732-013-9235-9},
	File = {::},
	Isbn = {1073201392},
	Issn = {1381-1231},
	Journal = {Journal of Heuristics},
	Keywords = {hybrid heuristics, iterated local search, partial covering, profit maximization, set covering, tabu search},
	Month = {jan},
	Number = {2},
	Pages = {143--164},
	Title = {{An iterated-tabu-search heuristic for a variant of the partial set covering problem}},
	Url = {http://link.springer.com/10.1007/s10732-013-9235-9 http://link.springer.com/article/10.1007/s10732-013-9235-9},
	Volume = {20},
	Year = {2014},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-013-9235-9%20http://link.springer.com/article/10.1007/s10732-013-9235-9},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-013-9235-9}}

@article{Muter2010,
	Author = {Muter, I. and Birbil, S. I. and Sahin, G.},
	Doi = {10.1287/ijoc.1090.0376},
	File = {::},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {2008, 2010, 23, accepted by david woodruff, accepted november 2009, area editor for heuristic, articles in advance march, combinatorial optimization, heuristics, history, local search, november 2009, published online in, received november, revised april 2009, search and learning, september 2009, tabu search, vehicle routing},
	Month = {mar},
	Number = {4},
	Pages = {603--619},
	Title = {{Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
	Volume = {22},
	Year = {2010},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1090.0376}}

@article{Fritzen2012,
	Author = {Fritzen, Paulo C{\'\i}cero and Zauk, Jo{\~a}o Montagner and Cardoso, Ghendy and Oliveira, A{\'e}cio De Lima and de Ara{\'u}jo, Olinto C{\'e}sar Bassi},
	Doi = {10.1016/j.epsr.2012.04.002},
	File = {::},
	Issn = {03787796},
	Journal = {Electric Power Systems Research},
	Month = {sep},
	Pages = {55--66},
	Publisher = {Elsevier B.V.},
	Title = {{Hybrid system based on constructive heuristic and integer programming for the solution of problems of fault section estimation and alarm processing in power systems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
	Volume = {90},
	Year = {2012},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.epsr.2012.04.002}}

@article{Parragh2013,
	Abstract = {Demographic change towards an ever aging population entails an increasing demand for specialized transportation systems to complement the traditional public means of transportation. Typically, users place transportation requests, specifying a pickup and a drop off location and a fleet of minibuses or taxis is used to serve these requests. The underlying optimization problem can be modeled as a dial-a-ride problem. In the dial-a-ride problem considered in this paper, total routing costs are minimized while respecting time window, maximum user ride time, maximum route duration, and vehicle capacity restrictions. We propose a hybrid column generation and large neighborhood search algorithm and compare different hybridization strategies on a set of benchmark instances from the literature.},
	Author = {Parragh, Sophie N and Schmid, Verena},
	Doi = {10.1016/j.cor.2012.08.004},
	File = {::},
	Issn = {0305-0548},
	Journal = {Computers {\&} operations research},
	Keywords = {Column generation, Dial-a-ride problem, Hybrid algorithm, Variable neighborhood search, large neighborhood search},
	Month = {jan},
	Number = {1},
	Pages = {490--497},
	Pmid = {23471127},
	Publisher = {Elsevier},
	Title = {{Hybrid column generation and large neighborhood search for the dial-a-ride problem.}},
	Url = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368{\&}tool=pmcentrez{\&}rendertype=abstract},
	Volume = {40},
	Year = {2013},
	Bdsk-Url-1 = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368%7B%5C&%7Dtool=pmcentrez%7B%5C&%7Drendertype=abstract},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2012.08.004}}

@article{Caprara2000,
	Author = {Caprara, Alberto and Toth, Paolo and Fischetti, M},
	File = {::},
	Journal = {Annals of Operations Research},
	Pages = {353--371},
	Title = {{Algorithms for the set covering problem}},
	Url = {http://link.springer.com/article/10.1023/A:1019225027893},
	Year = {2000},
	Bdsk-Url-1 = {http://link.springer.com/article/10.1023/A:1019225027893}}

@article{Fleszar2011,
	Author = {Fleszar, Krzysztof and Charalambous, Christoforos and Hindi, Khalil S.},
	Doi = {10.1007/s10845-011-0522-8},
	File = {::},
	Issn = {0956-5515},
	Journal = {Journal of Intelligent Manufacturing},
	Keywords = {hybrid optimization, makespan minimization, mip neighborhood, mixed-integer programming, neighborhood search, parallel machine, parallel machine scheduling},
	Mendeley-Tags = {mip neighborhood,parallel machine},
	Month = {mar},
	Number = {5},
	Pages = {1949--1958},
	Title = {{A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times}},
	Url = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
	Volume = {23},
	Year = {2011},
	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-011-0522-8}}

@article{Smith-Miles2012,
	Author = {Smith-Miles, Kate and Lopes, Leo},
	Doi = {10.1016/j.cor.2011.07.006},
	File = {::},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {Algorithm selection, Assignment problem, Bin-packing, Combinatorial optimization, Graph coloring, Hardness prediction, Instance difficulty, Knapsack problem, Landscape analysis, Phase transition, Timetabling, Traveling salesman problem, testing},
	Mendeley-Tags = {testing},
	Month = {may},
	Number = {5},
	Pages = {875--889},
	Publisher = {Elsevier},
	Title = {{Measuring instance difficulty for combinatorial optimization problems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
	Volume = {39},
	Year = {2012},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2011.07.006}}

@article{Pereira2011,
	Author = {Pereira, Jordi and Averbakh, Igor},
	Doi = {10.1007/s10479-011-0876-5},
	File = {::},
	Issn = {0254-5330},
	Journal = {Annals of Operations Research},
	Keywords = {benders decomposition, branch-and-cut, combinatorial optimization, genetic algorithms, heuristics, minmax regret, optimization, set covering problem},
	Month = {mar},
	Number = {1},
	Pages = {217--235},
	Title = {{The robust set covering problem with interval data}},
	Url = {http://link.springer.com/10.1007/s10479-011-0876-5 http://link.springer.com/article/10.1007/s10479-011-0876-5},
	Volume = {207},
	Year = {2011},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10479-011-0876-5%20http://link.springer.com/article/10.1007/s10479-011-0876-5},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-011-0876-5}}

@article{Kodali2013,
	Author = {Kodali, Anuradha and Singh, Satnam and Pattipati, Krishna},
	Doi = {10.1109/TSMCA.2012.2208101},
	File = {::},
	Issn = {2168-2216},
	Journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
	Month = {may},
	Number = {3},
	Pages = {547--562},
	Title = {{Dynamic Set-Covering for Real-Time Multiple Fault Diagnosis With Delayed Test Outcomes}},
	Url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
	Volume = {43},
	Year = {2013},
	Bdsk-Url-1 = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
	Bdsk-Url-2 = {https://doi.org/10.1109/TSMCA.2012.2208101}}

@article{Gutin2000,
	Author = {Gutin, G and Zverovich, A},
	File = {::},
	Journal = {submitted for publication},
	Title = {{Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP}},
	Url = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf},
	Year = {2000},
	Bdsk-Url-1 = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf}}

@article{Santos2013,
	Author = {Santos, Dorabella and de Sousa, Amaro and Alvelos, Filipe},
	Doi = {10.1016/j.cor.2013.05.006},
	File = {::},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {Column generation, Hybrid meta-heuristics, Network load balancing, grasp with path relinking},
	Month = {may},
	Pages = {1--12},
	Publisher = {Elsevier},
	Title = {{A hybrid column generation with GRASP and path relinking for the network load balancing problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
	Year = {2013},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2013.05.006}}

@article{Boschetti2007,
	Author = {Boschetti, Marco and Maniezzo, Vittorio},
	Doi = {10.1007/s10732-007-9064-9},
	File = {::},
	Issn = {1381-1231},
	Journal = {Journal of Heuristics},
	Keywords = {benders, combinatorial optimization, decomposition, lagrangean relaxation, metaheuristic, s},
	Month = {oct},
	Number = {3},
	Pages = {283--312},
	Title = {{Benders decomposition, Lagrangean relaxation and metaheuristic design}},
	Url = {http://link.springer.com/10.1007/s10732-007-9064-9},
	Volume = {15},
	Year = {2007},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-007-9064-9},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-007-9064-9}}

@article{Alfandari2014,
	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
	Doi = {10.1016/j.dam.2011.11.030},
	File = {::},
	Issn = {0166218X},
	Journal = {Discrete Applied Mathematics},
	Month = {feb},
	Pages = {13--19},
	Title = {{A note on the Clustered Set Covering Problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
	Volume = {164},
	Year = {2014},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.dam.2011.11.030}}

@article{Vallada2011a,
	Author = {Vallada, Eva and Ruiz, Rub{\'e}n},
	Doi = {10.1016/j.ejor.2011.01.011},
	File = {::},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Month = {jun},
	Number = {3},
	Pages = {612--622},
	Publisher = {Elsevier B.V.},
	Title = {{A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
	Volume = {211},
	Year = {2011},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2011.01.011}}

@article{Yelbay2012,
	Author = {Yelbay, Belma and Birbil, {\c S}{\.I} and B{\"u}lb{\"u}l, K},
	File = {::},
	Journal = {{\ldots} Operational Research},
	Keywords = {dual information, heuristics, lp relaxation, primal-dual heuristic, set covering},
	Title = {{The set covering problem revisited: an empirical study of the value of dual information}},
	Url = {http://research.sabanciuniv.edu/19359/},
	Year = {2012},
	Bdsk-Url-1 = {http://research.sabanciuniv.edu/19359/}}

@article{Lan2007,
	Author = {Lan, Guanghui and DePuy, Gail W. and Whitehouse, Gary E.},
	Doi = {10.1016/j.ejor.2005.09.028},
	File = {::},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {combinatorial optimization, meta-raps, set covering},
	Month = {feb},
	Number = {3},
	Pages = {1387--1403},
	Title = {{An effective and simple heuristic for the set covering problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
	Volume = {176},
	Year = {2007},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2005.09.028}}

@article{Arnaout2009,
	Author = {Arnaout, Jean-Paul and Rabadi, Ghaith and Musa, Rami},
	Doi = {10.1007/s10845-009-0246-1},
	File = {::},
	Issn = {0956-5515},
	Journal = {Journal of Intelligent Manufacturing},
	Keywords = {ant colony optimization, introduction and problem statement, scheduling, scheduling of n, sequence-dependent setup times, the problem addressed in, this paper is the, unrelated parallel machine},
	Month = {feb},
	Number = {6},
	Pages = {693--701},
	Title = {{A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times}},
	Url = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
	Volume = {21},
	Year = {2009},
	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-009-0246-1}}

@article{Glover2001,
	Author = {Glover, Fred and Gutin, Gregory and Yeo, Anders and Zverovich, Alexey},
	Doi = {10.1016/S0377-2217(99)00468-3},
	File = {::},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {construction heuristics, heuristics, traveling salesman},
	Month = {mar},
	Number = {3},
	Pages = {555--568},
	Title = {{Construction heuristics for the asymmetric TSP}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
	Volume = {129},
	Year = {2001},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0377-2217(99)00468-3}}

@article{Jonker1987,
	Author = {Jonker, R and Volgenant, A},
	File = {::},
	Journal = {Computing},
	Keywords = {alternierenden wegen fiir dichte, das lineare zuordnungsproblem, ein algorithmus mit kiirzesten, eine spezielle implementierung der, entwickeln einen algorithmus mit, er enthfilt neue routinen, fiir die anfangswerte und, kiirzesten alternierenden wegen ffir, kiirzesten-, linear assignment problem, pascal implementation, shortest path methods, und diinne zuordnungsprobleme, wir},
	Pages = {325--340},
	Title = {{A shortest augmenting path algorithm for dense and sparse linear assignment problems}},
	Url = {http://www.springerlink.com/index/7003M6N54004M004.pdf},
	Volume = {340},
	Year = {1987},
	Bdsk-Url-1 = {http://www.springerlink.com/index/7003M6N54004M004.pdf}}

@article{Frangioni2005,
	Author = {Frangioni, Antonio},
	File = {::},
	Journal = {Annals of Operations Research},
	Keywords = {integer linear programs, lagrangian dual},
	Pages = {163--193},
	Title = {{About Lagrangian methods in integer optimization}},
	Url = {http://link.springer.com/article/10.1007/s10479-005-3447-9},
	Year = {2005},
	Bdsk-Url-1 = {http://link.springer.com/article/10.1007/s10479-005-3447-9}}

@article{Yagiura2006,
	Author = {Yagiura, Mutsunori and Kishida, Masahiro and Ibaraki, Toshihide},
	Doi = {10.1016/j.ejor.2004.10.018},
	File = {::},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {lagrangian relaxation, large neighborhood, metaheuristics, set covering problem, strategic oscillation},
	Month = {jul},
	Number = {2},
	Pages = {472--499},
	Title = {{A 3-flip neighborhood local search for the set covering problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
	Volume = {172},
	Year = {2006},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2004.10.018}}

@article{Alvelos2013,
	Author = {Alvelos, Filipe and Sousa, Amaro De and Santos, Dorabella},
	File = {::},
	Journal = {Hybrid Metaheuristics},
	Pages = {1--50},
	Title = {{Combining column generation and metaheuristics}},
	Url = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6{\_}11},
	Year = {2013},
	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6%7B%5C_%7D11}}

@article{Letchford2002,
	Abstract = {Chv{\'a}tal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditive functions or disjunctive techniques. We present a new and surprisingly simple strengthening procedure, discuss its properties, and present some computational results. {\copyright} 2002 Elsevier Science B.V. All rights reserved.},
	Author = {Letchford, Adam N. and Lodi, Andrea},
	Doi = {10.1016/S0167-6377(02)00112-8},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Letchford, Lodi - 2002 - Strengthening Chv{\'{a}}tal-Gomory cuts and Gomory fractional cuts.pdf:pdf},
	Issn = {01676377},
	Journal = {Operations Research Letters},
	Keywords = {Cutting planes, Integer programming, Valid inequalities},
	Number = {2},
	Pages = {74--82},
	Title = {{Strengthening Chv{\'a}tal-Gomory cuts and Gomory fractional cuts}},
	Volume = {30},
	Year = {2002},
	Bdsk-Url-1 = {https://doi.org/10.1016/S0167-6377(02)00112-8}}

@article{J??nger2010,
	Abstract = {Abstract This paper has always been one of my favorite ``children,'' combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to tell the story of its origin.$\backslash$n},
	Archiveprefix = {arXiv},
	Arxivid = {arXiv:1011.1669v3},
	Author = {J??nger, Michael and Naddef, Denis and Pulleyblank, William R. and Rinaldi, Giovanni and Liebling, Thomas M. and Nemhauser, George L. and Reinelt, Gerhard and Wolsey, Laurence A.},
	Doi = {10.1007/978-3-540-68279-0},
	Eprint = {arXiv:1011.1669v3},
	File = {::},
	Isbn = {9783540682745},
	Issn = {0894069X},
	Journal = {50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art},
	Pages = {1--804},
	Pmid = {15890271},
	Title = {{Outline of an Algorithm for Integer Solutions to Linear Programs}},
	Year = {2010},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-540-68279-0}}

@article{Andreello2007,
	Author = {Andreello, G. and Caprara, A. and Fischetti, M.},
	Doi = {10.1287/ijoc.1050.0162},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Andreello, Caprara, Fischetti - 2007 - Embedding {\{}0,12{\}}-Cuts in a Branch-and-Cut Framework A Computational Study.pdf:pdf},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {accepted by william j, accepted july 2005, algorithms, and analysis of algorithms, applications, area editor for design, cook, cutting plane, history, integer, programming, received may 2004, revised january 2005},
	Month = {jan},
	Number = {2},
	Pages = {229--238},
	Title = {{Embedding {\{}0,1/2{\}}-Cuts in a Branch-and-Cut Framework: A Computational Study}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
	Volume = {19},
	Year = {2007},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1050.0162}}

@article{Fischetti2007a,
	Author = {Fischetti, Matteo and Lodi, Andrea},
	Doi = {10.1007/s00373-007-0711-6},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - MIPping closures An instant survey.pdf:pdf},
	Issn = {09110119},
	Journal = {Graphs and Combinatorics},
	Keywords = {Cutting plane methods, Mixed integer programs, Separation problems},
	Number = {SUPPL. 1},
	Pages = {233--243},
	Title = {{MIPping closures: An instant survey}},
	Volume = {23},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1007/s00373-007-0711-6}}

@article{Fischetti2007,
	Author = {Fischetti, M. and Lodi, A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - Optimizing over the first Chv{\`{a}}tal closure.pdf:pdf},
	Journal = {Mathematical Programming B},
	Number = {1},
	Pages = {3--20},
	Title = {{Optimizing over the first Chv{\`a}tal closure}},
	Volume = {110},
	Year = {2007}}

@article{Camerini2006,
	Author = {Camerini, P. M. and Fratta, L. and Maffioli, F.},
	Journal = {Networks},
	Month = {oct},
	Number = {4},
	Pages = {309--312},
	Title = {{A note on finding optimum branchings}},
	Volume = {9},
	Year = {2006}}

@inproceedings{Bresina1996,
	Annote = {From Duplicate 1 (Heuristic-Biased Stochastic Sampling - Bresina, J.L.) NULL From Duplicate 2 (Heuristic-Biased Stochastic Sampling - Bresina, J.L. L; Bresina, L) From Duplicate 2 (Heuristic-Biased Stochastic Sampling - Bresina, J.L. L; Bresina, L) From Duplicate 1 ( Heuristic-Biased Stochastic Sampling - Bresina, J.L.; Bresina, L ) From Duplicate 2 ( Heuristic-Biased Stochastic Sampling - Bresina, J.L. ) From Duplicate 2 ( Heuristic Biased Stochastic Sampling - Bresina, L ) And Duplicate 3 ( Heuristic-Biased Stochastic Sampling - Bresina, J.L. ) And Duplicate 4 ( Heuristic-Biased Stochastic Sampling - Bresina, J L ) },
	Author = {Bresina, J.L. L and Bresina, L},
	Booktitle = {{AAAI-96 Proceedings}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bresina - 1996 - Heuristic-Biased Stochastic Sampling.pdf:pdf},
	Pages = {271--278},
	Title = {{Heuristic-Biased Stochastic Sampling}},
	Year = {1996}}

@incollection{Goltz1998,
	Author = {Goltz, HJ. and Matzke, D.},
	Publisher = {Springer Berlin},
	Title = {{University Timetabling Using Constraint Logic Programming}},
	Year = {1998}}

@article{pythonEconomist2018,
	Author = {{{The Economist}}},
	Date-Modified = {2019-12-15 21:21:39 -0300},
	Journal = {The Economist Group Limited, London 1969},
	Title = {{Python is becoming the world's most popular coding language}},
	Year = {2018},
	Volume = {Daily chart of 26/07/2018},
	Bdsk-Url-1 = {https://www.economist.com/graphic-detail/2018/07/26/python-is-becoming-the-worlds-most-popular-coding-language}}

@article{Kececioglu2000,
	Abstract = {We study two new problems in sequence alignment both from a practical and a theoretical view, using tools from combinatorial optimization to develop branch-and-cut algorithms. The generalized maximum trace formulation captures several forms of multiple sequence alignment problems in a common framework, among them the original formulation of maximum trace. The RNA sequence alignment problem captures the comparison of RNA molecules on the basis of their primary sequence and their secondary structure. Both problems have a characterization in terms of graphs which we reformulate in terms of integer linear programming. We then study the polytopes (or convex hulls of all feasible solutions) associated with the integer linear program for both problems. For each polytope we derive several classes of facet-defining inequalities and show that for some of these classes the corresponding separation problem can be solved in polynomial time. This leads to a polynomial-time algorithm for pairwise sequence alignment that is not based on dynamic programming. Moreover, for multiple sequences the branch-and-cut algorithms for both sequence alignment problems are able to solve to optimality instances that are beyond the range of present dynamic programming approaches.},
	Author = {Kececioglu, John D. and Lenhof, Hans-Peter and Mehlhorn, Kurt and Mutzel, Petra and Reinert, Knut and Vingron, Martin},
	Doi = {10.1016/S0166-218X(00)00194-3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kececioglu et al. - 2000 - A polyhedral approach to sequence alignment problems.pdf:pdf},
	Issn = {0166218X},
	Journal = {Discrete Applied Mathematics},
	Keywords = {Branch-and-cut, Combinatorial optimization, Computational biology, Multiple sequence alignment, RNA sequence alignment},
	Number = {1-3},
	Pages = {143--186},
	Title = {{A polyhedral approach to sequence alignment problems}},
	Url = {http://www.sciencedirect.com/science/article/pii/S0166218X00001943},
	Volume = {104},
	Year = {2000},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0166218X00001943},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0166-218X(00)00194-3}}

@article{Blum2016,
	Abstract = {This paper describes a general hybrid metaheuristic for combinatorial optimization labelled Construct, Merge, Solve {\&} Adapt. The proposed algorithm is a specific instantiation of a framework known from the literature as Generate-And-Solve, which is based on the following general idea. First, generate a reduced sub-instance of the original problem instance, in a way such that a solution to the sub-instance is also a solution to the original problem instance. Second, apply an exact solver to the reduced sub-instance in order to obtain a (possibly) high quality solution to the original problem instance. And third, make use of the results of the exact solver as feedback for the next algorithm iteration. The minimum common string partition problem and the minimum covering arborescence problem are chosen as test cases in order to demonstrate the application of the proposed algorithm. The obtained results show that the algorithm is competitive with the exact solver for small to medium size problem instances, while it significantly outperforms the exact solver for larger problem instances.},
	Author = {Blum, Christian and Pinacho, Pedro and L{\'o}pez-Ib{\'a}{\~n}ez, Manuel and Lozano, Jos{\'e} A.},
	Doi = {10.1016/j.cor.2015.10.014},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Blum et al. - 2016 - Construct, Merge, Solve {\&} Adapt A new general algorithm for combinatorial optimization.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers and Operations Research},
	Keywords = {Exact solver, Hybrid algorithms, Metaheuristics, Minimum common string partition, Minimum covering arborescence},
	Pages = {75--88},
	Publisher = {Elsevier},
	Title = {{Construct, Merge, Solve {\&} Adapt A new general algorithm for combinatorial optimization}},
	Url = {http://dx.doi.org/10.1016/j.cor.2015.10.014},
	Volume = {68},
	Year = {2016},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.cor.2015.10.014}}

@article{Bertsimas2004,
	Abstract = {A robust approach to solving linear optimization problems with uncertain data has been proposed in the early 1970s, and has recently been extensively studied and extended. Under this approach, we are willing to accept a suboptimal solution for the nominal values of the data, in order to ensure that the solution remains feasible and near optimal when the data changes. A concern with such an approach is that it might be too conservative. In this paper we propose an approach that attempts to make this tradeoff more attractive, that is we investigate ways to decrease what we call the price of robustness. In particular, we flexibly adjust the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations. An attractive aspect of our method is that the new robust formulation is also a linear optimization problem. We thus naturally extend our methods to discrete optimization problems in a tractable way. We report numerical results for a portfolio optimization problem, a knapsack problem, and a problem from the Net Lib library.},
	Author = {Bertsimas, D. and Sim, M.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bertsimas, Sim - 2004 - The Price of Robustness.pdf:pdf},
	Isbn = {0030-364X},
	Issn = {0030-364X},
	Journal = {Operations Research},
	Number = {1},
	Pages = {35--53},
	Title = {{The Price of Robustness}},
	Volume = {52},
	Year = {2004}}

@article{Dantzig1960,
	Author = {Dantzig, G. B. and Wolfe, P.},
	Journal = {Operations Research},
	Number = {1},
	Pages = {101--111},
	Title = {{Decomposition Principle for Linear Programs}},
	Volume = {8},
	Year = {1960}}

@article{Mendez-Diaz2008,
	Author = {M{\'e}ndez-D{\'\i}az, I. and Zabala, P.},
	Journal = {Discrete Applied Mathematics},
	Pages = {159--179},
	Title = {{A cutting plane algorithm for graph coloring}},
	Volume = {156},
	Year = {2008}}

@phdthesis{Souza2000a,
	Address = {Rio de Janeiro, Brasil},
	Author = {Souza, M.J.F.},
	Title = {{School Timetabling: An Approximation by Metaheuristics (in portuguese)}},
	Year = {2000}}

@inproceedings{Hansen1986,
	Address = {Capri, Italy},
	Author = {Hansen, P.},
	Title = {{The steepest ascent mildest descent heuristic for combinatorial programming}},
	Year = {1986}}

@article{Glover2000,
	Author = {Glover, F. and Laguna, M. and Mart{\'\i}, R.},
	Journal = {Control and Cybernetics},
	Number = {3},
	Pages = {653--684},
	Title = {{Fundamentals of Scatter Search and Path Relinking}},
	Volume = {39},
	Year = {2000}}

@misc{Kendal2013,
	Author = {Kendal, Graham and McCollum, Barry and Berghe, Greet Vanden},
	Title = {{MISTA 2013 Challenge: Qualification results}},
	Url = {http://allserv.kahosl.be/mista2013challenge/results.html},
	Year = {2013},
	Bdsk-Url-1 = {http://allserv.kahosl.be/mista2013challenge/results.html}}

@incollection{Papatheocharous2009,
	Abstract = {Over the years, software cost estimation through sizing has led to the development of various estimating practices. Despite the uniqueness and unpredictability of the software processes, people involved in project resource management have always been striving for acquiring reliable and accurate software cost estimations. The difficulty of finding a concise set of factors affecting productivity is amplified due to the dependence on the nature of products, the people working on the project and the cultural environment in which software is built and thus effort estimations are still considered a challenge. This paper aims to provide size- and effort-based cost estimations required for the development of new software projects utilising data obtained from previously completed projects. The modelling approach employs different Artificial Neural Network (ANN) topologies and input/output schemes selected heuristically, which target at capturing the dynamics of cost behavior as this is expressed by the available data attributes. The ANNs are enhanced by a Genetic Algorithm (GA) whose role is to evolve the network architectures (both input and internal hidden layers) by reducing the Mean Relative Error (MRE) produced by the output results of each network. {\copyright} 2009 Springer Berlin Heidelberg.},
	Annote = {From Duplicate 1 (Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search - Haddad, Matheus N; Cota, Luciano P; Souza, Marcone J F; Maculan, Nelson) NULL},
	Author = {Haddad, Matheus N. and Cota, Luciano P. and Souza, Marcone J.F. F and Maculan, Nelson},
	Booktitle = {{Lecture Notes in Business Information Processing}},
	Doi = {10.1007/978-3-642-00670-8},
	Editor = {Cordeiro, Jos{\'e} and Hammoudi, Slimane and Maciaszek, Leszek and Camp, Olivier and Filipe, Joaquim},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Haddad et al. - 2015 - Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Itera.pdf:pdf},
	Isbn = {978-3-642-00669-2},
	Issn = {18651348},
	Keywords = {Artificial neural networks, Genetic algorithms, Software cost estimation},
	Pages = {131--148},
	Publisher = {Springer},
	Title = {{Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search}},
	Url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-64549085386{\%}7B{\&}{\%}7DpartnerID=tZOtx3y1 http://www.scopus.com/inward/record.url?eid=2-s2.0-64549085386{\&}partnerID=tZOtx3y1},
	Volume = {227},
	Year = {2015},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-00670-8}}

@article{Neumann2017,
	Author = {Neumann, Christoph and Stein, Oliver and Nathan, Sudermann-Merx},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Neumann, Stein, Nathan - 2017 - A feasible rounding approach for mixed-integer optimization problems.pdf:pdf},
	Keywords = {2000, 2017, 90c10, 90c11, consistency, granularity, inner parallel set, mathematics subject classification, preliminary citation optimization online, preprint id 2017-12-6367, rounding},
	Title = {{A feasible rounding approach for mixed-integer optimization problems}},
	Year = {2017}}

@article{Polat2007,
	Abstract = {The aim of this study is to detect epileptic seizure in EEG signals using a hybrid system based on decision tree classifier and fast Fourier transform (FFT). The present study proposes a hybrid system with two stages: feature extraction using FFT and decision making using decision tree classifier. The detection of epileptiform discharges in the electroencephalogram (EEG) is an important part in the diagnosis of epilepsy. All data set were obtained from EEG signals of healthy subjects and subjects suffering from epilepsy diseases. For healthy subjects is background EEG (scalp) with open eyes and for epileptic patients correspond to a seizure recorded in hippocampus (epileptic focus) with depth electrodes. The evolution of proposed system was conducted using k-fold cross-validation, classification accuracy, and sensitivity and specificity values. We have obtained 98.68{\%} and 98.72{\%} classification accuracies using 5- and 10-fold cross-validation. The stated results show that the proposed method could point out the ability of design of a new intelligent assistance diagnosis system. {\copyright} 2006 Elsevier Inc. All rights reserved.},
	Author = {Polat, Kemal and G{\"u}ne{\c s}, Salih},
	Doi = {10.1016/j.amc.2006.09.022},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Polat, G{\"{u}}ne{\c s} - 2007 - Classification of epileptiform EEG using a hybrid system based on decision tree classifier and fast Fourier tran.pdf:pdf},
	Isbn = {0096-3003},
	Issn = {00963003},
	Journal = {Applied Mathematics and Computation},
	Keywords = {Decision tree classifier, Electroencephalogram (EEG), Epileptic seizure, FFT, k-Fold cross-validation},
	Number = {2},
	Pages = {1017--1026},
	Title = {{Classification of epileptiform EEG using a hybrid system based on decision tree classifier and fast Fourier transform}},
	Volume = {187},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.amc.2006.09.022}}

@article{Yelbay2012-2,
	Author = {Yelbay, Belma and Birbil, {\c S} {\.I} and B{\"u}lb{\"u}l, K},
	Journal = {{\ldots}Operational Research},
	Keywords = {dual information, heuristics, lp relaxation, primal-dual heuristic, set covering},
	Title = {{The set covering problem revisited: an empirical study of the value of dual information}},
	Url = {http://research.sabanciuniv.edu/19359/},
	Year = {2012},
	Bdsk-Url-1 = {http://research.sabanciuniv.edu/19359/}}

@article{Palubeckis2008,
	Author = {Palubeckis, G.},
	Journal = {Information technology and control},
	Number = {1},
	Title = {{On the graph coloring polytope}},
	Volume = {37},
	Year = {2008}}

@article{Alvelos2013-2,
	Author = {Alvelos, Filipe and Sousa, Amaro De and Santos, Dorabella},
	Journal = {Hybrid Metaheuristics},
	Pages = {1--50},
	Title = {{Combining column generation and metaheuristics}},
	Url = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6{\_}11},
	Year = {2013},
	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6%7B%5C_%7D11}}

@article{Mendez-Diaz2016,
	Abstract = {We consider a new timetabling problem arising from a real-world application in a private university in Buenos Aires, Argentina. In this paper we describe the problem in detail, which generalizes the Post-Enrollment Course Timetabling Problem (PECTP), propose an ILP model and a heuristic approach based on this formulation. This algorithm has been implemented and tested on instances obtained from real data, showing that the approach is feasible in practice and produces good quality solutions.},
	Author = {M{\'e}ndez-D{\'\i}az, Isabel and Zabala, Paula and Miranda-Bront, Juan Jos{\'e}},
	Doi = {10.1016/j.cor.2016.06.018},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/M{\'{e}}ndez-D{\'{i}}az, Zabala, Miranda-Bront - 2016 - An ILP based heuristic for a generalization of the post-enrollment course timetabling prob.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers and Operations Research},
	Keywords = {Integer programming, Matheuristic, University timetabling},
	Pages = {195--207},
	Publisher = {Elsevier},
	Title = {{An ILP based heuristic for a generalization of the post-enrollment course timetabling problem}},
	Url = {http://dx.doi.org/10.1016/j.cor.2016.06.018},
	Volume = {76},
	Year = {2016},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.cor.2016.06.018}}

@article{Liaw2002,
	Abstract = {Recently there has been a lot of interest in ``ensemble learning'' --- methods that generate many classifiers and aggregate their results. Two well-known methods are boosting (see, e.g., Shapire et al., 1998) and bagging Breiman (1996) of classification trees. In boosting, successive trees give extra weight to points incorrectly predicted by earlier predictors. In the end, a weighted vote is taken for prediction. In bagging, successive trees do not depend on earlier trees --- each is independently constructed using a bootstrap sample of the data set. In the end, a simple majority vote is taken for prediction.},
	Archiveprefix = {arXiv},
	Arxivid = {1609-3631},
	Author = {Liaw, A and Wiener, M},
	Doi = {10.1177/154405910408300516},
	Eprint = {1609-3631},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Liaw, Wiener - 2002 - Classification and Regression by randomForest.pdf:pdf},
	Isbn = {1609-3631},
	Issn = {16093631},
	Journal = {R news},
	Number = {December},
	Pages = {18--22},
	Pmid = {21196786},
	Title = {{Classification and Regression by randomForest}},
	Volume = {2},
	Year = {2002},
	Bdsk-Url-1 = {https://doi.org/10.1177/154405910408300516}}

@article{Johnson2008,
	Abstract = {We present methods that are useful in solving some large scale hierarchical planning models involving 0-1 vanables. These 0-1 programming problems initially could not be solved with any standard techniques. We employed several approaches to take advantage of the hierarchical structure of variables (ordered by importance) and other structures present in the models. Critical, but not sufficient for success, was a strong linear programming formulation. We describe methods for strengthening the linear programs, as well as other techniques necessary for a commercial branch-and-bound code to be successful in solving these problems. [ABSTRACT FROM AUTHOR]},
	Author = {Johnson, Ellis L. and Kostreva, Michael M. and Suhl, Uwe H.},
	Doi = {10.1287/opre.33.4.803},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Johnson, Kostreva, Suhl - 2008 - Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models.pdf:pdf},
	Issn = {0030-364X},
	Journal = {Operations Research},
	Number = {4},
	Pages = {803--819},
	Title = {{Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models}},
	Volume = {33},
	Year = {2008},
	Bdsk-Url-1 = {https://doi.org/10.1287/opre.33.4.803}}

@book{Michalewicz2004,
	Author = {Michalewicz, Z. and Fogel, D.B.},
	Edition = {2},
	Publisher = {Springer},
	Title = {{How to Solve It: Modern Heuristics}},
	Year = {2004}}

@phdthesis{Eso1999,
	Address = {NY, USA},
	Annote = {From Duplicate 1 (Parallel branch-and-cut for set partitioning - Eso, M) NULL},
	Author = {Eso, M.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Eso - 1999 - Parallel branch-and-cut for set partitioning.pdf:pdf},
	Title = {{Parallel branch-and-cut for set partitioning}},
	Year = {1999}}

@incollection{Cung2002,
	Author = {Cung, V.D. and Martins, S.L. and Ribeiro, C.C. and Roucairol, C.},
	Editor = {Ribeiro, C.C. and Hansen, P.},
	Pages = {263--308},
	Publisher = {Kluwer Academic Publishers},
	Title = {{Strategies for the parallel implementation of metaheuristics}},
	Year = {2002}}

@phdthesis{Santos2007,
	Author = {Santos, H. G.},
	Title = {{Formula$\backslash$cces e Algoritmos para o Problema de Programa$\backslash$cc{\~a}o de Hor{\'a}rios em Escolas}},
	Year = {2007}}

@article{Fonseca2016a,
	Abstract = {The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms noticeably outperformed the winning methods. These results, and reports from the literature, suggest that the LAHC is a reliable method that can compete with the most employed local search algorithms.},
	Author = {Fonseca, G.H.G. and Santos, H.G. and Carrano, E.G.},
	Doi = {10.1007/s10951-015-0458-5},
	Issn = {10946136},
	Journal = {Journal of Scheduling},
	Keywords = {High School Timetabling, Late Acceptance Hill-Climbing, Local search, Third International Timetabling Competition},
	Number = {4},
	Pages = {453--465},
	Title = {{Late acceptance hill-climbing for high school timetabling}},
	Volume = {19},
	Year = {2016},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10951-015-0458-5}}

@article{Fischetti2003,
	Author = {Fischetti, M. and Lodi, A.},
	Journal = {Mathematical Programming},
	Pages = {23--47},
	Title = {{Local Branching}},
	Volume = {98},
	Year = {2003}}

@article{Kodali2013-2,
	Author = {Kodali, Anuradha and Singh, Satnam and Pattipati, Krishna},
	Doi = {10.1109/TSMCA.2012.2208101},
	Issn = {2168-2216},
	Journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
	Number = {3},
	Pages = {547--562},
	Title = {{Dynamic Set-Covering for Real-Time Multiple Fault Diagnosis With Delayed Test Outcomes}},
	Url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
	Volume = {43},
	Year = {2013},
	Bdsk-Url-1 = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
	Bdsk-Url-2 = {https://doi.org/10.1109/TSMCA.2012.2208101}}

@inproceedings{Post2008,
	Author = {Post, Gerhard and Ahmadi, Samad and Daskalaki, Sophia and Kyngas, Jari and Nurmi, Cimmo and Ranson, David and Ruizenaar, Henri},
	Booktitle = {{PATAT'08 Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Post et al. - 2008 - An XML format for Benchmarks in High School Timetabling.pdf:pdf},
	Title = {{An XML format for Benchmarks in High School Timetabling}},
	Volume = {03018},
	Year = {2008}}

@phdthesis{Gomes1982,
	Author = {Gomes, C. M. N.},
	School = {Instituto Militar de Engenharia},
	Title = {{An{\'a}lise do desempenho operacional de p{\'a}tios ferrovi{\'a}rios}},
	Type = {Disserta{\c c}{\~a}o de Mestrado},
	Year = {1982}}

@article{Gunluk2016,
	Abstract = {Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a novel mixed integer programming formulation to construct optimal decision trees of specified size. We take special structure of categorical features into account and allow combinatorial decisions (based on subsets of values of such a feature) at each node. We show that very good accuracy can be achieved with small trees using moderately-sized training sets. The optimization problems we solve are easily tractable with modern solvers.},
	Archiveprefix = {arXiv},
	Arxivid = {1612.03225},
	Author = {Gunluk, Oktay and Kalagnanam, Jayant and Menickelly, Matt and Scheinberg, Katya},
	Eprint = {1612.03225},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gunluk et al. - 2016 - Optimal Generalized Decision Trees via Integer Programming.pdf:pdf},
	Keywords = {decision trees, integer programming, machine learning},
	Title = {{Optimal Generalized Decision Trees via Integer Programming}},
	Url = {http://arxiv.org/abs/1612.03225},
	Year = {2016},
	Bdsk-Url-1 = {http://arxiv.org/abs/1612.03225}}

@article{Leus2011,
	Author = {Leus, R.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Leus - 2011 - Resource Allocation by Means of Project Networks Dominance Results.pdf:pdf},
	Journal = {Networks},
	Pages = {50--58},
	Title = {{Resource Allocation by Means of Project Networks: Dominance Results}},
	Volume = {28},
	Year = {2011}}

@article{Macedo2010,
	Author = {Macedo, Rita and Alves, Cl{\'a}udio and {Val{\'e}rio de Carvalho}, J.M. M},
	Doi = {10.1016/j.cor.2009.08.005},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Macedo, Alves, Val{\'{e}}rio de Carvalho - 2010 - Arc-flow model for the two-dimensional guillotine cutting stock problem.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {Combinatorial optimization, Furniture industry, Guillotine constraints, Integer programming, Two-dimensional cutting stock problem},
	Month = {jun},
	Number = {6},
	Pages = {991--1001},
	Publisher = {Elsevier},
	Title = {{Arc-flow model for the two-dimensional guillotine cutting stock problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002007},
	Volume = {37},
	Year = {2010},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002007},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2009.08.005}}

@article{Savelsbergh1994,
	Abstract = {In the first part of the paper, we present a framework for describing basic techniques to improve the representation of a mixed integer programming problem. We elaborate on identification of infeasibility and redundancy, improvement of bounds and coefficients, and fixing of binary variables. In the second part of the paper, we discuss recent extensions to these basic techniques and elaborate on the investigation and possible uses of logical consequences},
	Author = {Savelsbergh, M. W. P.},
	Doi = {10.1287/ijoc.6.4.445},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Savelsbergh - 1994 - Preprocessing and Probing Techniques for Mixed Integer Programming Problems.pdf:pdf},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Number = {4},
	Pages = {445--454},
	Title = {{Preprocessing and Probing Techniques for Mixed Integer Programming Problems}},
	Volume = {6},
	Year = {1994},
	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.6.4.445}}

@article{Sugumaran2007,
	Abstract = {Roller bearing is one of the most widely used rotary elements in a rotary machine. The roller bearing's nature of vibration reveals its condition and the features that show the nature, are to be extracted through some indirect means. Statistical parameters like kurtosis, standard deviation, maximum value, etc. form a set of features, which are widely used in fault diagnostics. Often the problem is, finding out good features that discriminate the different fault conditions of the bearing. Selection of good features is an important phase in pattern recognition and requires detailed domain knowledge. This paper illustrates the use of a Decision Tree that identifies the best features from a given set of samples for the purpose of classification. It uses Proximal Support Vector Machine (PSVM), which has the capability to efficiently classify the faults using statistical features. The vibration signal from a piezoelectric transducer is captured for the following conditions: good bearing, bearing with inner race fault, bearing with outer race fault, and inner and outer race fault. The statistical features are extracted therefrom and classified successfully using PSVM and SVM. The results of PSVM and SVM are compared. {\copyright} 2006 Elsevier Ltd. All rights reserved.},
	Author = {Sugumaran, V. and Muralidharan, V. and Ramachandran, K. I.},
	Doi = {10.1016/j.ymssp.2006.05.004},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Sugumaran, Muralidharan, Ramachandran - 2007 - Feature selection using Decision Tree and classification through Proximal Support Vector.pdf:pdf},
	Issn = {08883270},
	Journal = {Mechanical Systems and Signal Processing},
	Keywords = {Decision Tree, Fault detection, Feature selection, PSVM, Roller bearing, Statistical features},
	Number = {2},
	Pages = {930--942},
	Title = {{Feature selection using Decision Tree and classification through Proximal Support Vector Machine for fault diagnostics of roller bearing}},
	Volume = {21},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.ymssp.2006.05.004}}

@misc{MISTAorganizers2013,
	Author = {Organizers, MISTA and organizers, MISTA},
	Title = {{MISTA - Multidisciplinary International Scheduling Conference}},
	Url = {http://www.schedulingconference.org/},
	Year = {2013},
	Bdsk-Url-1 = {http://www.schedulingconference.org/}}

@phdthesis{Mata1989,
	Address = {Rio de Janeiro, Brasil},
	Author = {Mata, S.S.},
	Title = {{O Problema do Hor{\'a}rio na Escola do Segundo Grau: Modelagem e Implementa$\backslash$cc{\~a}o}},
	Year = {1989}}

@incollection{Letchfort2016,
	Author = {Letchford, A.N. and Marzi, F. and Rossi, F. and Smriglio, S.},
	Booktitle = {{International Symposium on Combinatorial Optimization}},
	Doi = {10.1201/b16812},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Letchford et al. - 2016 - Strengthening Chv{\'{a}}tal-Gomory cuts for the stable set problem.pdf:pdf},
	Isbn = {9781439898536},
	Keywords = {chv, clique inequalities, cuts, cutting plane algorithm, stable set problem},
	Pages = {201--212},
	Title = {{Strengthening Chv{\'a}tal-Gomory cuts for the stable set problem}},
	Year = {2016},
	Bdsk-Url-1 = {https://doi.org/10.1201/b16812}}

@article{Batini1984,
	Abstract = {An algorithm is presented that allows computer aided layout of entity relationship diagrams on a grid. A standard for the representation of symbols is introduced and aesthetic criteria that should be achieved by a layout algorithm are proposed. The algorithm makes use of some heuristic step for the critical activities. Finally, an algorithm for restructuring of previously defined diagrams is presented. ?? 1984.},
	Author = {Batini, C. and Talamo, M. and Tamassia, R.},
	Doi = {10.1016/0164-1212(84)90006-2},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Batini, Talamo, Tamassia - 1984 - Computer aided layout of entity relationship diagrams.pdf:pdf},
	Issn = {01641212},
	Journal = {The Journal of Systems and Software},
	Number = {2-3},
	Pages = {163--173},
	Title = {{Computer aided layout of entity relationship diagrams}},
	Volume = {4},
	Year = {1984},
	Bdsk-Url-1 = {https://doi.org/10.1016/0164-1212(84)90006-2}}

@article{Vallada2011,
	Annote = {From Duplicate 1 (A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times - Vallada, Eva; Ruiz, Rub{\'e}n) NULL},
	Author = {Vallada, Eva and Ruiz, Rub{\'e}n},
	Doi = {10.1016/j.ejor.2011.01.011},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Vallada, Ruiz - 2011 - A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Month = {jun},
	Number = {3},
	Pages = {612--622},
	Publisher = {Elsevier B.V.},
	Title = {{A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
	Volume = {211},
	Year = {2011},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2011.01.011}}

@book{Breiman1984,
	Author = {Breiman, L. and Friedman, Jerome and Stone, Charles J. and Olshen, R.A.},
	Booktitle = {{Taylor {\&} Francis}},
	Doi = {10.1007/s00038-011-0315-z},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Breiman et al. - 1984 - Classification and regression trees Regression trees.pdf:pdf},
	Isbn = {9781351460491},
	Issn = {1661-8564},
	Keywords = {Discriminant analysis., Regression analysis., Statistics., Trees (Graph theory)},
	Pmid = {22015650},
	Title = {{Classification and regression trees Regression trees}},
	Year = {1984},
	Bdsk-Url-1 = {https://doi.org/10.1007/s00038-011-0315-z}}

@article{Lucena2006,
	Author = {Lucena, Abilio},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lucena - 2006 - Lagrangian Relax-and-Cut Algorithms.pdf:pdf},
	Journal = {Handbook of Optimization in Telecommunications},
	Keywords = {cutting planes, knapsack problem, lagrangian relaxation, relax-and-cut},
	Number = {1994},
	Pages = {129--145},
	Title = {{Lagrangian Relax-and-Cut Algorithms}},
	Year = {2006}}

@article{Santos2016a,
	Author = {Santos, H.G. and Toffolo, T.A M. and Gomes, R.A.M. and Ribas, S.},
	Issn = {0254-5330},
	Journal = {Annals of Operations Research},
	Number = {1},
	Pages = {225--251},
	Title = {{Integer programming techniques for the nurse rostering problem}},
	Volume = {239},
	Year = {2016}}

@article{Insitute2003,
	Abstract = {Stochastic search algorithms are often robust, scalable problem solvers. In this paper, we concern ourselves with the class of stochastic search algorithms called stochastic sampling. Randomization in such a search framework can be an effective means of expanding search around a stochastic neighborhood of a strong domain heuristic. Specifically, we show that a value-biased approach can be more effective than the rank-biased approach of the heuristic-biased stochastic sampling algorithm. We also illustrate the effectiveness of value-biasing the starting configurations of a local hill-climber. We use the weighted tardiness sche duling problem to evaluate our approach.},
	Author = {Cicirello, Vincent A. and Smith, Stephen F.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Cicirello, Smith - 2003 - Enhancing Stochastic Search Performance by Value- Biased Randomization of Heuristics.pdf:pdf},
	Journal = {Journal of Heuristics},
	Keywords = {combinatorial optimization, randomized heuristics, sequence-dependent setups, stochastic sampling, stochastic search, weighted tardiness scheduling},
	Pages = {5--34},
	Title = {{Enhancing Stochastic Search Performance by Value- Biased Randomization of Heuristics}},
	Volume = {11},
	Year = {2003}}

@phdthesis{Ravetti2007,
	Author = {Ravetti, Mart{\'\i}n G{\'o}mez},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ravetti - 2007 - Algoritmos para o Problema de Seq{\"{u}}enciamento com M{\'{a}}quinas Paralelas e Tempos de Prepara{\c{c}}{\~{a}}o Dependentes da Seq{\"{u}}{\^{e}}nc.pdf:pdf},
	School = {Universidade Federal de Minas Gerais},
	Title = {{Algoritmos para o Problema de Seq{\"u}enciamento com M{\'a}quinas Paralelas e Tempos de Prepara{\c c}{\~a}o Dependentes da Seq{\"u}{\^e}ncia}},
	Year = {2007}}

@incollection{Linderoth2005,
	Annote = {From Duplicate 1 (Noncommercial Software for Mixed-Integer Linear Programming - Linderoth, J T; Ralphs, T K) NULL},
	Author = {Linderoth, J.T. and Ralphs, T.K.},
	Booktitle = {{Integer Programming: Theory and Practice}},
	Editor = {Karlof, J.K.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Linderoth, Ralphs - 2005 - Noncommercial Software for Mixed-Integer Linear Programming.pdf:pdf},
	Pages = {253--303},
	Publisher = {CRC Press},
	Title = {{Noncommercial Software for Mixed-Integer Linear Programming}},
	Year = {2005}}

@incollection{Resende2005,
	Author = {Resende, M.G.C. and Ribeiro, C.C.},
	Editor = {Ibaraki, T. and Nonobe, K. e Yagiura M.},
	Pages = {29--63},
	Publisher = {Kluwer Academic Publishers},
	Title = {{GRASP with path-relinking: Recent advances and applications}},
	Year = {2005}}

@book{Bellman2003,
	Author = {Bellman, R.},
	Publisher = {Dover Publications},
	Title = {{Dynamic Programming}},
	Year = {2003}}

@article{Wauters2015,
	Abstract = {{\copyright} 2014 Springer Science+Business Media New York The present paper introduces a learning-based optimization approach to the resource-constrained multi-project scheduling problem. Multiple projects, each with their own set of activities, need to be scheduled. The objectives dealt with here include minimization of the average project delay and total makespan. The availability of local and global resources, precedence relations between activities, and non-equal project start times have to be considered. The proposed approach relies on a simple sequence learning game played by a group of project managers. The project managers each learn their activity list locally using reinforcement learning, more specifically learning automata. Meanwhile, they learn how to choose a suitable place in the overall sequence of all activity lists. All the projects need to arrive at a unique place in this sequence. A mediator, who usually has to solve a complex optimization problem, now manages a simple dispersion game. Through the mediator, a sequence of feasible activity lists is eventually scheduled by using a serial schedule generation scheme, which is adopted from single project scheduling. It is shown that the sequence learning approach has a large positive effect on minimizing the average project delay. In fact, the combination of local reinforcement learning, the sequence learning game and a forward-backward implementation of the serial scheduler significantly improves the best known results for all the MPSPLIB datasets. In addition, several new best results were obtained for both considered objectives: minimizing the average project delay and minimizing the total makespan.},
	Author = {Wauters, T. and Verbeeck, K. and {De Causmaecker}, P. and {Vanden Berghe}, G.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Wauters et al. - 2015 - A learning-based optimization approach to multi-project scheduling.pdf:pdf},
	Journal = {Journal of Scheduling},
	Keywords = {Dispersion games, Learning automata, Multi-project scheduling},
	Number = {1},
	Pages = {61--74},
	Title = {{A learning-based optimization approach to multi-project scheduling}},
	Volume = {18},
	Year = {2015}}

@inproceedings{Geiger2013,
	Author = {Geiger, Martin Josef},
	Booktitle = {{Proceedings of the 6th Multidisciplinary International Scheduling Conference (MISTA 2013)}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Geiger - 2013 - Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem.pdf:pdf},
	Title = {{Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem}},
	Year = {2013}}

@article{Towhidi2016,
	Abstract = {{\copyright} 2015, Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society.Implementations of the simplex method differ mostly in specific aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer programming differ mostly in the type of cuts and the exploration of the search tree. We provide a scripting mechanism to easily implement and experiment with primal and dual pivot rules for the simplex method, by building upon COIN-OR's open-source linear programming package CLP, without explicitly interacting with the underlying C+ + layers of CLP. In the same manner, users can customize the solution process of mixed-integer linear programs using the CBC and CGL COIN-OR packages by coding branch-and-cut strategies and cut generators in Python. The Cython programming language ensures communication between Python and C+ + libraries and activates user-defined customizations as callbacks. Our goal is to emphasize the ease of development in Python while maintaining acceptable performance. The resulting software, named CyLP, has become a part of COIN-OR and is available under open-source terms. For illustration, we provide an implementation of the positive edge rule---a recently proposed rule that is particularly efficient on degenerate problems---and demonstrate how to customize branch-and-cut node selection in the solution of a mixed-integer program.},
	Author = {Towhidi, Mehdi and Orban, Dominique},
	Doi = {10.1007/s12532-015-0094-2},
	File = {:home/haroldo/Documentos/cylp/Customizing the solution process of COIN-OR's linear solvers with Python.pdf:pdf},
	Issn = {18672957},
	Journal = {Mathematical Programming Computation},
	Keywords = {CBC, CGL, CLP, COIN-OR, Cython, Linear programming, Mixed-integer programming, Python, Simplex pivot},
	Number = {4},
	Pages = {377--391},
	Publisher = {Springer Berlin Heidelberg},
	Title = {{Customizing the solution process of COIN-OR's linear solvers with Python}},
	Volume = {8},
	Year = {2016},
	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-015-0094-2}}

@article{Zilberstein1996,
	Author = {Zilberstein, S.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Zilberstein - 1996 - Using Anytime Algorithms in Intelligent Systems.pdf:pdf},
	Isbn = {9783319120683},
	Journal = {AI Magazine},
	Number = {3},
	Pages = {73--83},
	Title = {{Using Anytime Algorithms in Intelligent Systems}},
	Volume = {17},
	Year = {1996}}

@article{Alba2007,
	Abstract = {A Project Scheduling Problem consists in deciding who does what during the software project lifetime. This is a capital issue in the practice of software engineering, since the total budget and human resources involved must be managed opti- mally in order to end in a successful project. In short, companies are principally concerned with reducing the duration and cost of projects, and these two goals are in conflict with each other. In this work we tackle the problem by using genetic algorithms (GAs) to solve many different software project scenarios. Thanks to our newly developed instance generator we can perform structured studies on the influence the most important problem attributes have on the solutions. Our conclu- sions show that GAs are quite flexible and accurate for this application, and an important tool for automatic project management.},
	Annote = {From Duplicate 1 (Software Project Management with GAs - Alba, Enrique; Chicano, J Francisco) NULL},
	Author = {Alba, E. and Chicano, J.F.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Alba, Chicano - 2007 - Software Project Management with GAs.pdf:pdf},
	Journal = {Information Sciences},
	Number = {177},
	Pages = {2380--2401},
	Title = {{Software Project Management with GAs}},
	Year = {2007}}

@article{Rothberg2007,
	Author = {Rothberg, E.},
	Journal = {INFORMS JOURNAL ON COMPUTING},
	Pages = {534--541},
	Title = {{An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions}},
	Volume = {19},
	Year = {2007}}

@incollection{Orman2007a,
	Abstract = {Eight distinct (and in some cases little known) formulations of the Travelling Salesman Problem as an Integer Programme are given. Apart from the standard formulation all the formulations are {\lq}compact' in the sense that the number of constraints and variables is a polynomial function of the number of cities in the problem. Comparisons of the formulations are made by projecting out variables in order to produce polytopes in the same space. It is then possible to compare the strengths of the Linear Programming relaxations. These results are illustrated by computational results on a small problem.},
	Author = {Orman, A J and Williams, H P},
	Booktitle = {{Optimisation, Econometric and Financial Analysis}},
	Editor = {Kontoghiorghes, Erricos John and Gatu, Cristian},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Orman, Williams - 2007 - A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem.pdf:pdf},
	Keywords = {polytopes, travelling salesman problem},
	Number = {1991},
	Pages = {91--104},
	Publisher = {Springer Berlin Heidelberg},
	Title = {{A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem}},
	Year = {2007}}

@article{Hertz1991,
	Author = {Hertz, A.},
	Journal = {European Journal or Operational Research},
	Pages = {39--47},
	Title = {{Tabu Search for Large Scale Timetabling Problems}},
	Volume = {54},
	Year = {1991}}

@inproceedings{Asta2013,
	Annote = {From Duplicate 1 (Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem - Asta, Shahriar; Karapetyan, Daniel; Kheiri, Ahmed; Ozcan, Ender; Parkes, Andrew J) NULL},
	Author = {Asta, Shahriar and Karapetyan, Daniel and Kheiri, Ahmed and Ozcan, Ender and Parkes, Andrew J},
	Booktitle = {{Proceedings of the 6th Multidisciplinary International Scheduling Conference}},
	Editor = {Kendall, G and {Vanden Berghe}, G and McCollum, B},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Asta et al. - 2013 - Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling.pdf:pdf},
	Pages = {836--839},
	Title = {{Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem}},
	Volume = {(in review},
	Year = {2013}}

@article{Hansen1997,
	Author = {Hansen, P. and Mladenovi{\'c}, N.},
	Journal = {Computers and Operations Research},
	Number = {11},
	Pages = {1097--1100},
	Title = {{Variable Neighborhood Search}},
	Volume = {24},
	Year = {1997}}

@article{Aardal1996,
	Author = {Aardal, K. and van Hoesel, C. P. M.},
	Journal = {Statistica Neerlandica},
	Month = {mar},
	Number = {1},
	Pages = {3--26},
	Title = {{Polyhedral techniques in combinatorial optimization I: Theory}},
	Volume = {50},
	Year = {1996}}

@article{Fonseca2017,
	Author = {Fonseca, G.H.G. and Santos, H.G. and Carrano, E.G. and Stidsen, T.J.R.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fonseca et al. - 2017 - Integer programming techniques for educational timetabling.pdf:pdf},
	Journal = {European Journal of Operational Research},
	Pages = {28--39},
	Title = {{Integer programming techniques for educational timetabling}},
	Volume = {262},
	Year = {2017}}

@article{Parragh2013-2,
	Abstract = {Demographic change towards an ever aging population entails an increasing demand for specialized transportation systems to complement the traditional public means of transportation. Typically, users place transportation requests, specifying a pickup and a drop off location and a fleet of minibuses or taxis is used to serve these requests. The underlying optimization problem can be modeled as a dial-a-ride problem. In the dial-a-ride problem considered in this paper, total routing costs are minimized while respecting time window, maximum user ride time, maximum route duration, and vehicle capacity restrictions. We propose a hybrid column generation and large neighborhood search algorithm and compare different hybridization strategies on a set of benchmark instances from the literature.},
	Author = {Parragh, Sophie N and Schmid, Verena},
	Doi = {10.1016/j.cor.2012.08.004},
	Issn = {0305-0548},
	Journal = {Computers {\&} operations research},
	Keywords = {Column generation, Dial-a-ride problem, Hybrid algorithm, Variable neighborhood search, large neighborhood search},
	Number = {1},
	Pages = {490--497},
	Pmid = {23471127},
	Publisher = {Elsevier},
	Title = {{Hybrid column generation and large neighborhood search for the dial-a-ride problem.}},
	Url = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368{\&}tool=pmcentrez{\&}rendertype=abstract},
	Volume = {40},
	Year = {2013},
	Bdsk-Url-1 = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368%7B%5C&%7Dtool=pmcentrez%7B%5C&%7Drendertype=abstract},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2012.08.004}}

@article{Burke2004a,
	Annote = {From Duplicate 2 (The State of the Art of Nurse Rostering - Burke, E. K.; De Causmaecker, P.; Berghe, G. V.; Landeghem, H. V.) NULL},
	Author = {Burke, E.K. and {De Causmaecker}, P. and {Vanden Berghe}, G. and {Van Landeghem}, H.},
	Journal = {Journal of Scheduling},
	Pages = {441--499},
	Title = {{The State of the Art of Nurse Rostering}},
	Volume = {7},
	Year = {2004}}

@article{Achterberg2007,
	Author = {Achterberg, T.},
	Journal = {Discrete Optimization},
	Pages = {4--20},
	Title = {{Conflict analysis in mixed integer programming}},
	Volume = {4},
	Year = {2007}}

@book{Callahan1992,
	Author = {Callahan, M T and Quackenbush, D G and Rowings, J E},
	Isbn = {0070097011},
	Publisher = {McGraw-Hill},
	Title = {{Construction Project Scheduling}},
	Year = {1992}}

@article{Fleszar2011-2,
	Author = {Fleszar, Krzysztof and Charalambous, Christoforos and Hindi, Khalil S},
	Doi = {10.1007/s10845-011-0522-8},
	Issn = {0956-5515},
	Journal = {Journal of Intelligent Manufacturing},
	Keywords = {hybrid optimization, makespan minimization, mip neighborhood, mixed-integer programming, neighborhood search, parallel machine, parallel machine scheduling},
	Mendeley-Tags = {mip neighborhood,parallel machine},
	Number = {5},
	Pages = {1949--1958},
	Title = {{A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times}},
	Url = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
	Volume = {23},
	Year = {2011},
	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-011-0522-8}}

@misc{Post2012,
	Author = {Post, Gerhard},
	Title = {{International Timetabling Competition: Results}},
	Url = {http://www.utwente.nl/ctit/hstt/itc2011/results/},
	Year = {2012},
	Bdsk-Url-1 = {http://www.utwente.nl/ctit/hstt/itc2011/results/}}

@article{Hammer1975,
	Author = {Hammer, P.L. and Johnson, E.L. and Peled, U.N.},
	Journal = {Mathematical Programming},
	Number = {1},
	Pages = {179--206},
	Title = {{Facets of Regular 0-1 Polytopes}},
	Volume = {8},
	Year = {1975}}

@article{Belotti2016,
	Abstract = {{\copyright} 2016, Springer Science+Business Media New York. Mixed integer programming (MIP) is commonly used to model indicator constraints, i.e., constraints that either hold or are relaxed depending on the value of a binary variable. Unfortunately, those models tend to lead to weak continuous relaxations and turn out to be unsolvable in practice; this is what happens, for e.g., in the case of Classification problems with Ramp Loss functions that represent an important application in this context. In this paper we show the computational evidence that a relevant class of these Classification instances can be solved far more efficiently if a nonlinear, nonconvex reformulation of the indicator constraints is used instead of the linear one. Inspired by this empirical and surprising observation, we show that aggressive bound tightening is the crucial ingredient for solving this class of instances, and we devise a pair of computationally effective algorithmic approaches that exploit it within MIP. One of these methods is currently part of the arsenal of IBM-Cplex since version 12.6.1. More generally, we argue that aggressive bound tightening is often overlooked in MIP, while it represents a significant building block for enhancing MIP technology when indicator constraints and disjunctive terms are present.},
	Author = {Belotti, Pietro and Bonami, Pierre and Fischetti, Matteo and Lodi, Andrea and Monaci, Michele and Nogales-G{\'o}mez, Amaya and Salvagnin, Domenico},
	Doi = {10.1007/s10589-016-9847-8},
	File = {:home/haroldo/Documentos/IntegerProgramming/indicator constraints/On{\_}handling{\_}indicator{\_}constraints{\_}in{\_}mixed{\_}integer.pdf:pdf},
	Issn = {15732894},
	Journal = {Computational Optimization and Applications},
	Keywords = {Indicator constraints, Mixed-integer linear programming, Mixed-integer quadratic programming},
	Number = {3},
	Pages = {545--566},
	Title = {{On handling indicator constraints in mixed integer programming}},
	Volume = {65},
	Year = {2016},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10589-016-9847-8}}

@book{Fourer1987,
	Author = {Fourer, Robert and Gay, David and Kernighan, Brian},
	File = {:home/haroldo/Documentos/ampl/ampl3.pdf:pdf},
	Publisher = {AT {\&} T Bell Laboratories},
	Title = {{AMPL: A mathematical programming language}},
	Year = {1987}}

@article{Pecin2017a,
	Abstract = {The best performing exact algorithms for the Capacitated Vehicle Routing Problem are based on the combination of cut and column generation. Some authors could obtain reduced duality gaps by also using a restricted num-ber of cuts over the Master LP variables, stopping separation before the pricing becomes prohibitively hard. This work introduces a technique for greatly decreas-ing the impact on the pricing of the Subset Row Cuts, thus allowing much more such cuts to be added. The newly proposed Branch-Cut-and-Price algorithm also incorporates and combines for the first time (often in an improved way) several elements found in previous works, like route enumeration and strong branching. All the instances used for benchmarking exact algorithms, with up to 199 cus-tomers, were solved to optimality. Moreover, some larger instances with up to 360 customers, only considered before by heuristic methods, were solved too.},
	Author = {Pecin, D. and Pessoa, A. and Poggi, M. and Uchoa, E.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Pecin et al. - 2017 - Improved branch-cut-and-price for capacitated vehicle routing.pdf:pdf},
	Isbn = {9783319075563},
	Journal = {Mathematical Programming Computation},
	Keywords = {Algorithmic engineering, Column generation, Cut separation, Integer programming},
	Number = {1},
	Pages = {61--100},
	Publisher = {Springer Berlin Heidelberg},
	Title = {{Improved branch-cut-and-price for capacitated vehicle routing}},
	Volume = {9},
	Year = {2017}}

@article{Xiao2013,
	Author = {Xiao, Jing and Ao, Xian-Ting and Tang, Yong},
	Doi = {10.1016/j.cor.2012.05.007},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Xiao, Ao, Tang - 2013 - Solving software project scheduling problems with ant colony optimization.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {Ant colony optimization, Automatic software management, Scheduling, Software project scheduling},
	Month = {jan},
	Number = {1},
	Pages = {33--46},
	Publisher = {Elsevier},
	Title = {{Solving software project scheduling problems with ant colony optimization}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054812001104},
	Volume = {40},
	Year = {2013},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054812001104},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2012.05.007}}

@incollection{Tomita2011,
	Author = {Tomita, Etsuji and Akutsu, Tatsuya and Matsunaga, Tsutomu},
	Booktitle = {{Biomedical Engineering, Trends in Electronics, Communications and Software}},
	Editor = {Laskovski, Anthony N},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Tomita, Akutsu, Matsunaga - 2011 - Efficient Algorithms for Finding Maximum and Maximal Cliques Effective Tools for Bioinformatics.pdf:pdf},
	Number = {3},
	Pages = {625--640},
	Publisher = {InTech},
	Title = {{Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics}},
	Year = {2011}}

@article{Boyd1994a,
	Author = {Boyd, E.A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Boyd - 1994 - Solving 01 integer programs with enumeration cutting planes.pdf:pdf},
	Journal = {Annals of Operations Research},
	Number = {1},
	Pages = {61--72},
	Title = {{Solving 0/1 integer programs with enumeration cutting planes}},
	Volume = {50},
	Year = {1994}}

@inproceedings{Fischetti2018,
	Author = {Fischetti, Matteo and Salvagnin, Domenico},
	Booktitle = {{Proceedings of the CPAIOR 2018 : Integration of Constraint Programming, Artificial Intelligence, and Operations Research}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2018 - Chasing first queens by integer programming.pdf:pdf},
	Keywords = {Lexicographic simplex, Mixed-integer programming, n-Queens problem},
	Pages = {232--244},
	Title = {{Chasing first queens by integer programming}},
	Year = {2018}}

@article{Graham1979,
	Author = {Graham, R.L. and Lawler, Eugene and Lenstra, Jan Karel and {Rinnooy Kan}, A.H.G.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Graham et al. - 1979 - Optimization and Approximation in Deterministic Sequencing and Scheduling A Survey.pdf:pdf},
	Journal = {Annals of Discrete Mathematics},
	Number = {2},
	Pages = {287--326},
	Title = {{Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey}},
	Volume = {5},
	Year = {1979}}

@article{Santos2005,
	Abstract = {{\copyright} 2005 ACM. The Class/Teacher Timetabling Problem (CTTP) deals with the weekly scheduling of encounters between teachers and classes of an educational institution. Since CTTP is a NP-hard problem for nearly all of its variants, the use of heuristic methods for its resolution is justified. This paper presents an efficient Tabu Search (TS) heuristic with two different memory based diversification strategies for CTTP. Results obtained through an application of the method to a set of real world problems show that it produces better solutions than a previously proposed TS found in the literature and faster times are observed in the production of good quality solutions.},
	Author = {Santos, H.G. G. and Ochi, L.S. and Souza, M.J.F.},
	Doi = {10.1145/1064546.1180621},
	Issn = {1084-6654},
	Journal = {Journal of Experimental Algorithmics (JEA)},
	Keywords = {Metaheuristics, Tabu search, Timetabling},
	Title = {{A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem}},
	Volume = {10},
	Year = {2005},
	Bdsk-Url-1 = {https://doi.org/10.1145/1064546.1180621}}

@article{Hoffman1991,
	Author = {Hoffman, K. L. and Padberg, M.},
	Doi = {10.1287/ijoc.3.2.121},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Hoffman, Padberg - 1991 - Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut.pdf:pdf},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Number = {2},
	Pages = {121--134},
	Title = {{Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut}},
	Volume = {3},
	Year = {1991},
	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.3.2.121}}

@article{Toffolo2016,
	Author = {Toffolo, T.A.M. and Santos, H.G. and Carvalho, M.A.M. and Soares, J.A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Toffolo et al. - 2016 - An integer programming approach to the multimode resource-constrained multiproject scheduling problem.pdf:pdf},
	Journal = {Journal of Scheduling},
	Number = {3},
	Pages = {295--307},
	Publisher = {Springer US},
	Title = {{An integer programming approach to the multimode resource-constrained multiproject scheduling problem}},
	Volume = {19},
	Year = {2016}}

@article{Sapkota2011-2,
	Author = {Sapkota, Nabin and Reilly, Charles H},
	Doi = {10.1016/j.cie.2011.02.008},
	Issn = {03608352},
	Journal = {Computers {\&} Industrial Engineering},
	Keywords = {explicit correlation induction, karush, kuhn, set covering problem, tucker conditions},
	Number = {1},
	Pages = {39--47},
	Publisher = {Elsevier Ltd},
	Title = {{Simulating realistic set covering problems with known optimal solutions}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
	Volume = {61},
	Year = {2011},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cie.2011.02.008}}

@misc{CenterforHistoryandNewMedia,
	Annote = { {\textless}m:bold{\textgreater}Bem-vindo(a) a Zotero!{\textless}/m:bold{\textgreater} {\textless}m:linebreak{\textgreater}{\textless}/m:linebreak{\textgreater} {\textless}m:linebreak{\textgreater}{\textless}/m:linebreak{\textgreater}Veja o Guia r{\'a}pido para aprender a como come{\c c}ar a coletar, gerenciar, citar e partilhar suas fontes de pesquisa.{\textless}m:linebreak{\textgreater}{\textless}/m:linebreak{\textgreater}Obrigado por instalar Zotero.},
	Author = {{Center for History and New Media}},
	Title = {{Guia de In{\'\i}cio R{\'a}pido}},
	Url = {http://zotero.org/support/quick{\_}start{\_}guide},
	Bdsk-Url-1 = {http://zotero.org/support/quick%7B%5C_%7Dstart%7B%5C_%7Dguide}}

@incollection{Rice1976,
	Author = {Rice, J.R.},
	Booktitle = {{Advances in Computers}},
	Editor = {Rubinoff, Morris and Yovits, Marshall C.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rice - 1976 - The Algorithm Selection Problem.pdf:pdf},
	Pages = {65--118},
	Publisher = {Elsevier},
	Title = {{The Algorithm Selection Problem}},
	Year = {1976}}

@article{Costa1994,
	Author = {Costa, D.},
	Journal = {European Journal of Operational Research},
	Pages = {98--110},
	Title = {{A Tabu Search algorithm for computing an operational timetable}},
	Volume = {76},
	Year = {1994}}

@phdthesis{Souza2000,
	Address = {Rio de Janeiro, Brasil},
	Author = {Souza, M J F},
	Title = {{Programa$\backslash$cc{\{}{\~a}{\}}o de Hor{\{}{\'a}{\}}rios em Escolas: Uma Aproxima$\backslash$cc{\{}{\~a}{\}}o por Metaheur{\{}{\'\i}{\}}sticas}},
	Year = {2000}}

@article{AAtamturk2005,
	Author = {AAtamt{\"u}rk, A. and Savelsbergh, M.W.P.},
	Journal = {Annals of Operations Research},
	Pages = {67--124},
	Title = {{Integer-Programming Software Systems}},
	Volume = {140},
	Year = {2005}}

@article{Garille2001,
	Author = {Marchand, Hugues and Wolsey, Laurence A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Marchand, Wolsey - 2001 - Aggregation and Mixed Integer Rounding to Solve MIPs.pdf:pdf},
	Journal = {Operations Research},
	Number = {3},
	Pages = {363--371},
	Title = {{Aggregation and Mixed Integer Rounding to Solve MIPs}},
	Volume = {49},
	Year = {2001}}

@article{Carr2002,
	Author = {Carr, Robert D. and Lancia, Giuseppe},
	Doi = {10.1016/S0167-6377(01)00106-7},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Carr, Lancia - 2002 - Compact vs. exponential-size LP relaxations.pdf:pdf},
	Issn = {01676377},
	Journal = {Operations Research Letters},
	Keywords = {compact optimization, integer program, linear program, separation},
	Month = {feb},
	Number = {1},
	Pages = {57--65},
	Title = {{Compact vs. exponential-size LP relaxations}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0167637701001067},
	Volume = {30},
	Year = {2002},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0167637701001067},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0167-6377(01)00106-7}}

@misc{Hill2009,
	Author = {Hill, H.},
	Booktitle = {{Phi Delta Kappan}},
	Doi = {10.1177/0964663912467814},
	Issn = {09646639},
	Pages = {470--476},
	Title = {{Fixing Teacher Professional Development}},
	Volume = {90},
	Year = {2009},
	Bdsk-Url-1 = {https://doi.org/10.1177/0964663912467814}}

@article{Lawler,
	Abstract = {This chapter discusses different types of sequencing and scheduling problems, and describes different types of algorithms and the concepts of complexity theory. A class of deterministic machine scheduling problems has been introduced in the chapter. The chapter also deals with the single machine, parallel machine and multi-operation problems in this class, respectively. The two generalizations of the deterministic machine-scheduling model have been presented in the chapter. A deterministic scheduling model may give rise to various stochastic counterparts, as there is a choice in the parameters that are randomized, in their distributions, and in the classes of policies that can be applied. A characteristic feature of these models is that the stochastic parameters are regarded as independent random variables with a given distribution and that their realization occurs only after the scheduling decision has been made. In the deterministic model, one has perfect information, and capitalizing on it in minimizing the realization of a performance measure may require exponential time. {\copyright} 1993, Elsevier Science Publishers B.V. All rights reserved.},
	Annote = {From Duplicate 2 (Sequencing and Scheduling Algorithms and Complexity - Lawler, Eugene; Lenstra, Jan Karel; Rinooy Kan, Alexander H G; Shmoys, David B) NULL},
	Author = {Lawler, Eugene L. and Lenstra, Jan Karel and {Rinooy Kan}, Alexander H.G. G and Shmoys, David B. and {Rinnooy Kan}, Alexander H.G. and Shmoys, David B.},
	Doi = {10.1016/S0927-0507(05)80189-6},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lawler et al. - Unknown - Sequencing and Scheduling Algorithms and Complexity.pdf:pdf; :home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lawler et al. - 1993 - Sequencing and scheduling Algorithms and complexity.pdf:pdf},
	Isbn = {978-0-444-87472-6},
	Issn = {09270507},
	Journal = {Handbooks in OR {\&} MS},
	Number = {C},
	Pages = {445--522},
	Title = {{Sequencing and Scheduling Algorithms and Complexity}},
	Volume = {4},
	Year = {1993},
	Bdsk-Url-1 = {https://doi.org/10.1016/S0927-0507(05)80189-6}}

@article{Frota2004,
	Author = {Frota, Y and Camp{\^e}lo, M. and Corr{\^e}a, R.},
	Journal = {Information Processing Letters},
	Pages = {159--164},
	Title = {{Cliques, holes and the vertex coloring polytope}},
	Volume = {89},
	Year = {2004}}

@article{Coelho2011,
	Author = {Coelho, Jos{\'e} and Vanhoucke, Mario},
	Doi = {10.1016/j.ejor.2011.03.019},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Coelho, Vanhoucke - 2011 - Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Month = {aug},
	Number = {1},
	Pages = {73--82},
	Title = {{Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S037722171100230X},
	Volume = {213},
	Year = {2011},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S037722171100230X},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2011.03.019}}

@article{Alfandari2010-2,
	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
	Doi = {10.1016/j.endm.2010.05.061},
	Issn = {15710653},
	Journal = {Electronic Notes in Discrete Mathematics},
	Keywords = {alarme processing, approximation, integer programming, maximal coverage, np-hardness, set covering},
	Mendeley-Tags = {alarme processing},
	Pages = {479--485},
	Title = {{Approximation of the Clustered Set Covering Problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624 http://www.sciencedirect.com/science/article/pii/S1571065310000624},
	Volume = {36},
	Year = {2010},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624%20http://www.sciencedirect.com/science/article/pii/S1571065310000624},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.endm.2010.05.061}}

@article{Santos2006,
	Abstract = {The aim of this work is to present some alternatives to improve the performance of an evolutionary algorithm applied to the problem known as the oil collecting vehicle routing problem. Some proposals based on the insertion of local search and data mining (DM) modules in a genetic algorithm (GA) are presented. Four algorithms were developed: a GA, a GA with a local search procedure, a GA including a DM module and a GA including local search and DM. Experimental results demonstrate that the incorporation of DM and local search modules in GA can improve the solution quality produced by this method. {\copyright} 2006 Elsevier B.V. All rights reserved.},
	Author = {Santos, H.G. G. and Ochi, L.S. S. and Marinho, E.H. H. and Drummond, L.M.A. M. A.},
	Doi = {10.1016/j.neucom.2006.07.008},
	Issn = {0925-2312},
	Journal = {Neurocomputing},
	Keywords = {Data mining, Evolutionary algorithms, Vehicle routing},
	Number = {1-3},
	Pages = {70--77},
	Title = {{Combining an Evolutionary Algorithm with Data Mining to solve a Vehicle Routing Problem}},
	Url = {http://www.sciencedirect.com/science/article/pii/S0925231206002050},
	Volume = {70},
	Year = {2006},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0925231206002050},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.neucom.2006.07.008}}

@article{Aardal1999,
	Author = {Aardal, K. and van Hoesel, C. P. M.},
	Journal = {Statistica Neerlandica},
	Month = {jul},
	Number = {2},
	Pages = {131--177},
	Title = {{Polyhedral techniques in combinatorial optimization II: applications and computations}},
	Volume = {53},
	Year = {1999}}

@techreport{miplib2017,
	Author = {Gleixner, A. and Hendel, G. and Gamrath, G. and Achterberg, T. and Bastubbe, M. and Berthold, T. and Christophel, P. and Jarck, K. and Koch, T. and Linderoth, J. and Marco, L and Derya, D.M. and Ralphs, T.K. and Salvagnin, D. and Shinano, Y.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gleixner et al. - 2019 - MIPLIB 2017 Data-Driven Compilation of the 6th Mixed-Integer Programming Library.pdf:pdf},
	Institution = {Zuse Institute Berlin},
	Pages = {1--38},
	Title = {{MIPLIB 2017 : Data-Driven Compilation of the 6th Mixed-Integer Programming Library}},
	Url = {http://miplib.zib.de/},
	Year = {2019},
	Bdsk-Url-1 = {http://miplib.zib.de/}}

@article{Cornuejols2007,
	Author = {Cornu{\'e}jols, G.},
	Journal = {Annals of Operations Research},
	Number = {1},
	Pages = {63--66},
	Title = {{Revival of the Gomory cuts in the 1990$\backslash$' s}},
	Volume = {149},
	Year = {2007}}

@inproceedings{Rodrigues2013,
	Author = {Rodrigues, Lucas U and Santos, Haroldo G and Toffolo, T{\'u}lio {\^A}ngelo Machado and Silva, Cristiano L T F},
	Booktitle = {{MISTA 2013: Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rodrigues et al. - 2013 - Local search techniques applied to the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent S.pdf:pdf},
	Pages = {458--471},
	Title = {{Local search techniques applied to the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times}},
	Year = {2013}}

@article{Fonseca2016,
	Author = {Fonseca, George H.G. and Santos, Haroldo G. and Carrano, Eduardo G.},
	Doi = {10.1016/j.cor.2016.04.016},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Month = {oct},
	Pages = {108--117},
	Title = {{Integrating matheuristics and metaheuristics for timetabling}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054816300879},
	Volume = {74},
	Year = {2016},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054816300879},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2016.04.016}}

@article{DaFonseca2016,
	Abstract = {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 institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built upon the Kingston High School Timetabling Engine. Several neighborhood structures were developed and used in a hybrid metaheuristic based on Simulated Annealing and Iterated Local Search. The developed algorithm was the winner of the competition and produced the best known solutions for almost all instances. {\copyright} 2014 Springer Science+Business Media New York.},
	Annote = {NULL},
	Author = {da Fonseca, G.H.G. and Santos, H.G. and Toffolo, T.{\^A}.M. and Brito, S.S. and Souza, M.J.F.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/da Fonseca et al. - 2014 - GOAL solver a hybrid local search based solver for high school timetabling.pdf:pdf},
	Journal = {Annals of Operations Research},
	Keywords = {High School Timetabling Problem, Iterated Local Search, Metaheuristics, Simulated Annealing, Third International Timetabling Competition},
	Pages = {77--97},
	Title = {{GOAL solver: a hybrid local search based solver for high school timetabling}},
	Volume = {239},
	Year = {2016}}

@article{Johnson2000,
	Author = {Johnson, E.L. and Nemhauser, G. and Savelsbergh, W.P.},
	Journal = {INFORMS Journal on Computing},
	Title = {{Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition}},
	Volume = {12},
	Year = {2000}}

@article{Kerninghan1970,
	Author = {Kerninghan, B.W. and Lin, S.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kerninghan, Lin - 1970 - An efficient heuristic procedure for partitioning Graphs.pdf:pdf},
	Journal = {The bell system technical journal},
	Title = {{An efficient heuristic procedure for partitioning Graphs}},
	Year = {1970}}

@book{Dantzig1998,
	Author = {Dantzig, G.},
	Publisher = {Princeton University Press},
	Title = {{Linear Programming and Extensions}},
	Year = {1998}}

@article{Herroelen2005,
	Abstract = {The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, which is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling under uncertainty projects with deterministic network evolution structure. {\copyright} 2004 Elsevier B.V. All rights reserved.},
	Author = {Herroelen, W. and Leus, R.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Herroelen, Leus - 2005 - Project scheduling under uncertainty Survey and research potentials.pdf:pdf},
	Journal = {European Journal of Operational Research},
	Keywords = {Project management and scheduling, Robustness, Schedule stability, Scheduling under uncertainty},
	Number = {2},
	Pages = {289--306},
	Title = {{Project scheduling under uncertainty: Survey and research potentials}},
	Volume = {165},
	Year = {2005}}

@book{Wolsey1998,
	Author = {Wolsey, Laurence A.},
	Isbn = {0471283665},
	Pages = {288},
	Publisher = {Wiley-Interscience},
	Title = {{Integer Programming}},
	Year = {1998}}

@article{Tarantilis2004,
	Author = {Tarantilis, C. D. and Kiranoudis, C. T. and Vassiliadis, V. S.},
	Doi = {10.1016/S0377-2217(02)00669-0},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Tarantilis, Kiranoudis, Vassiliadis - 2004 - A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing probl.pdf:pdf},
	Isbn = {0377-2217},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {Combinatorial optimization, Distribution, Logistics, Metaheuristics, Routing},
	Number = {1},
	Pages = {148--158},
	Title = {{A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem}},
	Volume = {152},
	Year = {2004},
	Bdsk-Url-1 = {https://doi.org/10.1016/S0377-2217(02)00669-0}}

@article{DePaula2007a,
	Abstract = {Variable neighbourhood search (VNS) is a modern metaheuristic based on systematic changes of the neighbourhood structure within a search to solve optimization problems. The aim of this paper is to propose and analyse a VNS algorithm to solve scheduling problems with parallel machines and sequence-dependent setup times, which are of great importance on the industrial context. Three versions of a greedy randomized adaptive search procedure algorithm are used to compare with the proposed VNS algorithm to highlight its advantages in terms of generality, quality and speed for large instances.},
	Annote = {From Duplicate 1 (Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search - De Paula, Mateus Rocha; Ravetti, M G; Mateus, Geraldo Robson; Pardalos, Panos M) NULL},
	Author = {{De Paula}, Mateus Rocha and Ravetti, M. G. and Mateus, Geraldo Robson and Pardalos, Panos M.},
	Doi = {10.1093/imaman/dpm016},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/De Paula et al. - 2007 - Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood.pdf:pdf},
	Isbn = {1471678X (ISSN)},
	Issn = {1471678X},
	Journal = {IMA Journal Management Mathematics},
	Keywords = {GRASP, Scheduling problems, Variable neighbourhood search},
	Number = {2},
	Pages = {101--115},
	Title = {{Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search}},
	Volume = {18},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1093/imaman/dpm016}}

@article{Alverez-Valdes2001,
	Author = {Alverez-Vald{\'e}s, R. and Crespo, E. and Tamarit, J.M.},
	Journal = {Investigacion Operacional},
	Number = {2},
	Pages = {104--113},
	Title = {{Tabu search: an efficient metaheuristic for university organization problems}},
	Volume = {22},
	Year = {2001}}

@article{Zhu2006,
	Author = {Zhu, G. and Bard, J.F. and Yu, G.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Zhu, Bard, Yu - 2006 - A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem.pdf:pdf},
	Journal = {INFORMS Journal on Computing},
	Keywords = {a project is a, accepted by william cook, accepted november 2004, and analysis of algorithms, area editor for design, branch and cut, history, integer linear programming, multimodes, multiple resources, november 2004, project scheduling, received march 2003, revised may 2004, temporary endeavor undertaken to},
	Number = {3},
	Pages = {377--390},
	Title = {{A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem}},
	Volume = {18},
	Year = {2006}}

@phdthesis{Ravetti2007-2,
	Author = {Ravetti, Mart{\'\i}n G{\'o}mez},
	School = {Universidade Federal de Minas Gerais},
	Title = {{Algoritmos para o Problema de Seq{\{}{\"u}{\}}enciamento com M{\{}{\'a}{\}}quinas Paralelas e Tempos de Prepara{\{}{\c c}{\}}{\{}{\~a}{\}}o Dependentes da Seq{\{}{\"u}{\}}{\{}{\^e}{\}}ncia}},
	Year = {2007}}

@article{Souza2010,
	Abstract = {This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NP-hard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search. The proposed algorithm was tested using a set of real-data problems and the results were validated by running the CPLEX optimizer with the same data. This solver used a mixed integer programming model also developed in this work. The computational experiments show that the proposed algorithm is very competitive, finding near optimal solutions (with a gap of less than 1{\%}) in most instances, demanding short computing times. {\copyright} 2010 Elsevier B.V. All rights reserved.},
	Author = {Souza, M.J.F. J F and Coelho, I.M. M and Ribas, S. and Santos, H.G. G and Merschmann, L.H.C. H C},
	Doi = {10.1016/j.ejor.2010.05.031},
	Issn = {0377-2217},
	Journal = {European Journal of Operational Research},
	Keywords = {{\textless}span style='font-family : courier'{\textgreater}GRASP{\textless}/span{\textgreater}, GRASP, Mathematical programming, Metaheuristics, Open-pit-mining, Variable neighborhood search},
	Number = {2},
	Pages = {1041--1051},
	Title = {{A hybrid heuristic algorithm for the open-pit-mining operational planning problem}},
	Url = {http://www.sciencedirect.com/science/article/pii/S0377221710003875},
	Volume = {207},
	Year = {2010},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0377221710003875},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2010.05.031}}

@article{Pereira2011-2,
	Author = {Pereira, Jordi and Averbakh, Igor},
	Doi = {10.1007/s10479-011-0876-5},
	Issn = {0254-5330},
	Journal = {Annals of Operations Research},
	Keywords = {benders decomposition, branch-and-cut, combinatorial optimization, genetic algorithms, heuristics, minmax regret, optimization, set covering problem},
	Number = {1},
	Pages = {217--235},
	Title = {{The robust set covering problem with interval data}},
	Url = {http://link.springer.com/10.1007/s10479-011-0876-5 http://link.springer.com/article/10.1007/s10479-011-0876-5},
	Volume = {207},
	Year = {2011},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10479-011-0876-5%20http://link.springer.com/article/10.1007/s10479-011-0876-5},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-011-0876-5}}

@inproceedings{Araujo2017,
	Author = {Araujo, J.A.S. and Santos, H.G.},
	Booktitle = {{Computational Science and Its Applications - ICCSA 2017}},
	Keywords = {Chv{\'a}tal-Gomory cuts, Cutting plane algorithms, Project scheduling problem, RCPSP},
	Pages = {452--466},
	Publisher = {Springer},
	Title = {{Separation strategies for chv{\'a}tal-gomory cuts in resource constrained project scheduling problems: A computational study}},
	Year = {2017}}

@incollection{Desrosiers2005,
	Author = {Desrosiers, Jacques and L{\"u}bbecke, Marco E.},
	Booktitle = {{Column Generation}},
	Editor = {Desaulniers, Guy and Desrosiers, Jacques and Solomon, Marius M.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Desrosiers, L{\"{u}}bbecke - 2005 - A Primer in Column Generation.pdf:pdf},
	Pages = {1--32},
	Publisher = {Springer US},
	Title = {{A Primer in Column Generation}},
	Year = {2005}}

@incollection{Gamrath2016,
	Author = {Gamrath, Gerald and Berthold, Timo and Heinz, Stefan and Winkler, Michael},
	Booktitle = {{Optimization in the Real World: Toward Solving Real-World Optimization Problems}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath et al. - 2016 - Structure-Based Primal Heuristics forMixed Integer Programming.pdf:pdf},
	Keywords = {domain propagation, large neighborhood search, primal heuristics},
	Pages = {37--53},
	Title = {{Structure-Based Primal Heuristics forMixed Integer Programming}},
	Year = {2016}}

@article{Avalos-Rosales2015,
	Author = {Avalos-Rosales, Oliver and Angel-Bello, Francisco and Alvarez, Ada},
	Doi = {10.1007/s00170-014-6390-6},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Avalos-Rosales, Angel-Bello, Alvarez - 2015 - Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine s.pdf:pdf},
	Isbn = {0017001463},
	Issn = {0268-3768},
	Journal = {The International Journal of Advanced Manufacturing Technology},
	Keywords = {dependent setup times, makespan, multi-start, scheduling, unrelated parallel machines, vnd},
	Number = {9-12},
	Pages = {1705--1718},
	Title = {{Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times}},
	Url = {http://link.springer.com/10.1007/s00170-014-6390-6},
	Volume = {76},
	Year = {2015},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s00170-014-6390-6},
	Bdsk-Url-2 = {https://doi.org/10.1007/s00170-014-6390-6}}

@article{Campelo2005,
	Author = {Camp{\^e}lo, Manoel and Campos, Victor and Corr{\^e}a, Ricardo},
	Doi = {10.1016/j.endm.2005.05.045},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Camp{\^{e}}lo, Campos, Corr{\^{e}}a - 2005 - On the asymmetric representatives formulation for the vertex coloring problem.pdf:pdf},
	Issn = {15710653},
	Journal = {Electronic Notes in Discrete Mathematics},
	Keywords = {facets of polyhedra, graph coloring, integer programming},
	Month = {jun},
	Pages = {337--343},
	Title = {{On the asymmetric representatives formulation for the vertex coloring problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S1571065305050444},
	Volume = {19},
	Year = {2005},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571065305050444},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.endm.2005.05.045}}

@article{Eiselt1987,
	Author = {Eiselt, H. A. and Laporte, G.},
	Journal = {Journal of Operations Research},
	Number = {9},
	Pages = {785--795},
	Title = {{Combinatorial optimization problems with soft and hard requirements}},
	Volume = {38},
	Year = {1987}}

@article{Hertz1987,
	Author = {Hertz, A. and Werra, D.},
	Journal = {Computing},
	Month = {dec},
	Number = {4},
	Pages = {345--351},
	Title = {{Using tabu search techniques for graph coloring}},
	Volume = {39},
	Year = {1987}}

@article{Rocha2008,
	Abstract = {A scheduling problem with unrelated parallel machines, sequence and machine-dependent setup times, due dates and weighted jobs is considered in this work. A branch-and-bound algorithm (B{\&}B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. We also propose a set of instances for this type of problem. The results are compared to the solutions provided by two mixed integer programming models (MIP) with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.},
	Author = {Rocha, Pedro Leite and Ravetti, Mart{\'\i}n G{\'o}mez and Mateus, Geraldo Robson and Pardalos, Panos M.},
	Doi = {10.1016/j.cor.2006.07.015},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rocha et al. - 2008 - Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setu.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {branch-and-bound, grasp, machine-dependent setups, parallel machines, scheduling, sequence-dependent setups},
	Month = {apr},
	Number = {4},
	Pages = {1250--1264},
	Title = {{Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054806001614},
	Volume = {35},
	Year = {2008},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054806001614},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2006.07.015}}

@article{Tripathy1984,
	Author = {Tripathy, Arabinda},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Tripathy - 1984 - School Timetabling - A Case in Large Binary Integer Linear Programming.pdf:pdf},
	Journal = {Management Science},
	Number = {12},
	Pages = {1473--1489},
	Title = {{School Timetabling - A Case in Large Binary Integer Linear Programming}},
	Volume = {30},
	Year = {1984}}

@article{Balas1975,
	Author = {Balas, E.},
	Journal = {Mathematical Programming},
	Number = {1},
	Pages = {146--164},
	Title = {{Facets of the Knapsack Polytope}},
	Volume = {8},
	Year = {1975}}

@article{Berthold2017,
	Abstract = {The Feasibility Pump (fp) is probably the best known primal heuristic for mixed integer programming. The original work by Fischetti, Glover, and Lodi [24], which introduced the heuristic for 0-1 mixed-integer linear programs, has been succeeded by more than twenty follow-up publications which improve the performance of the fp and extend it to other problem classes. Year 2015 was the tenth anniversary of the first fp publication. The present paper provides an overview of the diverse Feasibility Pump literature that has been presented over the last decade.},
	Author = {Berthold, Timo and Lodi, Andrea and Salvagnin, Domenico},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Berthold, Lodi, Salvagnin - 2017 - Ten years of Feasibility Pump, and counting.pdf:pdf},
	Title = {{Ten years of Feasibility Pump, and counting}},
	Url = {http://www.dei.unipd.it/{~}salvagni/pdf/10yearsFP.pdf},
	Year = {2017},
	Bdsk-Url-1 = {http://www.dei.unipd.it/%7B~%7Dsalvagni/pdf/10yearsFP.pdf}}

@article{Fischetti2005,
	Author = {Fischetti, M. and Glover, F. and Lodi, A.},
	Journal = {Mathematical Programming},
	Pages = {91--104},
	Title = {{The feasibility pump}},
	Volume = {104},
	Year = {2005}}

@article{Operativa2016,
	Author = {Operativa, Ricerca and Wiese, Sven},
	File = {:home/haroldo/Documentos/IntegerProgramming/indicator constraints/On the interplay of Mixed Integer Linear,Mixed Integer Nonlinear and Constraint Programming.pdf:pdf},
	Title = {{On the interplay of Mixed Integer Linear , Mixed Integer Nonlinear and Constraint Programming}},
	Year = {2016}}

@article{Padberg1987,
	Author = {Padberg, M.W. and Rinaldi, G.},
	Journal = {Operations Research Letters},
	Pages = {1--7},
	Title = {{Optimization of a 532-city symmetric traveling salesman problem by branch and cut}},
	Volume = {6},
	Year = {1987}}

@article{M.Groiez2015,
	Author = {{M. Groiez}, G. Desaulniers and Marcotte, O.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/M. Groiez, Marcotte - 2015 - Valid inequalities and separation algorithms for the set partitioning problem.pdf:pdf},
	Isbn = {2550351290},
	Issn = {0705-5846},
	Number = {2004},
	Title = {{Valid inequalities and separation algorithms for the set partitioning problem}},
	Year = {2015}}

@techreport{Haspeslagh2010,
	Address = {KULeuven Campus Kortrijk. Belgium},
	Author = {Haspeslagh, S. and {De Causmaecker}, P. and Stolevik, M. and A., Schaerf.},
	Institution = {CODeS, Department of Computer Science},
	Title = {{First international nurse rostering competition 2010}},
	Year = {2010}}

@article{Muritiba2010,
	Abstract = {We consider a particular bin packing problem in which some pairs of items may be in conflict and cannot be assigned to the same bin. The problem, denoted as the bin packing problem with conflicts, is of practical and theoretical interest because of its many real-world applications and because it generalizes both the bin packing problem and the vertex coloring problem. We present new lower bounds, upper bounds, and an exact approach, based on a set covering formulation solved through a branch-and-price algorithm. We investigate the behavior of the proposed procedures by means of extensive computational results on benchmark instances from the literature.},
	Author = {Muritiba, Albert E.Fernandes and Iori, Manuel and Malaguti, Enrico and Toth, Paolo},
	Doi = {10.1287/ijoc.1090.0355},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Muritiba et al. - 2010 - Algorithms for the bin packing problem with conflicts.pdf:pdf},
	Isbn = {1091-9856},
	Issn = {10919856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {Bin packing with conflicts, Branch and price, Heuristics, Lower bounds, Vertex coloring},
	Number = {3},
	Pages = {401--415},
	Title = {{Algorithms for the bin packing problem with conflicts}},
	Volume = {22},
	Year = {2010},
	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.1090.0355}}

@article{Campelo2008,
	Author = {Camp{\^e}lo, M. and Campos, V.A. and Corr{\^e}a, R.C.},
	Journal = {Discrete Applied Mathematics},
	Number = {1},
	Pages = {1097--1111},
	Title = {{On the asymmetric representatives formulation for the vertex coloring problem}},
	Volume = {156},
	Year = {2008}}

@inproceedings{Brito2011,
	Author = {Brito, S.S. and Santos, H. G.},
	Title = {{Pivoting in the Bron-Kerbosch algorithm for maximum-weight clique detection (in portuguese).}},
	Year = {2011}}

@inproceedings{Soares2015,
	Author = {Soares, J.A. and Santos, H. G. and Baltar, Davi and Toffolo, T.A.M.},
	Booktitle = {{Proceedings of 7th Multidisciplinary International Conference on Scheduling}},
	Pages = {905-----908},
	Title = {{LAHC applied to The Multi-Mode Resource -Constrained Multi-Project Scheduling Problem.}},
	Year = {2015}}

@article{Smith-Miles2012-2,
	Author = {Smith-Miles, Kate and Lopes, Leo},
	Doi = {10.1016/j.cor.2011.07.006},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {Algorithm selection, Assignment problem, Bin-packing, Combinatorial optimization, Graph coloring, Hardness prediction, Instance difficulty, Knapsack problem, Landscape analysis, Phase transition, Timetabling, Traveling salesman problem, testing},
	Mendeley-Tags = {testing},
	Number = {5},
	Pages = {875--889},
	Publisher = {Elsevier},
	Title = {{Measuring instance difficulty for combinatorial optimization problems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
	Volume = {39},
	Year = {2012},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2011.07.006}}

@inproceedings{Leyton-Brown2003,
	Author = {Leyton-Brown, K and Nudelman, Eugene and Andrew, Galen},
	Booktitle = {{Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03)}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Leyton-Brown, Nudelman, Andrew - 2003 - A portfolio approach to algorithm selection.pdf:pdf},
	Pages = {1542--1543},
	Title = {{A portfolio approach to algorithm selection}},
	Url = {http://robotics.stanford.edu/people/shoham/www papers/portfolio-IJCAI03.pdf},
	Year = {2003},
	Bdsk-Url-1 = {http://robotics.stanford.edu/people/shoham/www%20papers/portfolio-IJCAI03.pdf}}

@article{Mitchell2009,
	Author = {Mitchell, Stuart},
	File = {:home/haroldo/Documentos/coin/pulp/PulpForPythonProgrammers.pdf:pdf},
	Journal = {Python Papers Monograph},
	Number = {14},
	Title = {{An Introduction to PuLP for Python Programmers}},
	Volume = {1},
	Year = {2009}}

@phdthesis{Santos2007-2,
	Author = {Santos, H G},
	Title = {{Formula$\backslash$cces e Algoritmos para o Problema de Programa$\backslash$cc{\{}{\~a}{\}}o de Hor{\{}{\'a}{\}}rios em Escolas}},
	Year = {2007}}

@incollection{Cooper1996,
	Address = {London, UK},
	Author = {Cooper, T. and Kingston, J. H.},
	Pages = {283--295},
	Publisher = {Springer-Verlag},
	Series = {{Springer Lecture Notes in Computer Science}},
	Title = {{The complexity of timetable construction problems}},
	Volume = {1153},
	Year = {1996}}

@book{Fischetti2010,
	Abstract = {Modern Mixed-Integer Programming (MIP) solvers exploit a rich arsenal of tools to attack hard problems. It is widely accepted by the OR community that the solution of very hard MIPs can take advantage from the solution of a series of time-consuming auxiliary Linear Programs (LPs) intended to enhance the performance of the overall MIP solver. For instance, auxiliary LPs may be solved to generate powerful disjunctive cuts, or to implement a strong branching policy. Also well established is the fact that finding good-quality heuristic MIP solutions often requires a computing time that is just comparable to that needed to solve the LP relaxations. So, it makes sense to think of a new generation of MIP solvers where auxiliary MIPs (as opposed to LPs) are heuristically solved on the fly, with the aim of bringing the MIP technology under the chest of the MIP solver itself. This leads to the idea of ``translating into a MIP model'' (MIPping) some crucial decisions to be taken within a MIP algorithm (How to cut? How to improve the incumbent solution? Is the current node dominated?). In this paper we survey a number of successful applications of the above approach.},
	Address = {Boston, MA},
	Annote = {From Duplicate 1 (Matheuristics - Fischetti, Matteo; Lodi, Andrea; Salvagnin, Domenico) From Duplicate 1 (Matheuristics - Fischetti, Matteo; Lodi, Andrea; Salvagnin, Domenico) NULL From Duplicate 3 (Matheuristics - Fischetti, Matteo; Lodi, Andrea; Salvagnin, Domenico) NULL},
	Author = {Fischetti, Matteo and Lodi, Andrea and Salvagnin, Domenico},
	Doi = {10.1007/978-1-4419-1306-7},
	Editor = {Maniezzo, Vittorio and St{\"u}tzle, Thomas and Vo{\ss}, Stefan},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi, Salvagnin - 2010 - Matheuristics.pdf:pdf},
	Isbn = {978-1-4419-1305-0},
	Pages = {39--70},
	Publisher = {Springer US},
	Series = {{Annals of Information Systems}},
	Title = {{Matheuristics}},
	Url = {http://www.springerlink.com/index/10.1007/978-1-4419-1306-7},
	Volume = {10},
	Year = {2010},
	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/978-1-4419-1306-7},
	Bdsk-Url-2 = {https://doi.org/10.1007/978-1-4419-1306-7}}

@article{Balas1993,
	Annote = {From Duplicate 2 (A lift-and-project cutting plane algorithm for mixed 0-1 programs - Balas, Egon; Ceria, Sebasti{\'a}n; Cornu{\'e}jols, G{\'e}rard) NULL},
	Author = {Balas, Egon and Ceria, Sebasti{\'a}n and Cornu{\'e}jols, G{\'e}rard},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Balas, Ceria, Cornu{\'{e}}jols - 1993 - A lift-and-project cutting plane algorithm for mixed 0-1 programs.pdf:pdf},
	Journal = {Mathematical Programming},
	Keywords = {Cutting planes, disjunctive programming, mixed 0-1 programming, projection},
	Number = {1-3},
	Pages = {295--324},
	Title = {{A lift-and-project cutting plane algorithm for mixed 0-1 programs}},
	Volume = {58},
	Year = {1993}}

@article{Koulamas1994,
	Author = {Koulamas, C and Antony, S and Jaen, R},
	Doi = {10.1016/0305-0483(94)90006-X},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Koulamas, Antony, Jaen - 1994 - A survey of simulated annealing applications to operations research problems.pdf:pdf},
	Issn = {03050483},
	Journal = {Omega},
	Keywords = {--simulated annealing, facility layout, i, i n t r, lot sizing, o d u c, or researchers are increasingly, qap, routing, scheduling, t i o n, tsp},
	Month = {jan},
	Number = {1},
	Pages = {41--56},
	Title = {{A survey of simulated annealing applications to operations research problems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/030504839490006X},
	Volume = {22},
	Year = {1994},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/030504839490006X},
	Bdsk-Url-2 = {https://doi.org/10.1016/0305-0483(94)90006-X}}

@article{Dietrich1993,
	Abstract = {The authors introduce two general methods for 0-1 program reformulation. Their first method generalizes coefficient reduction, their second method generalizes lifting. Together they provide a unifying interpretation of many previously described automatic reformulation methods. The particular model structures that they consider are individual knapsack constraints, pairs of knapsack constraints, clique and cover induced inequalities, variable upper bounding constraints and capacity expansion constraints. They describe several easy applications of their reformulation procedures. Some computational experience is reported, including the currently best known results on a well-known 147*2655 benchmark problem},
	Author = {Dietrich, B L and Escudero, L F and Chance, F},
	Doi = {10.1016/0166-218X(93)90044-O},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Dietrich, Escudero, Chance - 1993 - Efficient reformulation for 0-1 programs-methods and computational results.pdf:pdf},
	Issn = {0166-218X},
	Journal = {Discrete Applied Mathematics},
	Keywords = {operations research, programming theory},
	Number = {2-3},
	Pages = {147},
	Title = {{Efficient reformulation for 0-1 programs-methods and computational results}},
	Volume = {42},
	Year = {1993},
	Bdsk-Url-1 = {https://doi.org/10.1016/0166-218X(93)90044-O}}

@article{Ferland1992,
	Author = {Ferland, J.A. and Lavoue, A.},
	Journal = {Discrete Applied Mathematics},
	Pages = {237--253},
	Title = {{Exchange procedures for timetabling problems}},
	Year = {1992}}

@incollection{Koster2008,
	Author = {Koster, A. M. C. A. and Orlowski, S. and Raack, C. and Baier, G. and Engel, T.},
	Editor = {Golden, B. and Raghavan, S. and Wasil, E.},
	Pages = {1--23},
	Publisher = {Springer-Verlag},
	Title = {{Single-layer Cuts for Multi-layer Network Design Problems}},
	Volume = {44},
	Year = {2008}}

@techreport{Koch2000,
	Author = {Koch, T. and Martin, A. and Voss, S.},
	Institution = {Zuse Institute Berlin},
	Title = {{SteinLib: An Updated Library on Steiner Tree Problems in Graphs}},
	Year = {2000}}

@article{Artigues2017,
	Abstract = {For non-preemptive scheduling, time-indexed zero--one linear programming formulations have been deeply analyzed. This note clarifies the current knowledge about the strength of these formulations and shows that some formulations that have been proposed ``new'' in the literature are in fact weaker or equivalent to those already known. Much of the arguments used follow from a Ph.D. thesis by Sousa, which has been largely overlooked in the literature.},
	Author = {Artigues, Christian},
	Doi = {10.1016/j.orl.2017.02.001},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Artigues - 2017 - On the strength of time-indexed formulations for the resource-constrained project scheduling problem.pdf:pdf},
	Issn = {01676377},
	Journal = {Operations Research Letters},
	Keywords = {Non-singular transformations, On/off variables, Relaxation strength, Resource-constrained project scheduling, The linear programming, Time-indexed variables},
	Number = {2},
	Pages = {154--159},
	Publisher = {Elsevier B.V.},
	Title = {{On the strength of time-indexed formulations for the resource-constrained project scheduling problem}},
	Url = {http://dx.doi.org/10.1016/j.orl.2017.02.001},
	Volume = {45},
	Year = {2017},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.orl.2017.02.001}}

@article{Hooker1999,
	Abstract = {Linear programming and constraint propagation are complementary techniques with the potential for integration to benefit the solution of combinatorial optimization problems. Attempts to combine them have mainly focused on incorporating either technique into the framework of the other-traditional models have been left intact. We argue that a rethinking of our modeling traditions is necessary to achieve the greatest benefit of such an integration. We propose a declarative modeling framework in which the structure of the constraints indicates how LP and CP can interact to solve the problem},
	Author = {Hooker, J N and Ottosson, G and Thorsteinsson, E S and Hak-Jin, Kim},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Hooker et al. - 1999 - On integrating constraint propagation and linear programming for combinatorial optimization.pdf:pdf},
	Isbn = {0 262 51106 1},
	Journal = {Proceedings Sixteenth National Conference on Artificial Intelligence (AAAI-99). Eleventh Innovative Applications of Artificial Intelligence Conference (IAAI-99), 18-22 July 1999},
	Keywords = {Artificial Intelligence, combinatorial mathematics, constraint handling, integration, linear programming, programming},
	Pages = {136},
	Pmid = {2693},
	Title = {{On integrating constraint propagation and linear programming for combinatorial optimization}},
	Url = {g:{\%}5Cpapers{\%}5Cbasic{\%}5C.pdf},
	Year = {1999}}

@article{Vallsa2005,
	Abstract = {The objective of this paper is to show that justification is a simple technique that can be easily incorporated in diverse algorithms for the resource-constrained project scheduling problem----improving the quality of the schedules generated without generally requiring more computing time. The results of incorporating this technique in 22 different algorithms are shown. Fifteen of the new algorithms that use double justification outperform seven of the best heuristic algorithms that do not use justification. The tests have been performed on the standard test set j120 for the RCPSP generated using ProGen.},
	Author = {Vallsa, Vicente and Ballest{\i}́na, Francisco and Quintanillab, Sacramento},
	Journal = {European Journal of Operational Research},
	Number = {2},
	Pages = {375--386},
	Title = {{Justification and RCPSP: A technique that pays}},
	Volume = {165},
	Year = {2005}}

@article{Lbbecke2005,
	Annote = {From Duplicate 1 (Selected Topics in Column Generation - L{\"u}bbecke, Marco E; Desrosiers, Jacques) NULL},
	Author = {L{\"u}bbecke, Marco E. and Desrosiers, Jacques},
	Doi = {10.1287/opre.1050.0234},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/L{\"{u}}bbecke, Desrosiers - 2005 - Selected Topics in Column Generation.pdf:pdf},
	Issn = {0030-364X},
	Journal = {Operations Research},
	Month = {nov},
	Number = {6},
	Pages = {1007--1023},
	Title = {{Selected Topics in Column Generation}},
	Url = {http://or.journal.informs.org/cgi/doi/10.1287/opre.1050.0234},
	Volume = {53},
	Year = {2005},
	Bdsk-Url-1 = {http://or.journal.informs.org/cgi/doi/10.1287/opre.1050.0234},
	Bdsk-Url-2 = {https://doi.org/10.1287/opre.1050.0234}}

@inproceedings{Abramson1992,
	Author = {Abramson, D. and Abela, J.},
	Title = {{A Parallel Genetic Algorithm for Solving the School Timetabling Problem}},
	Year = {1992}}

@phdthesis{Achterberg2007-2,
	Author = {Achterberg, Tobias},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Achterberg - 2007 - Constraint Integer Programming.pdf:pdf},
	Title = {{Constraint Integer Programming}},
	Year = {2007}}

@article{Letchford2002-2,
	Author = {Letchford, Adam N. and Lodi, Andrea},
	Doi = {10.1016/S0167-6377(02)00112-8},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Letchford, Lodi - 2002 - Strengthening Chv{\'{a}}tal-Gomory cuts and Gomory fractional cuts.pdf:pdf},
	Issn = {01676377},
	Journal = {Operations Research Letters},
	Keywords = {Cutting planes, Integer programming, Valid inequalities},
	Number = {2},
	Pages = {74--82},
	Title = {{Strengthening Chv{\'a}tal-Gomory cuts and Gomory fractional cuts}},
	Volume = {30},
	Year = {2002},
	Bdsk-Url-1 = {https://doi.org/10.1016/S0167-6377(02)00112-8}}

@incollection{Resende2003,
	Author = {Resende, M.G.C. and Ribeiro, C.C.},
	Pages = {219--249},
	Publisher = {Kluwer},
	Title = {{Greedy randomized adaptive search procedures}},
	Year = {2003}}

@article{Pillay2013,
	Author = {Pillay, Nelishia},
	Doi = {10.1007/s10479-013-1321-8},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Pillay - 2013 - A survey of school timetabling research.pdf:pdf},
	Issn = {0254-5330},
	Journal = {Annals of Operations Research},
	Keywords = {educational timetabling, school timetabling},
	Month = {feb},
	Title = {{A survey of school timetabling research}},
	Url = {http://link.springer.com/10.1007/s10479-013-1321-8},
	Year = {2013},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10479-013-1321-8},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-013-1321-8}}

@article{Padberg1973,
	Author = {Padberg, M.W.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Padberg - 1973 - On the facial structure of set packing polyhedra.pdf:pdf},
	Journal = {Mathematical Programming},
	Month = {dec},
	Number = {1},
	Pages = {199--215},
	Title = {{On the facial structure of set packing polyhedra}},
	Volume = {5},
	Year = {1973}}

@article{Birbas1997,
	Author = {Birbas, T. and Daskalaki, S. and Housos, E.},
	Journal = {Journal of the Operational Research Society},
	Pages = {1191--1200},
	Title = {{Timetabling for Greek high schools}},
	Volume = {48},
	Year = {1997}}

@incollection{Lourenco2003,
	Address = {Boston},
	Author = {Lourenco, H. R. and Martin, O. C. and Stutzle, T.},
	Editor = {Glover, F. and Kochenberger, G.},
	Publisher = {Kluwer Academic Publishers},
	Title = {{Iterated Local Search}},
	Year = {2003}}

@inproceedings{Burke2008,
	Author = {Burke, Edmund K. and Bykov, Yuri},
	Booktitle = {{PATAT 2008 Conference, Montreal, Canada}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Burke, Bykov - 2008 - A late acceptance strategy in hill-climbing for exam timetabling problems.pdf:pdf},
	Title = {{A late acceptance strategy in hill-climbing for exam timetabling problems}},
	Url = {http://www.cs.nott.ac.uk/{~}yxb/LAHC/LAHC-PATAT.pdf},
	Year = {2008},
	Bdsk-Url-1 = {http://www.cs.nott.ac.uk/%7B~%7Dyxb/LAHC/LAHC-PATAT.pdf}}

@article{Aiex2002,
	Author = {Aiex, R. M. and Resende, M. G. C. and Ribeiro, C. C.},
	Journal = {Journal of Heuristics},
	Pages = {343--373},
	Title = {{Probability distribuition of solution time in GRASP: an experimental investigation}},
	Volume = {8},
	Year = {2002}}

@article{Johnson1991a,
	Author = {Ritchie, Dennis M. and Johnson, Steven C. and Lesk, Michael E. and Kernighan, Brian W.},
	File = {:home/haroldo/Documentos/programming/c/The C programming Language - ritchie1978.pdf:pdf},
	Journal = {The Bell System Technical Journal},
	Number = {6},
	Pages = {1991-----2019},
	Title = {{Unix time-sharing system: The C programming language}},
	Volume = {57},
	Year = {1978}}

@techreport{Sandholm2006,
	Abstract = {Nogood learning has proven to be an effective CSP technique critical to success in today's top SAT solvers. We extend the technique for use in integer programming and mixed integer programming. Our technique generates globally valid cutting planes for the 0-1 IP search algorithm from information learned through constraint propagation (bounds propagation). Nogoods (cutting planes) are generated not only from infeasibility but also from bounding. All of our techniques are geared toward yielding tighter LP upper bounds, and thus smaller search trees. Experiments suggest that our nogood learning does not help in integer programming because few cutting planes are generated, and they are weak. We explain why, and identify problem characteristics that affect the effectiveness. We show how problem structure, such as mutual exclusivity of indicator variables, or at least one of a set of indicator variables having to be ``on'', can be used to enhance the technique. We show this also for instances that exhibit multiple occurrences of each of the two structures. We then generalize the technique to mixed-integer programming. Then we compare our techniques to Achterberg's parallel invention of an almost identical approach. This comparison yields conclusions about what techniques within the nogood learning framework for (mixed) integer programming are essential for obtaining speedup. Finally, we lay out several directions for future research down this new and potentially promising avenue.},
	Author = {Sandholm, Tuomas and Shields, Rob},
	Booktitle = {{CMU-CS-06-155}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Sandholm, Shields - 2006 - Nogood Learning for Mixed Integer Programming.pdf:pdf},
	Institution = {School of Computer Science Carnegie Mellon University},
	Title = {{Nogood Learning for Mixed Integer Programming}},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.7709{\%}5Cnhttp://reports-archive.adm.cs.cmu.edu/anon/anon/usr0/ftp/2006/CMU-CS-06-155.pdf},
	Year = {2006}}

@article{Atamturk2000,
	Author = {Atamt{\"u}rk, A. and Nemhauser, G. L. and Savelsbergh, M. W. P},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Atamt{\"{u}}rk, Nemhauser, Savelsbergh - 2000 - Conflict graphs in solving integer programming problems.pdf:pdf},
	Journal = {European Journal of Operational Research},
	Pages = {40--55},
	Title = {{Conflict graphs in solving integer programming problems}},
	Volume = {121},
	Year = {2000}}

@phdthesis{Mata1989a,
	Address = {Rio de Janeiro, Brasil},
	Author = {Mata, S.S.},
	Title = {{The High School Timetabling Problem: Modeling and Implementation (in portuguese)}},
	Year = {1989}}

@misc{COIN-OR2013,
	Author = {COIN-OR},
	Title = {{COIN-OR CBC Developers Team}},
	Url = {https://projects.coin-or.org/Cbc/wiki/CbcTeam},
	Year = {2013},
	Bdsk-Url-1 = {https://projects.coin-or.org/Cbc/wiki/CbcTeam}}

@book{Souza2017,
	Abstract = {{\copyright} Springer International Publishing AG 2017. In the Generalized Assignment Problem, tasks must be allocated to machines with limited resources, in order to minimize processing costs. This problem has several industrial applications and often appears as substructure of other combinatorial optimization problems. By harnessing the massive computational power of Graphics Processing Units in a Scatter Search metaheuristic framework, we propose a method that efficiently generates a solution pool using a Tabu list criteria and an Ejection Chain mechanism. Common characteristics are extracted from the pool and solutions are combined by exploring a restricted search space, as a Binary Programming model. Classic instances vary from 100--1600 jobs and 5--80 agents, but due to the big amount of optimal and near-optimal solutions found by our method, we propose novel large-sized instances up to 9000 jobs and 600 agents. Results indicate that the method is competitive with state-of-the-art algorithms in literature.},
	Author = {Souza, D.S. and Santos, H.G. and Coelho, I.M. and Araujo, J.A.S.},
	Booktitle = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
	Doi = {10.1007/978-3-319-62392-4_10},
	Isbn = {9783319623917},
	Issn = {16113349},
	Keywords = {Binary programming, Ejection chain, Generalized assignment problem, Scatter search, Tabu search},
	Title = {{A hybrid CPU-GPU scatter search for large-sized generalized assignment problems}},
	Volume = {10404 LNCS},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-62392-4_10}}

@incollection{Bergner2011,
	Annote = {From Duplicate 1 (Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation - Bergner, Martin; Caprara, Alberto; Furini, Fabio; Malaguti, Enrico; Traversi, Emiliano) NULL},
	Author = {Bergner, Martin and Caprara, Alberto and Furini, Fabio and Malaguti, Enrico and Traversi, Emiliano},
	Booktitle = {{Integer Programming and Combinatoral Optimization}},
	Editor = {G{\"u}nl{\"u}k, Oktay and Woeginger, Gerhard J},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bergner et al. - 2011 - Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.pdf:pdf},
	Pages = {39--51},
	Publisher = {Springer Berlin Heidelberg},
	Title = {{Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation}},
	Year = {2011}}

@article{Achterberg2016,
	Author = {Achterberg, Tobias and {Robert E. Bixby} and Gu, Zonghao and Rothberg, Edward and Weninger, Dieter},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Achterberg et al. - 2016 - Presolve Reductions in Mixed Integer Programming.pdf:pdf},
	Number = {September},
	Title = {{Presolve Reductions in Mixed Integer Programming}},
	Volume = {44},
	Year = {2016}}

@article{Lougee-Heimer2003,
	Abstract = {The Common Optimization INterface for Operations Research (COIN-OR, http://www.coin-or.org/) is an initiative to promote open-source software for the operations research (OR) community. In OR practice and research, software is fundamental. The dependence of OR on software implies that the ways in which software is developed, managed, and distributed can have a significant impact on the field. Open source is a relatively new software development and distribution model which offers advantages over current practices. Its viability depends on the precise definition of open source, on the culture of a distributed developer community, and on a version-control system which makes distributed development possible. In this paper, we review open-source philosophy and culture, and present the goals and status of COIN-OR.},
	Author = {Lougee-Heimer, R.},
	Journal = {IBM Journal of Research and Development},
	Number = {1},
	Pages = {57--66},
	Title = {{The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community}},
	Volume = {47},
	Year = {2003}}

@article{Ochoa2014,
	Archiveprefix = {arXiv},
	Arxivid = {arXiv:1402.2959v1},
	Author = {Ochoa, Gabriela and Verel, Sebastien and Daolio, Fabio and Tomassini, Marco},
	Doi = {10.1007/978-3-642-41888-4_9},
	Eprint = {arXiv:1402.2959v1},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ochoa et al. - 2014 - Local Optima Networks A New Model of Combinatorial Fitness Landscapes.pdf:pdf},
	Isbn = {978-3-642-41887-7},
	Journal = {Recent Advances in the Theory and Application of Fitness Landscapes},
	Keywords = {basin of attraction, combinatorial optimization, complex networks, fitness landscapes, local optima, nk landscapes, quadratic assignment problem},
	Pages = {233--262},
	Title = {{Local Optima Networks: A New Model of Combinatorial Fitness Landscapes}},
	Url = {http://dx.doi.org/10.1007/978-3-642-41888-4{\_}9},
	Volume = {6},
	Year = {2014},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-642-41888-4%7B%5C_%7D9},
	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-3-642-41888-4_9}}

@article{Hansen2006a,
	Annote = {From Duplicate 2 (First vs. best improvement: An empirical study - Hansen, Pierre; Mladenovi{\'c}, Nenad) NULL},
	Author = {Hansen, Pierre and Mladenovi{\'c}, Nenad},
	Doi = {10.1016/j.dam.2005.05.020},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Hansen, Mladenovi{\'{c}} - 2006 - First vs. best improvement An empirical study.pdf:pdf},
	Issn = {0166218X},
	Journal = {Discrete Applied Mathematics},
	Keywords = {heuristic, metaheuristic, travelling salesman, variable neighborhood search},
	Number = {5},
	Pages = {802--817},
	Title = {{First vs. best improvement: An empirical study}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X05003070},
	Volume = {154},
	Year = {2006},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X05003070},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.dam.2005.05.020}}

@article{Forrest2005,
	Author = {Forrest, J. and Lougee-Heimer, R.},
	Journal = {INFORMS Tutorials in Operations Research.},
	Pages = {257--277},
	Title = {{CBC User Guide}},
	Year = {2005}}

@article{Peng2011,
	Abstract = {We derive the ranking of the astronomical observatories with the highest impact in astronomy based on the citation analysis of papers published in 2006. We also present a description of the methodology we use to derive this ranking. The current ranking is lead by the Sloan Digital Sky Survey, followed by Swift and the Hubble Space Telescope.},
	Archiveprefix = {arXiv},
	Arxivid = {0901.4552},
	Author = {Peng, R.D.},
	Eprint = {0901.4552},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Peng - 2011 - Reproducible Research in Computational Science.pdf:pdf},
	Journal = {Sience},
	Pages = {1226--1227},
	Title = {{Reproducible Research in Computational Science}},
	Url = {http://arxiv.org/abs/0901.4552},
	Volume = {334},
	Year = {2011},
	Bdsk-Url-1 = {http://arxiv.org/abs/0901.4552}}

@article{Fritzen2012-2,
	Author = {Fritzen, Paulo C{\'\i}cero and Zauk, Jo{\~a}o Montagner and Cardoso, Ghendy and Oliveira, A{\'e}cio De Lima and de Ara{\'u}jo, Olinto C{\'e}sar Bassi},
	Doi = {10.1016/j.epsr.2012.04.002},
	Issn = {03787796},
	Journal = {Electric Power Systems Research},
	Pages = {55--66},
	Publisher = {Elsevier B.V.},
	Title = {{Hybrid system based on constructive heuristic and integer programming for the solution of problems of fault section estimation and alarm processing in power systems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
	Volume = {90},
	Year = {2012},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.epsr.2012.04.002}}

@article{Gorissen2015,
	Abstract = {Robust optimization is a young and active research field that has been mainly developed in the last 15 years. Robust optimization is very useful for practice, since it is tailored to the information at hand, and it leads to computationally tractable formulations. It is therefore remarkable that real-life applications of robust optimization are still lagging behind; there is much more potential for real-life applications than has been exploited hitherto. The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice. We use many small examples to illustrate our discussions.},
	Author = {Gorissen, Bram L and Yan{\i}ko{\u g}lu, {\.I}hsan and {Dick Den Hertog}, @bullet},
	Doi = {10.1016/j.omega.2014.12.006},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gorissen, Yan{\i}ko{\u g}lu, Dick Den Hertog - 2015 - A Practical Guide to Robust Optimization.pdf:pdf},
	Journal = {Omega},
	Pages = {124 -- 137},
	Title = {{A Practical Guide to Robust Optimization}},
	Volume = {53},
	Year = {2015},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.omega.2014.12.006}}

@article{RainerKolischandArnoSprecher1997,
	Author = {{Rainer Kolisch and Arno Sprecher}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rainer Kolisch and Arno Sprecher - 1997 - PSPLIB - A project scheduling problem library.pdf:pdf; :home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rainer Kolisch and Arno Sprecher - 1997 - PSPLIB - A project scheduling problem library.html:html},
	Journal = {European Journal of Operational Research},
	Number = {1},
	Pages = {205--216},
	Title = {{PSPLIB - A project scheduling problem library}},
	Url = {http://129.187.106.231/webdata/publikationen/Kolisch-S-96.pdf},
	Volume = {96},
	Year = {1997},
	Bdsk-Url-1 = {http://129.187.106.231/webdata/publikationen/Kolisch-S-96.pdf}}

@article{Orlowski2010,
	Author = {Orlowski, S. and Wess{\"a}ly, R. and Pi{\'o}ro, M. and Tomaszewski, A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Orlowski et al. - 2010 - SNDlib 1.0 - Survivable Network Design Library.pdf:pdf},
	Journal = {Networks},
	Number = {3},
	Pages = {276-----286},
	Title = {{SNDlib 1.0 - Survivable Network Design Library}},
	Volume = {55},
	Year = {2010}}

@article{Schaerf1999a,
	Author = {Schaerf, A.},
	Journal = {Artificial Intelligence Review},
	Number = {2},
	Pages = {87--127},
	Title = {{A Survey of Automated Timetabling}},
	Volume = {13},
	Year = {1999}}

@article{Dunning2015,
	Author = {Dunning, Iain and Huchette, Joey and Lubin, Miles},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Dunning, Huchette, Lubin - 2015 - JuMP A Modeling Language for Mathematical Optimization.pdf:pdf},
	Journal = {SIAM Review},
	Number = {2},
	Pages = {295--320},
	Title = {{JuMP: A Modeling Language for Mathematical Optimization}},
	Volume = {59},
	Year = {2017}}

@article{Fischetti2014,
	Author = {Fischetti, M. and Monaci, M.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Monaci - 2014 - Exploiting Erraticism in Search.pdf:pdf},
	Journal = {Operations Research},
	Number = {1},
	Pages = {114--122},
	Title = {{Exploiting Erraticism in Search}},
	Volume = {62},
	Year = {2014}}

@techreport{Achterberg2011,
	Author = {Achterberg, T. and Berthold, T. and Hendel, G.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Achterberg, Berthold, Hendel - 2011 - Rounding and Propagation Heuristics for Mixed Integer Programming.pdf:pdf},
	Institution = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin},
	Number = {July},
	Title = {{Rounding and Propagation Heuristics for Mixed Integer Programming}},
	Volume = {29},
	Year = {2011}}

@article{Daskalaki2004a,
	Author = {Daskalaki, S.},
	Journal = {European Journal of Operational Research},
	Pages = {117--135},
	Title = {{An integer progamming formulation for a case study in university timetabling}},
	Volume = {153},
	Year = {2004}}

@article{Souza2004,
	Author = {Souza, M.J.F. and Cardoso, L.X.T. and Silva, G.P. and Rodrigues, M.M.S. and Mapa, S.M.S.},
	Journal = {Tend{\^e}ncias em Matem{\'a}tica Aplicada e Computacional},
	Pages = {357--368},
	Title = {{Metaheur{\'\i}sticas Aplicadas ao Problema de Programa$\backslash$cc{\~a}o de Tripula$\backslash$cc{\~o}es no Sistema de Transporte P{\'u}blico}},
	Volume = {5},
	Year = {2004}}

@article{Herroelen1998,
	Author = {Herroelen, Willy and {De Reyck}, Bert and Demeulemeester, Erik},
	Doi = {10.1016/S0305-0548(97)00055-5},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Herroelen, De Reyck, Demeulemeester - 1998 - Resource-constrained project scheduling A survey of recent developments.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Month = {apr},
	Number = {4},
	Pages = {279--302},
	Title = {{Resource-constrained project scheduling: A survey of recent developments}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054897000555},
	Volume = {25},
	Year = {1998},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054897000555},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0305-0548(97)00055-5}}

@misc{CenterforHistoryandNewMedia-2,
	Annote = {Bem-vindo(a) a Zotero! Veja o Guia r{\{}{\'a}{\}}pido para aprender a como come{\{}{\c c}{\}}ar a coletar, gerenciar, citar e partilhar suas fontes de pesquisa. Obrigado por instalar Zotero.},
	Author = {{Center for History and New Media}},
	Title = {{Guia de In{\{}{\'\i}{\}}cio R{\{}{\'a}{\}}pido}},
	Url = {http://zotero.org/support/quick{\%}7B{\_}{\%}7Dstart{\%}7B{\_}{\%}7Dguide}}

@phdthesis{Eso1999a,
	Annote = {From Duplicate 1 (Parallel branch and cut for set partitioning - Eso, Marta) NULL},
	Author = {Eso, Marta},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Eso - 1999 - Parallel branch-and-cut for set partitioning.pdf:pdf},
	School = {Cornell},
	Title = {{Parallel branch and cut for set partitioning}},
	Year = {1999}}

@article{Lawrie1969,
	Author = {Lawrie, N.L.},
	Journal = {Computer Journal},
	Pages = {307--316},
	Title = {{An integer linear programming model of a school timetabling problem}},
	Volume = {12},
	Year = {1969}}

@article{Schaerf1999,
	Author = {Schaerf, A.},
	Journal = {IEEE Transactions on Systems, Man and Cybernetics Part A:systems and Humans},
	Month = {jul},
	Number = {4},
	Pages = {368--377},
	Title = {{Local search techniques for large high school timetabling problems}},
	Volume = {29},
	Year = {1999}}

@incollection{Birattari2007,
	Address = {Boston, MA},
	Author = {Birattari, Mauro and Balaprakash, Prasanna and Dorigo, Marco},
	Chapter = {The ACO/F-},
	Doi = {10.1007/978-0-387-71921-4_10},
	Editor = {Doerner, Karl F and Gendreau, Michel and Greistorfer, Peter and Gutjahr, Walter and Hartl, Richard F and Reimann, Marc},
	Isbn = {978-0-387-71921-4},
	Pages = {189--203},
	Publisher = {Springer US},
	Title = {{Metaheuristics: Progress in Complex Systems Optimization}},
	Url = {http://dx.doi.org/10.1007/978-0-387-71921-4{\_}10},
	Year = {2007},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-0-387-71921-4%7B%5C_%7D10},
	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-0-387-71921-4_10}}

@article{Achterberg2006,
	Author = {Achterberg, T. and Koch, T. and Martin, A.},
	Journal = {Operations Research Letters},
	Number = {4},
	Pages = {1--12},
	Title = {{MIPLIB 2003}},
	Volume = {34},
	Year = {2006}}

@article{Boschetti2007-2,
	Author = {Boschetti, Marco and Maniezzo, Vittorio},
	Doi = {10.1007/s10732-007-9064-9},
	Issn = {1381-1231},
	Journal = {Journal of Heuristics},
	Keywords = {benders, combinatorial optimization, decomposition, lagrangean relaxation, metaheuristic, s},
	Number = {3},
	Pages = {283--312},
	Title = {{Benders decomposition, Lagrangean relaxation and metaheuristic design}},
	Url = {http://link.springer.com/10.1007/s10732-007-9064-9},
	Volume = {15},
	Year = {2007},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-007-9064-9},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-007-9064-9}}

@article{Bixby2002,
	Abstract = {This paper is an invited contribution to the 50th anniversary issue of the journal Operations Research, published by the Institute of Operations Research and Management Science (INFORMS). It describes one persons perspective on the development of computational tools for linear programming. The paper begins with a short, personal history, followed by historical remarks covering the some 40 years of linear-programming developments that predate my own involvement in this subject. It concludes with a more detailed look at the evolution of computational linear programming since 1987. 2},
	Author = {Bixby, Robert E.},
	Doi = {10.1287/opre.50.1.3.17780},
	File = {:home/haroldo/Documentos/LinearProgramming/history/solving real-world linear programs$\backslash$: a decade and more of progress.pdf:pdf},
	Issn = {0030364X},
	Journal = {Operations Research},
	Number = {1},
	Pages = {3--15},
	Title = {{Solving real-world linear programs: A decade and more of progress}},
	Volume = {50},
	Year = {2002},
	Bdsk-Url-1 = {https://doi.org/10.1287/opre.50.1.3.17780}}

@article{Andrade2017,
	Abstract = {We present a new framework for finding feasible solutions to mixed integer programs (MIP). We use the feasibility pump heuristic coupled to a biased random-key genetic algorithm (BRKGA). The feasibility pump heuristic attempts to find a feasible solution to a MIP by first rounding a solution to the linear programming (LP) relaxation to an integer (but not necessarily feasible) solution and then projecting it to a feasible solution to the LP relaxation. The BRKGA is able to build a pool of projected and rounded but not necessarily feasible solutions and to combine them using information from previous projections. This information is also used to fix variables during the process to speed up the solution of the LP relaxations, and to reduce the problem size in enumeration phases. Experimental results show that this approach is able to find feasible solutions for instances where the original feasibility pump or a commercial mixed integer programming solver often fail.},
	Author = {Andrade, Carlos E. and Ahmed, Shabbir and Nemhauser, George L. and Shao, Yufen},
	Doi = {10.1016/j.ejor.2017.05.003},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Andrade et al. - 2017 - A hybrid primal heuristic for finding feasible solutions to mixed integer programs.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {Feasibility, Integer programming, Primal heuristics},
	Number = {1},
	Pages = {62--71},
	Publisher = {Elsevier B.V.},
	Title = {{A hybrid primal heuristic for finding feasible solutions to mixed integer programs}},
	Volume = {263},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.ejor.2017.05.003}}

@inproceedings{Caldeira1997,
	Address = {Toronto},
	Author = {Caldeira, J. and Agostinho, C.},
	Pages = {115--122},
	Title = {{School Timetabling Using Genetic Search}},
	Year = {1997}}

@misc{Kendall2013,
	Author = {Kendall, G. and McCollum, B. and Berghe, G.V.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kendall, McCollum, Berghe - 2013 - MISTA 2013 Challenge.pdf:pdf},
	Title = {{MISTA 2013 Challenge}},
	Url = {http://allserv.kahosl.be/mista2013challenge/},
	Year = {2013},
	Bdsk-Url-1 = {http://allserv.kahosl.be/mista2013challenge/}}

@article{Burke2011,
	Author = {Burke, E.L. and Mare$\backslash$vcek, K. and Parkes, A. J. and Rudov{\'a}, H.},
	Doi = {10.1007/s10479-010-0828-5},
	Journal = {Ann. Oper. Res.},
	Pages = {1--17},
	Title = {{A Branch-and-cut Procedure for the Udine Course Timetabling Problem}},
	Url = {http://cs.nott.ac.uk/ jxm/timetabling/patat2008-paper.pdf},
	Year = {2011},
	Bdsk-Url-1 = {http://cs.nott.ac.uk/%20jxm/timetabling/patat2008-paper.pdf},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-010-0828-5}}

@article{Yagiura2006-2,
	Author = {Yagiura, Mutsunori and Kishida, Masahiro and Ibaraki, Toshihide},
	Doi = {10.1016/j.ejor.2004.10.018},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {lagrangian relaxation, large neighborhood, metaheuristics, set covering problem, strategic oscillation},
	Number = {2},
	Pages = {472--499},
	Title = {{A 3-flip neighborhood local search for the set covering problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
	Volume = {172},
	Year = {2006},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2004.10.018}}

@article{Santos2013-2,
	Author = {Santos, Dorabella and de Sousa, Amaro and Alvelos, Filipe},
	Doi = {10.1016/j.cor.2013.05.006},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {Column generation, Hybrid meta-heuristics, Network load balancing, grasp with path relinking},
	Pages = {1--12},
	Publisher = {Elsevier},
	Title = {{A hybrid column generation with GRASP and path relinking for the network load balancing problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
	Year = {2013},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2013.05.006}}

@inproceedings{Kezunovic2009,
	Author = {Kezunovic, M. and Guan, Yufan},
	Booktitle = {{HICSS '09. 42nd Hawaii International Conference on System Sciences}},
	Doi = {10.1109/HICSS.2009.268},
	Pages = {1--8},
	Title = {{Intelligent Alarm Processing: From Data Intensive to Information Rich}},
	Year = {2009},
	Bdsk-Url-1 = {https://doi.org/10.1109/HICSS.2009.268}}

@article{Monaci2006-2,
	Author = {Monaci, Michele and Toth, Paolo},
	Doi = {10.1287/ijoc.1040.0089},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {column genera-, heuristics, set-covering, tion, two-constraint bin packing, two-dimensional bin packing},
	Number = {1},
	Pages = {71--85},
	Title = {{A set-covering-based heuristic approach for bin-packing problems}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1040.0089 http://joc.journal.informs.org/content/18/1/71.short},
	Volume = {18},
	Year = {2006},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1040.0089%20http://joc.journal.informs.org/content/18/1/71.short},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1040.0089}}

@techreport{Danna2003a,
	Author = {Danna, E. and Rothberg, E. and {Le Pape}, C.},
	Institution = {ILOG},
	Title = {{Exploring relaxation induced neighborhoods to improve MIP solutions}},
	Year = {2003}}

@article{Lewis2007,
	Author = {Lewis, R. and Paechter, B. and McCollum, B.},
	Journal = {Working paper, available at: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.63.5962{\&}rep=rep1{\&}type=pdf},
	Title = {{Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition}},
	Year = {2007}}

@article{Asta2015,
	Abstract = {Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search framework. At each step, the solution in hand is modified after applying a selected heuristic and a decision is made whether the new solution is accepted or not. In this study, we represent the trail of a hyper-heuristic as a third order tensor. Factorization of such a tensor reveals the latent relationships between the low level heuristics and the hyper-heuristic itself. The proposed learning approach partitions the set of low level heuristics into two subsets where heuristics in each subset are associated with a separate move acceptance method. Then a multi-stage hyper-heuristic is formed and while solving a given problem instance, heuristics are allowed to operate only in conjunction with the associated acceptance method at each stage. To the best of our knowledge, this is the first time tensor analysis of the space of heuristics is used as a data science approach to improve the performance of a hyper-heuristic in the prescribed manner. The empirical results across six different problem domains from a benchmark indeed indicate the success of the proposed approach.},
	Author = {Asta, Shahriar and {\"O}zcan, Ender},
	Doi = {10.1016/j.ins.2014.12.020},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Asta, {\"{O}}zcan - 2015 - A tensor-based selection hyper-heuristic for cross-domain heuristic search.pdf:pdf},
	Issn = {00200255},
	Journal = {Information Sciences},
	Keywords = {Algorithm selection, Data science, Hyper-heuristic, Machine learning, Move acceptance, Tensor analysis},
	Pages = {412--432},
	Publisher = {Elsevier Inc.},
	Title = {{A tensor-based selection hyper-heuristic for cross-domain heuristic search}},
	Url = {http://www.sciencedirect.com/science/article/pii/S0020025514011591},
	Volume = {299},
	Year = {2015},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0020025514011591},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ins.2014.12.020}}

@article{Bischl2016,
	Author = {Bischl, B. and Kerschke, P. and Kotthoff, L. and Lindauer, M. and Malitsky, Y. and Fr{\'e}chette, A. and Hoos, H. and Hutter, F. and Leyton-Brown, K. and Tierney, K. and Vanschoren, J.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bischl et al. - 2016 - ASlib A benchmark library for algorithm selection.pdf:pdf},
	Journal = {Artificial Intelligence},
	Pages = {41--58},
	Title = {{ASlib: A benchmark library for algorithm selection}},
	Volume = {237},
	Year = {2016}}

@misc{TheMendeleySupportTeam2011,
	Abstract = {A quick introduction to Mendeley. Learn how Mendeley creates your personal digital library, how to organize and annotate documents, how to collaborate and share with colleagues, and how to generate citations and bibliographies.},
	Address = {London},
	Annote = {From Duplicate 2 (Getting Started with Mendeley - The Mendeley Support Team) NULL From Duplicate 4 (Getting Started with Mendeley - The Mendeley Support Team) From Duplicate 1 ( Getting Started with Mendeley - The Mendeley Support Team ) And Duplicate 2 ( Getting Started with Mendeley - The Mendeley Support Team ) And Duplicate 5 ( Getting Started with Mendeley - The Mendeley Support Team ) And Duplicate 6 ( Getting Started with Mendeley - The Mendeley Support Team ) },
	Author = {{The Mendeley Support Team}},
	Booktitle = {{Mendeley Desktop}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/The Mendeley Support Team - 2011 - Getting Started with Mendeley.pdf:pdf},
	Keywords = {Mendeley, how-to, user manual},
	Pages = {1--16},
	Publisher = {Mendeley Ltd.},
	Title = {{Getting Started with Mendeley}},
	Url = {http://www.mendeley.com},
	Year = {2011},
	Bdsk-Url-1 = {http://www.mendeley.com}}

@article{Daskalaki2004,
	Author = {Daskalaki, S. and Birbas, T. and Housos, E.},
	Doi = {10.1016/S0377-2217(03)00103-6},
	Issn = {0377-2217},
	Journal = {European Journal of Operational Research},
	Keywords = {Timetabling},
	Mendeley-Tags = {Timetabling},
	Number = {1},
	Pages = {117--135},
	Title = {{An integer programming formulation for a case study in university timetabling}},
	Volume = {153},
	Year = {2004},
	Bdsk-Url-1 = {https://doi.org/10.1016/S0377-2217(03)00103-6}}

@book{MichaelD.Meyer2009,
	Abstract = {This state-of-the-art handbook provides transportation professionals with a basic day-to- day reference source on the guidelines and proven techniques in the practice of transportation planning. It features in-depth coverage of: activity center systems, surface transportation, interface areas, legal and regulatory considerations, and intelligent vehicle highway systems (IVHS). An ideal reference for those involved in transportation planning.},
	Edition = {3},
	Editor = {{Michael D. Meyer}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - 2009 - Transportation Planning Handbook.pdf:pdf},
	Isbn = {1-933452-44-7},
	Pages = {1043},
	Publisher = {Institute of Transportation Engineers},
	Title = {{Transportation Planning Handbook}},
	Year = {2009}}

@article{Xy2003,
	Author = {Xy, J. and Li, M. and Kim, D. and Xu, Y.},
	Journal = {Journal of Bioinformatics and Computational Biology},
	Number = {1},
	Pages = {95--117},
	Title = {{RAPTOR: optimal protein threading by linear programming}},
	Volume = {1},
	Year = {2003}}

@article{Fischetti2009,
	Abstract = {Abstract Finding a feasible solution of a given mixed-integer programming (MIP) model is a very important {\$}{\$}{\{}$\backslash$mathcal{\{}NP{\}}{\}}{\$}{\$} -complete problem that can be extremely hard in practice. Feasibility Pump (FP) is a heuristic scheme for finding a feasible$\backslash$nsolution to general MIPs that can be viewed as a clever way to round a sequence of fractional solutions of the LP relaxation,$\backslash$nuntil a feasible one is eventually found. In this paper we study the effect of replacing the original rounding function (which$\backslash$nis fast and simple, but somehow blind) with more clever rounding heuristics. In particular, we investigate the use of a diving-like$\backslash$nprocedure based on rounding and constraint propagation---a basic tool in Constraint Programming. Extensive computational results$\backslash$non binary and general integer MIPs from the literature show that the new approach produces a substantial improvement of the$\backslash$nFP success rate, without slowing-down the method and with a significantly better quality of the feasible solutions found.},
	Author = {Fischetti, Matteo and Salvagnin, Domenico},
	Doi = {10.1007/s12532-009-0007-3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2009 - Feasibility pump 2.0.pdf:pdf},
	Isbn = {1867-2949},
	Issn = {18672949},
	Journal = {Mathematical Programming Computation},
	Keywords = {Constraint programming, Constraint propagation, Mixed-integer programming, Primal heuristics},
	Number = {2-3},
	Pages = {201--222},
	Title = {{Feasibility pump 2.0}},
	Volume = {1},
	Year = {2009},
	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-009-0007-3}}

@book{Grotschel1993,
	Author = {Grotschel, M. and Lovasz, L. and Schrijver, A.},
	Publisher = {Springer},
	Title = {{Geometric Algorithms and Combinatorial Optimization}},
	Year = {1993}}

@inproceedings{Ceschia2014,
	Address = {York},
	Author = {Ceschia, S. and Thi, N. and Causmaecker, D.P.},
	Booktitle = {{Proceedings of 10th International Conference on the Practice and Theory of Automated Timetabing}},
	Editor = {{Ender {\"O}zcan, Edmund K. Burke}, Barry McCollum},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ceschia, Thi, Causmaecker - 2014 - The second International Nurse Rostering Competition.pdf:pdf},
	Pages = {554--556},
	Title = {{The second International Nurse Rostering Competition}},
	Year = {2014}}

@article{Pecin2017,
	Author = {Pecin, D. and Pessoa, A. and Poggi, M. and Uchoa, E. and Santos, H.},
	Journal = {Operations Research Letters},
	Keywords = {Branch-cut-and-price algorithms, Polyhedral combinatorics, Set Partitioning},
	Number = {3},
	Pages = {206--209},
	Title = {{Limited memory Rank-1 Cuts for Vehicle Routing Problems}},
	Volume = {45},
	Year = {2017}}

@article{Doig1960,
	Author = {Doig, A. H. Land and G., A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Doig - 1960 - An Automatic Method of Solving Discrete Programming Problems.pdf:pdf},
	Journal = {Econometrica},
	Number = {3},
	Pages = {497--520},
	Title = {{An Automatic Method of Solving Discrete Programming Problems}},
	Volume = {28},
	Year = {1960}}

@article{Atamtrk2002,
	Author = {Atamt{\"u}rk, Alper},
	Doi = {10.1007/s101070100284},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Atamt{\"{u}}rk - 2002 - On capacitated network design cut-set polyhedra.pdf:pdf},
	Isbn = {1010701002},
	Issn = {0025-5610},
	Journal = {Mathematical Programming},
	Keywords = {facets, multicommodity flows, network design},
	Month = {may},
	Number = {3},
	Pages = {425--437},
	Title = {{On capacitated network design cut-set polyhedra}},
	Url = {http://link.springer.com/10.1007/s101070100284},
	Volume = {92},
	Year = {2002},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s101070100284},
	Bdsk-Url-2 = {https://doi.org/10.1007/s101070100284}}

@article{Awadallah2017,
	Abstract = {? 2015 The Natural Computing Applications ForumThis paper proposes a hybrid harmony search algorithm (HHSA) for solving the highly constrained nurse rostering problem (NRP). The NRP is a combinatorial optimization problem tackled by assigning a set of shifts to a set of nurses; each has specific skills and work contract, to a predefined rostering period according to a set of constraints. The harmony search is a metaheuristic approach, where the metaheuristics are the most successful methods for tackling this problem. In HHSA, the harmony search algorithm is hybridized with the hill climbing optimizer to empower its exploitation capability. Furthermore, the memory consideration operator of the HHSA is modified by replacing the random selection scheme with the global-best concept of particle swarm optimization to accelerate its convergence rate. The standard dataset published in the first international nurse rostering competition 2010 (INRC2010) was utilized to evaluate the proposed HHSA. Several convergence scenarios have been employed to study the effects of the two HHSA modifications. Finally, a comparative evaluation against twelve other methods that worked on the INRC2010 dataset is carried out. The experimental results show that the proposed method achieved five new best results, and 33 best published results out of 69 instances as achieved by other comparative methods.},
	Author = {Awadallah, Mohammed A. and Al-Betar, Mohammed Azmi and Khader, Ahamad Tajudin and Bolaji, Asaju Laaro and Alkoffash, Mahmud},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Awadallah et al. - 2017 - Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem.pdf:pdf},
	Issn = {09410643},
	Journal = {Neural Computing and Applications},
	Keywords = {Harmony search, Hill climbing, Metaheuristic, Nurse rostering, Particle swarm optimization},
	Number = {3},
	Pages = {463--482},
	Publisher = {Springer London},
	Title = {{Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem}},
	Volume = {28},
	Year = {2017}}

@article{Kochenberger2004,
	Author = {Kochenberger, Gary a. and Glover, Fred and Alidaee, Bahram and Rego, Cesar},
	Doi = {10.1007/s00291-003-0153-3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kochenberger et al. - 2004 - A unified modeling and solution framework for combinatorial optimization problems.pdf:pdf},
	Issn = {0171-6468},
	Journal = {OR Spectrum},
	Keywords = {combinatorial optimization, integer programming, metaheuristics},
	Month = {mar},
	Number = {2},
	Pages = {237--250},
	Title = {{A unified modeling and solution framework for combinatorial optimization problems}},
	Url = {http://link.springer.com/10.1007/s00291-003-0153-3},
	Volume = {26},
	Year = {2004},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s00291-003-0153-3},
	Bdsk-Url-2 = {https://doi.org/10.1007/s00291-003-0153-3}}

@article{Blazewicz1983,
	Abstract = {In deterministic sequencing and scheduling problems, jobs are to be processed on machines of limited capacity. We consider an extension of this class of problems, in which the jobs require the use of additional scarce resources during their execution. A classification scheme for resource constraints is proposed and the computational complexity of the extended problem class is investigated in terms of this classification. Models involving parallel machines, unit-time jobs and the maximum completion time criterion are studied in detail; other models are briefly discussed. {\copyright} 1983.},
	Author = {Blazewicz, J. and Lenstra, J. K. and Kan, A. H.G.R.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Blazewicz, Lenstra, Kan - 1983 - Scheduling subject to resource constraints classification and complexity.pdf:pdf},
	Isbn = {0166-218X},
	Issn = {0166218X},
	Journal = {Discrete Applied Mathematics},
	Number = {1},
	Pages = {11--24},
	Title = {{Scheduling subject to resource constraints: classification and complexity}},
	Volume = {5},
	Year = {1983}}

@article{Ochoa,
	Author = {Ochoa, Gabriela and Tomassini, Marco},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ochoa, Tomassini - Unknown - Local Optima Networks of NK Landscapes.pdf:pdf},
	Title = {{Local Optima Networks of NK Landscapes}}}

@article{Bilal2013,
	Author = {Bilal, Nehme and Galinier, Philippe and Guibault, Francois},
	Doi = {10.1155/2013/203032},
	Issn = {2314-6397},
	Journal = {ISRN Operations Research},
	Pages = {1--10},
	Title = {{A New Formulation of the Set Covering Problem for Metaheuristic Approaches}},
	Url = {http://www.hindawi.com/isrn/or/2013/203032/},
	Volume = {2013},
	Year = {2013},
	Bdsk-Url-1 = {http://www.hindawi.com/isrn/or/2013/203032/},
	Bdsk-Url-2 = {https://doi.org/10.1155/2013/203032}}

@article{Gamrath2013,
	Author = {Gamrath, Gerald and Koch, Thorsten and Martin, Alexander and Miltenberger, Matthias and Weninger, Dieter},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath et al. - 2015 - Progress in Presolving for Mixed Integer Programming.pdf:pdf},
	Journal = {Mathematical Programming Computation},
	Pages = {367--398},
	Title = {{Progress in Presolving for Mixed Integer Programming}},
	Volume = {7},
	Year = {2015}}

@article{Benoist2011,
	Author = {Benoist, Thierry and Estellon, Bertrand and Gardi, Fr{\'e}d{\'e}ric and Megel, Romain and Nouioua, Karim},
	Doi = {10.1007/s10288-011-0165-9},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Benoist et al. - 2011 - LocalSolver 1.x a black-box local-search solver for 0-1 programming.pdf:pdf},
	Issn = {1619-4500},
	Journal = {4OR},
	Month = {mar},
	Number = {3},
	Pages = {299--316},
	Title = {{LocalSolver 1.x: a black-box local-search solver for 0-1 programming}},
	Url = {http://link.springer.com/10.1007/s10288-011-0165-9},
	Volume = {9},
	Year = {2011},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10288-011-0165-9},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10288-011-0165-9}}

@techreport{Kingston2013,
	Abstract = {Some instances of high school timetabling problems, taken from institutions in several countries and specified formally in a common XML format, have recently become available [12]. For the first time, the high school timetabling problem can be studied in its full generality. KHE is an open-source ANSI C library, released under the GNU public licence, which aims to provide a fast and robust foundation for solving instances of high school timetabling problems expressed in the new format. Users of KHE may read and write XML files, create solutions, and add and change time and resource assignments using any algorithms they wish. The cost of the current solution is always available, kept up to date by a hand-coded constraint propagation network. KHE also offers features inherited from the author's KTS system [7, 9], notably layer trees and matchings, and solvers for several major sub-tasks. KHE is intended for production use, but it is also a research vehicle, so new versions will not be constrained by backward compatibility. I will release a corrected version within a few days of receiving a bug report, wherever possible. Please report bugs to me at jeff@it.usyd.edu.au . This introductory chapter explains how to install and use KHE, surveys its data types, and describes some operations common to many types.},
	Author = {Kingston, J. H.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kingston - 2013 - The KHE High School Timetabling Engine.pdf:pdf},
	Institution = {University of Sydney},
	Number = {April},
	Title = {{The KHE High School Timetabling Engine}},
	Url = {http://sydney.edu.au/engineering/it/{~}jeff/khe/khe{\_}guide-2013{\_}04{\_}12.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http://sydney.edu.au/engineering/it/%7B~%7Djeff/khe/khe%7B%5C_%7Dguide-2013%7B%5C_%7D04%7B%5C_%7D12.pdf}}

@article{Read2016,
	Author = {Read, Jesse and Reutemann, P and Pfahringer, Bernhard and Holmes, Geoff},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Read et al. - 2016 - MEKA A Multi-labelMulti-target extension to WEKA.pdf:pdf},
	Journal = {Journal of Machine Learning Research},
	Pages = {1--5},
	Title = {{MEKA: A Multi-label/Multi-target extension to WEKA}},
	Volume = {17},
	Year = {2016}}

@article{Santos2012,
	Abstract = {This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher preferences and also the proper distribution of lessons throughout the week. The formulation contains a very large number of variables and is enhanced by cuts. Therefore, a cut and column generation algorithm to solve its linear relaxation is provided. The lower bounds obtained are very good, allowing us to prove the optimality of previously known solutions in three formerly open instances.},
	Author = {Santos, Haroldo Gambini and Uchoa, Eduardo and Ochi, Luiz Satoru and Maculan, Nelson},
	Doi = {10.1007/s10479-010-0709-y},
	Issn = {02545330},
	Journal = {Annals of Operations Research},
	Keywords = {column generation, cut generation, integer programming, timetabling},
	Number = {1},
	Pages = {399--412},
	Publisher = {Springer Netherlands},
	Title = {{Strong bounds with cut and column generation for class-teacher timetabling}},
	Url = {http://www.springerlink.com/index/10.1007/s10479-010-0709-y},
	Volume = {194},
	Year = {2012},
	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10479-010-0709-y},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-010-0709-y}}

@article{Baptiste2004,
	Abstract = {The best lower bound for the Resource Constrained Project Scheduling Problem is currently based on the resolution of several large Linear Programs (Brucker {\&} Knust, EJOR, 107: 272-288, 1998). In this paper, we show that (1) intensive constraint propagation can be used to tighten the initial formulation of the linear programs and (2) we introduce several sets of valid cutting planes. These improvements allow us to "close" 16 new instances of the PSPLIB with 60 activities and to improve the best known lower bounds of 64 instances.},
	Author = {Baptiste, P. and Demassey, S.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Baptiste, Demassey - 2004 - Tight LP bounds for resourtce constrained project scheduling.pdf:pdf},
	Journal = {OR Spectrum},
	Keywords = {Branch an, Resource constrained project scheduling},
	Number = {2},
	Pages = {251--262},
	Title = {{Tight LP bounds for resourtce constrained project scheduling}},
	Volume = {26},
	Year = {2004}}

@article{Kolisch2006,
	Author = {Kolisch, Rainer and Hartmann, S{\"o}nke},
	Doi = {10.1016/j.ejor.2005.01.065},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kolisch, Hartmann - 2006 - Experimental investigation of heuristics for resource-constrained project scheduling An update.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {computational evaluation, heuristics, project scheduling, resource constraints},
	Month = {oct},
	Number = {1},
	Pages = {23--37},
	Title = {{Experimental investigation of heuristics for resource-constrained project scheduling: An update}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705002596},
	Volume = {174},
	Year = {2006},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705002596},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2005.01.065}}

@article{Beasley1990,
	Author = {Beasley, J.E.},
	Journal = {Journal of the Operational Research Society},
	Number = {11},
	Pages = {1069--1072},
	Title = {{OR-Library: distributing test problems by electronic mail}},
	Volume = {41},
	Year = {1990}}

@article{Caprara2000-2,
	Author = {Caprara, Alberto and Toth, Paolo and Fischetti, M},
	Journal = {Annals of Operations Research},
	Pages = {353--371},
	Title = {{Algorithms for the set covering problem}},
	Url = {http://link.springer.com/article/10.1023/A:1019225027893},
	Year = {2000},
	Bdsk-Url-1 = {http://link.springer.com/article/10.1023/A:1019225027893}}

@inproceedings{Romer2016,
	Author = {R{\"o}mer, M. and Mellouli, T.},
	Booktitle = {{Proceedings of the 30th European Conference on Modelling and Simulation}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/R{\"{o}}mer, Mellouli - 2016 - Future Demand Uncertainty In Personnel Scheduling Investigating Deterministic Lookahead Policies Using Optimiz.pdf:pdf},
	Keywords = {computational stochastic optimization, lookahead poli-, optimization, personnel scheduling, simula-, tion, uncertainty},
	Pages = {502--507},
	Title = {{Future Demand Uncertainty In Personnel Scheduling: Investigating Deterministic Lookahead Policies Using Optimization And Simulation.}},
	Year = {2016}}

@article{Glover2001-2,
	Author = {Glover, Fred and Gutin, Gregory and Yeo, Anders and Zverovich, Alexey},
	Doi = {10.1016/S0377-2217(99)00468-3},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {construction heuristics, heuristics, traveling salesman},
	Number = {3},
	Pages = {555--568},
	Title = {{Construction heuristics for the asymmetric TSP}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
	Volume = {129},
	Year = {2001},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0377-2217(99)00468-3}}

@inproceedings{PoggideAragao2003,
	Address = {Buzios, Brazil},
	Author = {{Poggi de Arag{\~a}o}, M.V. and Uchoa, E.},
	Pages = {56--61},
	Title = {{Integer program reformulation for robust branch-and-cut-and-price}},
	Year = {2003}}

@article{Fukasawa2011,
	Abstract = {During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has had as much practical success as the MIR inequality when used in cutting plane algorithms for general mixed integer programming problems. In this work we analyze this empirical observation by developing an algorithm which takes as input a point and a single-row mixed integer polyhedron, and either proves the point is in the convex hull of said polyhedron, or finds a separating hyperplane. The main feature of this algorithm is a specialized subroutine for solving the Mixed Integer Knapsack Problem which exploits cost and lexicographic dominance. Separating over the entire closure of single-row systems allows us to establish natural benchmarks by which to evaluate specific classes of knapsack cuts. Using these benchmarks on Miplib 3.0 instances we analyze the performance of MIR inequalities. Computations are performed in exact arithmetic. {\copyright} Springer-Verlag Berlin Heidelberg 2007.},
	Author = {Fukasawa, Ricardo and Goycoolea, Marcos},
	Doi = {10.1007/s10107-009-0284-7},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fukasawa, Goycoolea - 2011 - On the exact separation of mixed integer knapsack cuts.pdf:pdf},
	Issn = {00255610},
	Journal = {Mathematical Programming},
	Keywords = {Cutting plane algorithms, Mixed integer knapsack problem, Mixed integer programming},
	Number = {1-2},
	Pages = {19--41},
	Title = {{On the exact separation of mixed integer knapsack cuts}},
	Volume = {128},
	Year = {2011},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10107-009-0284-7}}

@article{Kopanos2014,
	Author = {Kopanos, Georgios M. and Kyriakidis, Thomas S. and Georgiadis, Michael C.},
	Doi = {10.1016/j.compchemeng.2014.05.009},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kopanos, Kyriakidis, Georgiadis - 2014 - New continuous-time and discrete-time mathematical formulations for resource-constrained projec.pdf:pdf},
	Issn = {00981354},
	Journal = {Computers {\&} Chemical Engineering},
	Number = {August 2015},
	Pages = {96--106},
	Title = {{New continuous-time and discrete-time mathematical formulations for resource-constrained project scheduling problems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0098135414001525},
	Volume = {68},
	Year = {2014},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0098135414001525},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.compchemeng.2014.05.009}}

@article{Silva2015,
	Abstract = {Surgical scheduling is a challenging problem faced by hospital managers. It is subject to a wide range of constraints depending upon the particular situation within any given hospital. We deal with the simultaneous employment of specialised human resources, which must be assigned to surgeries according to their skills as well as the time windows of the staff. A particular feature is that they can be assigned to two surgeries simultaneously if the rooms are compatible. The objective is to maximise the use of the operating rooms. We propose an integer model and integer programming based heuristics to address the problem. Computational experiments were conducted on a number of scenarios inspired by real data to cover different practical problem solving situations. Numerical results show that relaxations provide tight upper bounds, and relax-and-fix heuristics are successful in finding optimal or near optimal solutions.},
	Author = {Silva, Thiago A O and {De Souza}, Mauricio C. and Saldanha, Rodney R. and Burke, Edmund K.},
	Doi = {10.1016/j.ejor.2015.04.008},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Silva et al. - 2015 - Surgical scheduling with simultaneous employment of specialised human resources.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {Mathematical modelling, Relax-and-fix heuristics, Surgical scheduling},
	Number = {3},
	Pages = {719--730},
	Publisher = {Elsevier Ltd.},
	Title = {{Surgical scheduling with simultaneous employment of specialised human resources}},
	Url = {http://dx.doi.org/10.1016/j.ejor.2015.04.008},
	Volume = {245},
	Year = {2015},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.ejor.2015.04.008}}

@book{AharonBen-TalLaurentElGhaoui2009,
	Abstract = {Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject.Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution.The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations.An essential book for anyone working on optimization and decision making under uncertainty,Robust Optimizationalso makes an ideal graduate textbook on the subject. {\copyright} 2009 by Princeton University Press. All Rights Reserved.},
	Archiveprefix = {arXiv},
	Arxivid = {arXiv:1011.1669v3},
	Author = {Ben-Tal, A. and Ghaoui, L.E. and Nemirovski, A.},
	Eprint = {arXiv:1011.1669v3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ben-Tal, Ghaoui, Nemirovski - 2009 - Robust Optimization.pdf:pdf},
	Publisher = {Princeton University Press},
	Title = {{Robust Optimization}},
	Year = {2009}}

@article{Avella2005,
	Author = {Avella, P. and Vasil'ev, I.},
	Journal = {Journal of Scheduling},
	Pages = {497--514},
	Title = {{A Computational Study of a Cutting Plane Algorithm for University Course Timetabling}},
	Volume = {8},
	Year = {2005}}

@book{Garey1979,
	Author = {Garey, Michael R. and Johnson, David S.},
	Isbn = {0-7167-1045-5},
	Publisher = {W. H. Freeman and Company},
	Title = {{Computers and Intractability: A Guide to the Theory of NP-Completeness}},
	Year = {1979}}

@article{Souza2004-2,
	Author = {Souza, M J F and Cardoso, L X T and Silva, G P and Rodrigues, M M S and Mapa, S M S},
	Journal = {Tend{\{}{\^e}{\}}ncias em Matem{\{}{\'a}{\}}tica Aplicada e Computacional},
	Pages = {357--368},
	Title = {{Metaheur{\{}{\'\i}{\}}sticas Aplicadas ao Problema de Programa$\backslash$cc{\{}{\~a}{\}}o de Tripula$\backslash$cc{\{}{\~o}{\}}es no Sistema de Transporte P{\{}{\'u}{\}}blico}},
	Volume = {5},
	Year = {2004}}

@article{Andreello2007-2,
	Author = {Andreello, G. and Caprara, A. and Fischetti, M.},
	Doi = {10.1287/ijoc.1050.0162},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Andreello, Caprara, Fischetti - 2007 - Embedding {\{}0,12{\}}-Cuts in a Branch-and-Cut Framework A Computational Study.pdf:pdf},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {accepted by william j, accepted july 2005, algorithms, and analysis of algorithms, applications, area editor for design, cook, cutting plane, history, integer, programming, received may 2004, revised january 2005},
	Month = {jan},
	Number = {2},
	Pages = {229--238},
	Title = {{Embedding {\{}0,1/2{\}}-Cuts in a Branch-and-Cut Framework: A Computational Study}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
	Volume = {19},
	Year = {2007},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1050.0162}}

@article{Kochetov2008,
	Author = {Kochetov, Yuri and Kononova, Polina and Paschenko, Mikhail},
	Doi = {10.2298/YUJOR0801001K},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kochetov, Kononova, Paschenko - 2008 - Formulation space search approach for the teacherclass timetabling problem.pdf:pdf},
	Journal = {Yugoslav Journal of Operations Research},
	Keywords = {fss approach, local search, metaheuristics, t imetable design},
	Number = {1},
	Pages = {1--11},
	Title = {{Formulation space search approach for the teacher/class timetabling problem}},
	Volume = {18},
	Year = {2008},
	Bdsk-Url-1 = {https://doi.org/10.2298/YUJOR0801001K}}

@article{Saimurugan2011,
	Abstract = {The shaft and bearing are the most critical components in rotating machinery. Majority of problems arise from faulty bearings in turn affect the shaft. The vibration signals are widely used to determine the condition of machine elements. The vibration signals are used to extract the features to identify the status of a machine. This paper presents the use of c-SVC and nu-SVC models of support vector machine (SVM) with four kernel functions for classification of faults using statistical features extracted from vibration signals under good and faulty conditions of rotational mechanical system. Decision tree algorithm was used to select the prominent features. These features were given as inputs for training and testing the c-SVC and nu-SVC model of SVM and their fault classification accuracies were compared. {\copyright} 2010 Elsevier Ltd. All rights reserved.},
	Author = {Saimurugan, M. and Ramachandran, K. I. and Sugumaran, V. and Sakthivel, N. R.},
	Doi = {10.1016/j.eswa.2010.09.042},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Saimurugan et al. - 2011 - Multi component fault diagnosis of rotational mechanical system based on decision tree and support vector mac.pdf:pdf},
	Issn = {09574174},
	Journal = {Expert Systems with Applications},
	Keywords = {Decision tree, Fault diagnosis, Shaft and bearings, Support vector machine},
	Number = {4},
	Pages = {3819--3826},
	Publisher = {Elsevier Ltd},
	Title = {{Multi component fault diagnosis of rotational mechanical system based on decision tree and support vector machine}},
	Url = {http://dx.doi.org/10.1016/j.eswa.2010.09.042},
	Volume = {38},
	Year = {2011},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.eswa.2010.09.042}}

@article{Bertsimas2017,
	Abstract = {State-of-the-art decision tree methods apply heuristics recursively to create each split in isolation, which may not capture well the underlying characteristics of the dataset. The optimal decision tree problem attempts to resolve this by creating the entire decision tree at once to achieve global optimality. In the last 25 years, algorithmic advances in inte-ger optimization coupled with hardware improvements have resulted in an astonishing 800 billion factor speedup in mixed-integer optimization (MIO). Motivated by this speedup, we present optimal classification trees, a novel formulation of the decision tree problem using modern MIO techniques that yields the optimal decision tree for axes-aligned splits. We also show the richness of this MIO formulation by adapting it to give optimal classification trees with hyperplanes that generates optimal decision trees with multivariate splits. Synthetic tests demonstrate that these methods recover the true decision tree more closely than heuristics, refuting the notion that optimal methods overfit the training data. We comprehensively bench-mark these methods on a sample of 53 datasets from the UCI machine learning repository. We establish that these MIO methods are practically solvable on real-world datasets with sizes in the 1000s, and give average absolute improvements in out-of-sample accuracy over CART of 1--2 and 3--5{\%} for the univariate and multivariate cases, respectively. Furthermore, we identify that optimal classification trees are likely to outperform CART by 1.2--1.3{\%} in situations where the CART accuracy is high and we have sufficient training data, while the multivariate version outperforms CART by 4--7{\%} when the CART accuracy or dimension of the dataset is low.},
	Author = {Bertsimas, D. and Dunn, J.},
	Doi = {10.1007/s10994-017-5633-9},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bertsimas, Dunn - 2017 - Optimal classification trees.pdf:pdf},
	Issn = {15730565},
	Journal = {Machine Learning},
	Keywords = {Classification, Decision trees, Mixed integer optimization},
	Number = {7},
	Pages = {1039--1082},
	Publisher = {Springer US},
	Title = {{Optimal classification trees}},
	Volume = {106},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10994-017-5633-9}}

@phdthesis{Gamrath2010,
	Author = {Gamrath, Gerald},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath - 2010 - Generic Branch-Cut-and-Price.pdf:pdf},
	Pages = {200},
	School = {Technischen Universit{\"a}t Berlin},
	Title = {{Generic Branch-Cut-and-Price}},
	Year = {2010}}

@article{Fischetti2011a,
	Abstract = {Gomory mixed-integer cuts (GMICs) are widely used in modern branchand-cut codes for the solution of mixed-integer programs. Typically, GMICs are iteratively generated from the optimal basis of the current linear programming (LP) relaxation, and immediately added to the LP before the next round of cuts is generated. Unfortunately, this approach is prone to instability. In this paper we analyze a different scheme for the generation of rank-1 GMICs read from a basis of the original LP---the one before the addition of any cut.We adopt a relax-and-cut approach where the generated GMICs are not added to the current LP, but immediately relaxed in a Lagrangian fashion. Various elaborations of the basic idea are presented, that lead to very fast---yet accurate---variants of the basic scheme. Very encouraging computational results are presented, with a comparison with alternative techniques from the literature also aimed at improving the GMIC quality. We also show how our method can be integrated with other cut generators, and successfully used in a cut-and-branch enumerative framework.},
	Author = {Fischetti, Matteo and Salvagnin, Domenico},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2011 - A relax-and-cut framework for gomory mixed-integer cuts.pdf:pdf},
	Journal = {Mathematical Programming Computation},
	Keywords = {Gomory cuts, Lagrangian relaxation, Mixed-integer programming, Relax-and-cut},
	Number = {2},
	Pages = {79--102},
	Title = {{A relax-and-cut framework for gomory mixed-integer cuts}},
	Volume = {3},
	Year = {2011}}

@article{A.AlanB.Pritsker1969,
	Author = {{A. Alan B. Pritsker}, Lawrence J. Watters and Wolfe, Philip M.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/A. Alan B. Pritsker - 1969 - Multiproject Scheduling with Limited Resources A Zero-One Programming Approach.pdf:pdf},
	Journal = {Management Science},
	Number = {1},
	Pages = {93--108},
	Title = {{Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach}},
	Volume = {16},
	Year = {1969}}

@article{Xu2008,
	Author = {Xu, L. and Hutter, F. and Hoos, H.H. and Leyton-Brown, K.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Xu et al. - 2008 - SATzilla Portfolio-based algorithm selection for SAT.pdf:pdf},
	Issn = {10769757},
	Journal = {Journal of Artificial Intelligence Research},
	Pages = {565--606},
	Title = {{SATzilla: Portfolio-based algorithm selection for SAT}},
	Volume = {32},
	Year = {2008}}

@article{DiGaspero2006,
	Abstract = {Abstract  A recent trend in local search concerns the exploitation of several different neighborhoods so as to increase the ability$\backslash$nof the algorithm to navigate the search space. In this work we investigate a hybridization technique, that we call Neighborhood Portfolio Approach, that consists in the interleave of local search techniques based on various combinations of neighborhoods. In particular,$\backslash$nwe are able to select the most effective search technique through a systematic analysis of all meaningful combinations built$\backslash$nupon a set of basic neighborhoods. The proposed approach is applied to two practical problems belonging to the timetabling$\backslash$nfamily, and systematically tested and compared on real-world instances. The experimental analysis shows that our approach$\backslash$nleads to automatic design of new algorithms that provide better results than basic local search techniques.},
	Author = {{Di Gaspero}, Luca and Schaerf, Andrea},
	Doi = {10.1007/s10852-005-9032-z},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Di Gaspero, Schaerf - 2006 - Neighborhood portfolio approach for local search applied to timetabling problems.pdf:pdf},
	Isbn = {1085200590},
	Issn = {15701166},
	Journal = {Journal of Mathematical Modelling and Algorithms},
	Keywords = {Local search, Neighborhood, Tabu search, Timetabling},
	Number = {1},
	Pages = {65--89},
	Title = {{Neighborhood portfolio approach for local search applied to timetabling problems}},
	Volume = {5},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10852-005-9032-z}}

@article{Boland2014,
	Abstract = {The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP feasible but fractional solutions, and integer but LP infeasible solutions. The process attempts to minimize the distance between consecutive iterates, producing an integer feasible solution when closing the distance between them. We investigate the benefits of enhancing the rounding procedure with a clever integer line search that efficiently explores a large set of integer points. An extensive computational study on benchmark instances demonstrates the efficacy of the proposed approach.},
	Author = {Boland, Natashia L. and Eberhard, Andrew C. and Engineer, Faramroze G. and Fischetti, Matteo and Savelsbergh, Martin W.P. and Tsoukalas, Angelos},
	Doi = {10.1007/s12532-014-0068-9},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Boland et al. - 2014 - Boosting the feasibility pump.pdf:pdf},
	Issn = {18672957},
	Journal = {Mathematical Programming Computation},
	Keywords = {65K05, 90C10, 90C11},
	Number = {3},
	Pages = {255--279},
	Title = {{Boosting the feasibility pump}},
	Volume = {6},
	Year = {2014},
	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-014-0068-9}}

@phdthesis{Gomes1982-2,
	Author = {Gomes, C M N},
	School = {Instituto Militar de Engenharia},
	Title = {{An{\{}{\'a}{\}}lise do desempenho operacional de p{\{}{\'a}{\}}tios ferrovi{\{}{\'a}{\}}rios}},
	Type = {Disserta{\{}{\c c}{\}}{\{}{\~a}{\}}o de Mestrado},
	Year = {1982}}

@article{Glover1986,
	Author = {Glover, F.},
	Journal = {Computers {\&} Operations Research},
	Pages = {533--549},
	Title = {{Future paths for integer programming and artificial intelligence}},
	Volume = {13},
	Year = {1986}}

@article{Lan2007-2,
	Author = {Lan, Guanghui and DePuy, Gail W and Whitehouse, Gary E},
	Doi = {10.1016/j.ejor.2005.09.028},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {combinatorial optimization, meta-raps, set covering},
	Number = {3},
	Pages = {1387--1403},
	Title = {{An effective and simple heuristic for the set covering problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
	Volume = {176},
	Year = {2007},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2005.09.028}}

@incollection{Glover1997,
	Address = {Boston, M.A.},
	Author = {Glover, F.},
	Editor = {Barr, R.S. and Helgason, R.V. and Kennington, J.L.},
	Pages = {1--75},
	Publisher = {Kluwer},
	Title = {{Tabu search and adaptive memory programming - advances, applications and challenges}},
	Year = {1997}}

@article{Even1976,
	Author = {Even, S. and Itai, A. and Shamir, A.},
	Journal = {SIAM Jounal of Computing},
	Month = {dec},
	Number = {4},
	Pages = {691--703},
	Title = {{On the complexity of timetable and multicommodity flow problems}},
	Volume = {5},
	Year = {1976}}

@article{Marcotte2014,
	Author = {Marcotte, Mounira Groiez; Guy Desaulniers; Odile},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Marcotte - 2014 - Valid Inequalities and Separation Algorithms for the Set Partitioning Problem.pdf:pdf},
	Journal = {INFOR: Information Systems and Operational Research},
	Number = {4},
	Pages = {185--196},
	Title = {{Valid Inequalities and Separation Algorithms for the Set Partitioning Problem}},
	Volume = {52},
	Year = {2014}}

@inproceedings{Lin2009,
	Abstract = {Rail is the most environmentally friendly and fuel efficient mode of freight transportation. Classification yards are railroads' single-most complex operation. Railroad operations are directly influenced by their performance. In this paper, we present a rail yard simulation framework, or YardSim, and describe how it has been used to model a major hump yard on a Class I railroad in the US. The framework, that models complicated rail yard operations from inbound arrivals, inspection, switching, assembling, brake test, to outbound departures, can be used to pinpoint bottlenecks, identify improvement opportunities in operating practice and yard infrastructure, and assess the impact of changes in traffic volume and service plan. The YardSim provides the flexibility and adaptability to conduct and manage "what-if" analysis on train plan, yard infrastructure, operating policy, operational strategy, and yard resources such as crews and locomotives. Therefore, the development cycle for a new yard can be reduced significantly.},
	Address = {Austin, Texas},
	Author = {Lin, Edward and Cheng, Clark},
	Booktitle = {{Winter Simulation Conference}},
	Pages = {2532--2541},
	Publisher = {Winter Simulation Conference},
	Title = {{YardSim: a rail yard simulation framework and its implementation in a major railroad in the U.S.}},
	Url = {http://dl.acm.org/citation.cfm?id=1995456.1995801},
	Year = {2009},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=1995456.1995801}}

@article{Gutin2000-2,
	Author = {Gutin, G and Zverovich, A},
	Journal = {submitted for publication},
	Title = {{Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP}},
	Url = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf},
	Year = {2000},
	Bdsk-Url-1 = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf}}

@article{Bilal2014-2,
	Author = {Bilal, Nehme and Galinier, Philippe and Guibault, Francois},
	Doi = {10.1007/s10732-013-9235-9},
	Isbn = {1073201392},
	Issn = {1381-1231},
	Journal = {Journal of Heuristics},
	Keywords = {hybrid heuristics, iterated local search, partial covering, profit maximization, set covering, tabu search},
	Month = {jan},
	Number = {2},
	Pages = {143--164},
	Title = {{An iterated-tabu-search heuristic for a variant of the partial set covering problem}},
	Url = {http://link.springer.com/10.1007/s10732-013-9235-9 http://link.springer.com/article/10.1007/s10732-013-9235-9},
	Volume = {20},
	Year = {2014},
	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-013-9235-9%20http://link.springer.com/article/10.1007/s10732-013-9235-9},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-013-9235-9}}

@inproceedings{Zauk2010,
	Author = {Zauk, Jo{\~a}o M and B.Ara{\'u}jo, Olinto C and Ritzen, Paulo C F and Jr, Ghendy Cardoso and Obregon, Lauriane C and Corr{\^e}a, Rafael},
	Booktitle = {{XVIII Congresso Brasileiro de Autom{\{}{\'a}{\}}tica}},
	Number = {1995},
	Pages = {4538--4544},
	Title = {{Programa{\{}{\c c}{\}}{\{}{\~a}{\}}o Inteira Bin{\{}{\'a}{\}}ria Aplicada ao Processamento de Alarmes em Sistemas El{\{}{\'e}{\}}tricos de Pot{\{}{\^e}{\}}ncia}},
	Year = {2010}}

@article{Fernandez1998,
	Abstract = {The project scheduling problem domain is an important research and applications area of engineering management. Recently introduced project scheduling software such as Risk+, Risk for Project, SCRAM and Risk Master have facilitated the use of simulation to solve project scheduling problems with stochastic task durations. Practitioners, however, should be made aware that the solution algorithm used in these software systems is based on the implicit assumption of perfect information, an assumption that jeopardizes the feasibility of solution results. This paper discusses the impact of assuming perfect information, introduces a multi-period stochastic programming based model of the project scheduling problem with stochastic task durations, and presents an alternative simulation algorithm that does not assume the availability of perfect information. A simple case study is used to illustrate the practical implications of applying simulation to address project scheduling problems with stochastic task durations.},
	Author = {Fernandez, A.A. and Armacost, R.L. and Pet-Edwards, J.J.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fernandez, Armacost, Pet-Edwards - 1998 - Understanding simulation solutions to resource constrained project scheduling problems with st.pdf:pdf},
	Isbn = {9780769533360},
	Issn = {10429247},
	Journal = {EMJ - Engineering Management Journal},
	Number = {4},
	Pages = {5--13},
	Title = {{Understanding simulation solutions to resource constrained project scheduling problems with stochastic task durations}},
	Volume = {10},
	Year = {1998}}

@article{Kim2002,
	Author = {Kim, Dong-Won and Kim, Kyong-Hee and Jang, Wooseung and {Frank Chen}, F},
	Doi = {10.1016/S0736-5845(02)00013-3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kim et al. - 2002 - Unrelated parallel machine scheduling with setup times using simulated annealing.pdf:pdf},
	Issn = {07365845},
	Journal = {Robotics and Computer-Integrated Manufacturing},
	Keywords = {parallel machine scheduling, simulated annealing, total tardiness},
	Month = {jun},
	Number = {3-4},
	Pages = {223--231},
	Title = {{Unrelated parallel machine scheduling with setup times using simulated annealing}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0736584502000133},
	Volume = {18},
	Year = {2002},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0736584502000133},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0736-5845(02)00013-3}}

@article{Kowalczyk2017,
	Author = {Kowalczyk, D. and Leus, R.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kowalczyk, Leus - 2017 - An exact algorithm for parallel machine scheduling with conflicts.pdf:pdf},
	Journal = {Journal of Scheduling},
	Keywords = {Branch and price, Coloring, Combinatorial optimization, Parallel machines, Scheduling},
	Number = {4},
	Pages = {355--372},
	Publisher = {Springer US},
	Title = {{An exact algorithm for parallel machine scheduling with conflicts}},
	Volume = {20},
	Year = {2017}}

@article{Miller1960,
	Author = {Miller, C. E. and Tucker, A. W. and Zemlin, R. A.},
	File = {:home/haroldo/Documentos/IntegerProgramming/apps/Integer Programming Formulations of Traveling Salesman Problems.pdf:pdf},
	Issn = {1557735X},
	Journal = {Journal of the ACM (JACM)},
	Number = {4},
	Pages = {326--329},
	Title = {{Integer Programming Formulation of Traveling Salesman Problems}},
	Volume = {7},
	Year = {1960}}

@article{Hansen2006,
	Author = {Hansen, P. and Mladenovi{\'c}, Nenad. and Urosevi{\'c}, D.},
	Issn = {0305-0548},
	Journal = {Comput. Oper. Res.},
	Number = {10},
	Pages = {3034--3045},
	Title = {{Variable neighborhood search and local branching}},
	Volume = {33},
	Year = {2006}}

@article{Talbot1978,
	Author = {Talbot, F. Brian and Patterson, James H.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Talbot, Patterson - 1978 - An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Prob.pdf:pdf},
	Journal = {Management Science},
	Number = {11},
	Pages = {1163--1174},
	Title = {{An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems}},
	Url = {http://www.jstor.org/stable/10.2307/2630633},
	Volume = {24},
	Year = {1978},
	Bdsk-Url-1 = {http://www.jstor.org/stable/10.2307/2630633}}

@article{Arnaout2009-2,
	Author = {Arnaout, Jean-Paul and Rabadi, Ghaith and Musa, Rami},
	Doi = {10.1007/s10845-009-0246-1},
	Issn = {0956-5515},
	Journal = {Journal of Intelligent Manufacturing},
	Keywords = {ant colony optimization, introduction and problem statement, scheduling, scheduling of n, sequence-dependent setup times, the problem addressed in, this paper is the, unrelated parallel machine},
	Number = {6},
	Pages = {693--701},
	Title = {{A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times}},
	Url = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
	Volume = {21},
	Year = {2009},
	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-009-0246-1}}

@article{Burke2007,
	Author = {Burke, E. K. and McCollum, B. and Meisels, A. and Petrovic, S. and Qu, R.},
	Journal = {European Journal of Operational Research},
	Month = {jan},
	Number = {1},
	Pages = {177--192},
	Title = {{A graph-based hyper-heuristic for educational timetabling problems}},
	Url = {http://ideas.repec.org/a/eee/ejores/v176y2007i1p177-192.html},
	Volume = {176},
	Year = {2007},
	Bdsk-Url-1 = {http://ideas.repec.org/a/eee/ejores/v176y2007i1p177-192.html}}

@incollection{Hoos2005,
	Author = {Hoos, H. H. and St{\"u}tzle, T.},
	Pages = {149--201},
	Publisher = {Morgan Kaufmann},
	Title = {{Stochastic Local Search: Foundations and Applications}},
	Year = {2005}}

@article{Balas2008,
	Abstract = {The polyhedron defined by all the split cuts obtainable directly (i.e. without iterated cut generation) from the {\{}LP-relaxation{\}} P of a mixed integer program ({\{}MIP){\}} is termed the (elementary, or rank 1) split closure of P. This paper deals with the problem of optimizing over the elementary split closure. This is accomplished by repeatedly solving the following separation problem: given a fractional point, say x, find a rank-1 split cut violated by x or show that none exists. Following Caprara and Letchford [17], we formulate this separation problem as a nonlinear mixed integer program that can be treated as a parametric mixed integer linear program ({\{}PMILP){\}} with a single parameter in the objective function and the right hand side. We develop an algorithmic framework to deal with the resulting {\{}PMILP{\}} by creating and maintaining a dynamically updated grid of parameter values, and use the corresponding mixed integer programs to generate rank 1 split cuts. Our approach was implemented in the {\{}COIN-OR{\}} framework using {\{}CPLEX{\}} 9.0 as a general purpose {\{}MIP{\}} solver. We report our computational results on well-known benchmark instances from {\{}MIPLIB{\}} 3.0 and several classes of structured integer and mixed integer problems. Our computational results show that rank-1 split cuts close more than 98{\%} of the duality gap on 15 out of 41 mixed integer instances from {\{}MIPLIB{\}} 3.0. More than 75{\%} of the duality gap can be closed on an additional 10 instances. The average gap closed over all 41 instances is 72.78{\%}. In the pure integer case, rank-1 split cuts close more than 75{\%} of the duality gap on 13 out of 24 instances from {\{}MIPLIB{\}} 3.0. On average, rank 1 split cuts close about 72{\%} of the duality gap on these 24 instances. We also report results on several classes of structured problems: capacitated versions of warehouse location, single-source facility location, p-median, fixed charge network flow, multi-commodity network design with splittable and unsplittable flows, and lot sizing. The fraction of the integrality gap closed varies for these problem classes between 100 and 67{\%}. We also gathered statistics on the average coefficient size (absolute value) of the disjunctions generated. They turn out to be surprisingly small.},
	Author = {Balas, Egon and Saxena, Anureet},
	Doi = {10.1007/s10107-006-0049-5},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Balas, Saxena - 2008 - Optimizing over the split closure.pdf:pdf},
	Issn = {00255610},
	Journal = {Mathematical Programming},
	Number = {2},
	Pages = {219--240},
	Title = {{Optimizing over the split closure}},
	Volume = {113},
	Year = {2008},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10107-006-0049-5}}

@article{doi:10.1002/cpe.4967,
	Abstract = {Summary The middleware solutions for General-Purpose Distributed Computing (GPDC) have distinct requirements, such as task scheduling, processing/storage fault tolerance, code portability for parallel or distributed environments, simple deployment (including over grid or multi-cluster environments), collaborative development, low code refactoring, native support for distributed data structures, asynchronous task execution, and support for distributed global variables. These solutions do not integrate these requirements into a single deployment with a unique API exposing most of these requirements to users. The consequence is the utilization of several solutions with their particularities, thus requiring different user skills. Besides that, the users have to solve the integration and all heterogeneity issues. To reduce this integration gap, in this paper, we present Java C{\'a}{\&}L{\'a} (JCL), a distributed-shared-memory and task-oriented lightweight middleware for the Java community that separates business logic from distribution issues during the development process and incorporates several requirements that were presented separately in the GPDC middleware literature over the last few decades. JCL allows building distributed or parallel applications with only a few portable API calls, thus reducing the integration problems. Finally, it also runs on different platforms, including small single-board computers. This work compares and contrasts JCL with other Java middleware systems and reports experimental evaluations of JCL applications in several distinct scenarios.},
	Annote = {e4967 cpe.4967},
	Author = {Almeida, Andr{\'e} Lu{\'\i}s Barroso and Cimino, Leonardo de Souza and Resende, Jos{\'e} Estev{\~a}o Eug{\^e}nio and Silva, Lucas Henrique Moreira and Rocha, Samuel Queiroz Souza and Gregorio, Guilherme Aparecido and Paiva, Gustavo Silva and Delabrida, Saul and Santos, Haroldo Gambini and Carvalho, Marco Antonio Moreira and Aquino, Andre Luiz Lins and Lima, Joubert de Castro},
	Doi = {10.1002/cpe.4967},
	Journal = {Concurrency and Computation: Practice and Experience},
	Keywords = {Java, distributed computing, distributed shared memory, middleware, parallel computing, task-oriented},
	Number = {0},
	Pages = {e4967},
	Title = {{A general-purpose distributed computing Java middleware}},
	Url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4967},
	Volume = {0},
	Bdsk-Url-1 = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4967},
	Bdsk-Url-2 = {https://doi.org/10.1002/cpe.4967}}

@article{Ceschia2012,
	Abstract = {The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling problems, for which many instances and results are available. In this work we design a metaheuristic approach based on simulated annealing to solve the PE-CTT. We consider all the different variants of the problem that have been proposed in the literature and we perform a comprehensive experimental analysis on all the available public instances. The outcome is that our solver, properly engineered and tuned, performs very well on all cases, providing the new best known results on many instances and state-of-the-art values for the others.},
	Archiveprefix = {arXiv},
	Arxivid = {arXiv:1104.2518v1},
	Author = {Ceschia, Sara and Gaspero, Luca Di and Schaerf, Andrea},
	Eprint = {arXiv:1104.2518v1},
	Journal = {Computers {\&} Operations Research},
	Keywords = {course timetabling, metaheuristics, simulated annealing},
	Number = {7},
	Pages = {1615--1624},
	Title = {{Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem}},
	Volume = {39},
	Year = {2012}}

@phdthesis{Souza2000-2,
	Address = {Rio de Janeiro, Brasil},
	Author = {Souza, M.J.F.},
	Title = {{Programa$\backslash$cc{\~a}o de Hor{\'a}rios em Escolas: Uma Aproxima$\backslash$cc{\~a}o por Metaheur{\'\i}sticas}},
	Year = {2000}}

@article{Sadykov2013,
	Abstract = {The bin packing problem with conflicts consists of packing items in a minimum number of bins of limited capacity while avoiding joint assignments of items that are in conflict. Our study demonstrates that a generic implementation of a branch-and-price algorithm using specific pricing oracle yields comparatively good performance for this problem. We use our black-box branch-and-price solver BaPCod, relying on its generic branching scheme and primal heuristics. We developed a dynamic programming algorithm for pricing when the conflict graph is an interval graph, and a depth-first-search branch-and-bound approach for pricing when the conflict graph has no special structure. The exact method is tested on instances from the literature where the conflict graph is an interval graph, as well as harder instances that we generated with an arbitrary conflict graph and larger number of items per bin. Our computational experiment report sets new benchmark results for this problem, closing all open instances of the literature in one hour of CPU time.},
	Author = {Sadykov, Ruslan and Vanderbeck, Fran??ois},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Sadykov, Vanderbeck - 2013 - Bin packing with conflicts A generic branch-and-price algorithm.pdf:pdf},
	Isbn = {1091-9856},
	Issn = {10919856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {Bin packing, Branch and price, Conflict graphs, Interval graphs, Knapsack},
	Number = {2},
	Pages = {244--255},
	Title = {{Bin packing with conflicts: A generic branch-and-price algorithm}},
	Volume = {25},
	Year = {2013}}

@article{Johnson1991,
	Author = {Johnson, David S. and Aragon, Cecilia R. and McGeoch, Lyle a. and Schevon, Catherine},
	Doi = {10.1287/opre.39.3.378},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Johnson et al. - 1991 - Optimization by Simulated Annealing An Experimental Evaluation Part II, Graph Coloring and Number Partitioning.pdf:pdf},
	Issn = {0030-364X},
	Journal = {Operations Research},
	Month = {jun},
	Number = {3},
	Pages = {378--406},
	Title = {{Optimization by Simulated Annealing: An Experimental Evaluation Part II, Graph Coloring and Number Partitioning}},
	Url = {http://pubsonline.informs.org/doi/abs/10.1287/opre.39.3.378},
	Volume = {39},
	Year = {1991},
	Bdsk-Url-1 = {http://pubsonline.informs.org/doi/abs/10.1287/opre.39.3.378},
	Bdsk-Url-2 = {https://doi.org/10.1287/opre.39.3.378}}

@inproceedings{Rosa2009,
	Address = {Cuiab{\'a}},
	Author = {Rosa, Bruno F and Souza, Marcone J F and {S{\'e}rgio R. de Souza}},
	Booktitle = {{Anais do XXXII CNMAC}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rosa, Souza, S{\'{e}}rgio R. de Souza - 2009 - Formula{\c{c}}{\~{o}}es de Programa{\c{c}}{\~{a}}o Matem{\'{a}}tica para o Problema de Seq{\"{u}}enciamento em uma M{\'{a}}q.pdf:pdf},
	Pages = {930--936},
	Title = {{Formula{\c c}{\~o}es de Programa{\c c}{\~a}o Matem{\'a}tica para o Problema de Seq{\"u}enciamento em uma M{\'a}quina com Janelas de Entrega Distintas e Tempo de Prepara{\c c}{\~a}o Dependente da Seq{\"u}encia de Produ{\c c}{\~a}o}},
	Year = {2009}}

@article{Feige1996,
	Author = {Feige, U. and Kilian, J.},
	Journal = {Journal of Computer and System Sciences},
	Number = {2},
	Pages = {278--287},
	Title = {{Zero Knowledge and the Chromatic Number}},
	Volume = {57},
	Year = {1996}}

@article{Drexl2007,
	Author = {Drexl, A. and Knust, S.},
	Doi = {10.1016/j.omega.2005.08.002},
	Issn = {0305-0483},
	Journal = {Omega},
	Keywords = {Scheduling},
	Mendeley-Tags = {Scheduling},
	Number = {5},
	Pages = {465--471},
	Title = {{Sports league scheduling: Graph- and resource-based models}},
	Volume = {35},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.omega.2005.08.002}}

@inproceedings{Bykov2013,
	Address = {Gent, Belgium},
	Author = {Bykov, Yuri and Petrovic, Sanja},
	Booktitle = {{MISTA 2013: Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications}},
	Editor = {Kendall, Graham and Berghe, Greet Vanden and McCollum, Barry},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bykov, Petrovic - 2013 - An initial study of a novel Step Counting Hill Climbing heuristic applied to timetabling problems.pdf:pdf},
	Pages = {691--693},
	Title = {{An initial study of a novel Step Counting Hill Climbing heuristic applied to timetabling problems}},
	Year = {2013}}

@article{Zhang2007,
	Abstract = {Multi-label learning originated from the investigation of text categorization problem, where each document may belong to several predefined topics simultaneously. In multi-label learning, the training set is composed of instances each associated with a set of labels, and the task is to predict the label sets of unseen instances through analyzing training instances with known label sets. In this paper, a multi-label lazy learning approach named ML-KNN is presented, which is derived from the traditional K-nearest neighbor (KNN) algorithm. In detail, for each unseen instance, its K nearest neighbors in the training set are firstly identified. After that, based on statistical information gained from the label sets of these neighboring instances, i.e. the number of neighboring instances belonging to each possible class, maximum a posteriori (MAP) principle is utilized to determine the label set for the unseen instance. Experiments on three different real-world multi-label learning problems, i.e. Yeast gene functional analysis, natural scene classification and automatic web page categorization, show that ML-KNN achieves superior performance to some well-established multi-label learning algorithms. {\copyright} 2007 Pattern Recognition Society.},
	Author = {Zhang, Min Ling and Zhou, Zhi Hua},
	Doi = {10.1016/j.patcog.2006.12.019},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Zhang, Zhou - 2007 - ML-KNN A lazy learning approach to multi-label learning.pdf:pdf},
	Isbn = {0031-3203},
	Issn = {00313203},
	Journal = {Pattern Recognition},
	Keywords = {Functional genomics, K-nearest neighbor, Lazy learning, Machine learning, Multi-label learning, Natural scene classification, Text categorization},
	Number = {7},
	Pages = {2038--2048},
	Title = {{ML-KNN: A lazy learning approach to multi-label learning}},
	Volume = {40},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.patcog.2006.12.019}}

@inproceedings{Marecek2008,
	Author = {Marecek, J. and Burke, E. K. and J., Parkes A. and Rudova, H.},
	Title = {{A Branch-and-Cut Procedure for the Udine Course Timetabling Problem}},
	Year = {2008}}

@book{Applegate2006,
	Author = {Applegate, D. L. and Bixby, R. E. and Chvatal, V. and Cook, W. J.},
	Publisher = {Princeton University Press},
	Title = {{The Traveling Salesman Problem: A Computational Study}},
	Year = {2006}}

@article{Lazic2010,
	Author = {Lazi{\'c}, Jasmina and Hanafi, Sa{\"\i}d and Mladenovi{\'c}, Nenad and Uro{\v s}evi{\'c}, Dragan},
	Doi = {10.1016/j.cor.2009.09.010},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lazi{\'{c}} et al. - 2010 - Variable neighbourhood decomposition search for 0--1 mixed integer programs.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {0, 1 mixed integer programming},
	Month = {jun},
	Number = {6},
	Pages = {1055--1067},
	Title = {{Variable neighbourhood decomposition search for 0--1 mixed integer programs}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002287},
	Volume = {37},
	Year = {2010},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002287},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2009.09.010}}

@book{Wright1997,
	Abstract = {The first half of the book provides an extensive treatment of transportation planning, including data collection procedures, mathematical and computer modelling, and procedures for the development and evaluation of transportation plans, as well as non-engineering concerns of transportation. The latter half of the book deals with the design of facilities that serve transportation by land, sea, or air.},
	Author = {Wright, Paul H. and Ashford, Norman J. and Stammer, Robert J.},
	Edition = {4},
	Isbn = {0471173967},
	Pages = {688},
	Publisher = {Wiley},
	Title = {{Transportation engineering: planning and design}},
	Year = {1997}}

@article{Artigues2013a,
	Author = {Artigues, C. and Leus, R. and Nobibon, F. T.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Artigues, Leus, Nobibon - 2013 - Robust optimization for resource-constrained project scheduling with uncertain activity durations.pdf:pdf},
	Journal = {Flexible Services and Manufacturing Journal},
	Pages = {175--205},
	Title = {{Robust optimization for resource-constrained project scheduling with uncertain activity durations}},
	Volume = {25},
	Year = {2013}}

@inproceedings{Zauk2010-2,
	Author = {Zauk, Jo{\~a}o M. and B.Ara{\'u}jo, Olinto C. and Ritzen, Paulo C. F and Jr, Ghendy Cardoso and Obregon, Lauriane C. and Corr{\^e}a, Rafael},
	Booktitle = {{XVIII Congresso Brasileiro de Autom{\'a}tica}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Zauk et al. - 2010 - Programa{\c{c}}{\~{a}}o Inteira Bin{\'{a}}ria Aplicada ao Processamento de Alarmes em Sistemas El{\'{e}}tricos de Pot{\^{e}}ncia.pdf:pdf},
	Number = {1995},
	Pages = {4538--4544},
	Title = {{Programa{\c c}{\~a}o Inteira Bin{\'a}ria Aplicada ao Processamento de Alarmes em Sistemas El{\'e}tricos de Pot{\^e}ncia}},
	Year = {2010}}

@inproceedings{Fonseca2012,
	Address = {Oslo},
	Author = {Fonseca, George Henrique Godim and Santos, Haroldo Gambini and Toffolo, T{\'u}lio {\^A}ngelo Machado and Brito, Samuel Souza},
	Booktitle = {{Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling}},
	Pages = {493--496},
	Publisher = {SINTEF},
	Title = {{A SA-ILS approach for the High School Timetabling Problem}},
	Year = {2012}}

@inproceedings{Rosa2009-2,
	Address = {Cuiab{\{}{\'a}{\}}},
	Author = {Rosa, Bruno F and Souza, Marcone J F and {S{\'e}rgio R. de Souza}},
	Booktitle = {{Anais do XXXII CNMAC}},
	Pages = {930--936},
	Title = {{Formula{\{}{\c c}{\}}{\{}{\~o}{\}}es de Programa{\{}{\c c}{\}}{\{}{\~a}{\}}o Matem{\{}{\'a}{\}}tica para o Problema de Seq{\{}{\"u}{\}}enciamento em uma M{\{}{\'a}{\}}quina com Janelas de Entrega Distintas e Tempo de Prepara{\{}{\c c}{\}}{\{}{\~a}{\}}o Dependente da Seq{\{}{\"u}{\}}encia de Produ{\{}{\c c}{\}}{\{}{\~a}{\}}o}},
	Year = {2009}}

@article{Bruni2017,
	Abstract = {This paper addresses the resource-constrained project scheduling problem with uncertain activity durations. An adaptive robust optimization model is proposed to derive the resource allocation decisions that minimize the worst-case makespan, under general polyhedral uncertainty sets. The properties of the model are analyzed, assuming that the activity durations are subject to interval uncertainty where the level of robustness is controlled by a protection factor related to the risk aversion of the decision maker. A general decomposition approach is proposed to solve the robust counterpart of the resource-constrained project scheduling problem, further tailored to address the uncertainty set with the protection factor. An extensive computational study is presented on benchmark instances adapted from the PSPLIB.},
	Author = {Bruni, M. E. and Pugliese, L.P. and Beraldi, P. and Guerriero, F.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bruni et al. - 2017 - An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain act.pdf:pdf},
	Journal = {Omega},
	Keywords = {Benders decomposition, Project scheduling, Resource constraints, Robust optimization},
	Pages = {66--84},
	Title = {{An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations}},
	Volume = {71},
	Year = {2017}}

@article{Goncalves2008,
	Author = {Gon{\c c}alves, J.F. and Mendes, J.J.M. and Resende, M.G.C.},
	Doi = {10.1016/j.ejor.2006.06.074},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {genetic algorithm, metaheuristics, project management, scheduling},
	Month = {sep},
	Number = {3},
	Pages = {1171--1190},
	Title = {{A genetic algorithm for the resource constrained multi-project scheduling problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221707005929},
	Volume = {189},
	Year = {2008},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221707005929},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2006.06.074}}

@incollection{Orman2007,
	Author = {Orman, A.J. and Williams, H.P.},
	Pages = {91--104},
	Publisher = {Springer Berlin Heidelberg},
	Title = {{Optimisation, Econometric and Financial Analysis}},
	Year = {2007}}

@article{Lancia2004,
	Author = {Lancia, Giuseppe},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lancia - 2004 - Integer programming models for computational biology problems.pdf:pdf},
	Journal = {Journal of Computer Science and Technology},
	Number = {1},
	Pages = {60--77},
	Title = {{Integer programming models for computational biology problems}},
	Volume = {19},
	Year = {2004}}

@article{Papoutsis2003,
	Author = {Papoutsis, K. and Valouxis, C. and Housos, E.},
	Journal = {Journal of the Operational Research Society},
	Pages = {230--238},
	Title = {{A column generation approach for the timetabling problem of Greek high schools}},
	Volume = {54},
	Year = {2003}}

@article{Fischetti2000,
	Author = {Fischetti, M. and C., Lepschy and Minerva, G. and G., Romanin-Jacur and Toto, E.},
	Journal = {European Journal of Operational Research},
	Pages = {241--255},
	Title = {{Frequency assignment in mobile radio systems using branch-and-cut techniques}},
	Volume = {123},
	Year = {2000}}

@article{Santos2016,
	Author = {Santos, Haroldo G. and Toffolo, T{\'u}lio A.M. and Silva, Cristiano L.T.F. and {Vanden Berghe}, Greet},
	Doi = {10.1111/itor.12316},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Santos et al. - 2016 - Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem.pdf:pdf},
	Isbn = {09696016 (ISSN)},
	Issn = {09696016},
	Journal = {International Transactions in Operational Research},
	Keywords = {heuristics, local search, metaheuristics, scheduling},
	Month = {jun},
	Pages = {1--18},
	Title = {{Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem}},
	Url = {http://doi.wiley.com/10.1111/itor.12316},
	Volume = {00},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.wiley.com/10.1111/itor.12316},
	Bdsk-Url-2 = {https://doi.org/10.1111/itor.12316}}

@inproceedings{DiStefano2001,
	Address = {London, UK},
	Author = {{Di Stefano}, C. and Tettamanzi, A.},
	Editor = {{Et al.}, E. Boers},
	Pages = {452--462},
	Publisher = {Springer-Verlag},
	Title = {{An Evolutionary Algorithm for Solving the School Time-Tabling Problem}},
	Volume = {2037},
	Year = {2001}}

@article{Davis1962,
	Author = {Davis, Martin and Loveland, Donald},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Davis, Loveland - 1962 - A Machine Program for Theorem-Provingt.pdf:pdf},
	Journal = {Communications of the ACM},
	Number = {7},
	Pages = {394--397},
	Title = {{A Machine Program for Theorem-Provingt}},
	Volume = {5},
	Year = {1962}}

@book{Maniezzo2010,
	Author = {Maniezzo, V. and St{\"u}tzle, T. and Voss, S.},
	Publisher = {Springer},
	Title = {{Matheuristics: Hybridizing Metaheuristics and Mathematical Programming}},
	Year = {2010}}

@article{Csima1964,
	Author = {Csima, J. and Gotlieb, C.C.},
	Journal = {Communications of the ACM},
	Number = {3},
	Pages = {160--163},
	Title = {{Tests on a computer method for constructing school timetables}},
	Volume = {7},
	Year = {1964}}

@article{Muter2010-2,
	Author = {Muter, I and Birbil, S I and Sahin, G},
	Doi = {10.1287/ijoc.1090.0376},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {2008, 2010, 23, accepted by david woodruff, accepted november 2009, area editor for heuristic, articles in advance march, combinatorial optimization, heuristics, history, local search, november 2009, published online in, received november, revised april 2009, search and learning, september 2009, tabu search, vehicle routing},
	Number = {4},
	Pages = {603--619},
	Title = {{Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
	Volume = {22},
	Year = {2010},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1090.0376}}

@article{Beasley1987-2,
	Author = {Beasley, J E},
	Doi = {10.1016/0377-2217(87)90141-X},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {optimisation, set covering},
	Month = {jul},
	Number = {1},
	Pages = {85--93},
	Title = {{An algorithm for set covering problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
	Volume = {31},
	Year = {1987},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
	Bdsk-Url-2 = {https://doi.org/10.1016/0377-2217(87)90141-X}}

@article{Rasmussen2009,
	Author = {Rasmussen, R. V. and Trick, M.A.},
	Journal = {Annals of Operations Research},
	Pages = {45--59},
	Title = {{The timetable constrained distance minimization problem}},
	Volume = {171},
	Year = {2009}}

@inproceedings{Danna2003,
	Author = {Danna, E. and Rothberg, E. and {Le Pape}, C.},
	Title = {{Integrating Mixed Integer Programming and Local Search: A Case Study on Job-Shop Scheduling Problems}},
	Year = {2003}}

@article{Chakrabortty2017,
	Abstract = {In this paper, we consider Resource Constrained Project Scheduling Problems (RCPSPs) with known deterministic renewable resource requirements but uncertain activity durations. In this case, the activity durations are represented by random variables with different probability distribution functions. To deal with this problem, we propose an approach based on the robust optimization concept, which produces reasonably good solutions under any likely input data scenario. Depending on different uncertainty characteristics, we have developed six different heuristics to incorporate the uncertain duration as a deterministic constraint in a robust optimization model. The resulting optimization model is then solved by using a Coin-Branch {\&} Cut (CBC) solver. To judge the performance of the algorithm, we solved 30, 60, 90 and 120-activity benchmark problems from the project scheduling problem library (PSPLIB). Our proposed approach guarantees the feasibility of solutions and produces high-quality solutions, particularly for larger activity instances, compared to other existing approaches.},
	Author = {Chakrabortty, R.K. and Sarker, R.A. and Essam, D.L.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Chakrabortty, Sarker, Essam - 2017 - Resource constrained project scheduling with uncertain activity durations.pdf:pdf},
	Journal = {Computers and Industrial Engineering},
	Keywords = {Branch and cut algorithm, Heuristics, RCPSP, Robust optimization, SRCPSP},
	Pages = {537--550},
	Title = {{Resource constrained project scheduling with uncertain activity durations}},
	Volume = {112},
	Year = {2017}}

@article{Alvarez-Valdes1996,
	Author = {Alvarez-Vald{\'e}s, R. and Martin, G. and Tamarit, M.},
	Journal = {Journal of the Operational Research Society},
	Pages = {1203--1215},
	Title = {{Constructing good solutions for the Spanish school timetabling problem}},
	Volume = {47},
	Year = {1996}}

@book{DeMarco2011,
	Author = {{De Marco}, Alberto},
	Pages = {189},
	Publisher = {Springer},
	Title = {{Project Management for Facility Construction}},
	Year = {2011}}

@article{Jonker1987-2,
	Author = {Jonker, R and Volgenant, A},
	Journal = {Computing},
	Keywords = {alternierenden wegen fiir dichte, das lineare zuordnungsproblem, ein algorithmus mit kiirzesten, eine spezielle implementierung der, entwickeln einen algorithmus mit, er enthfilt neue routinen, fiir die anfangswerte und, kiirzesten alternierenden wegen ffir, kiirzesten-, linear assignment problem, pascal implementation, shortest path methods, und diinne zuordnungsprobleme, wir},
	Pages = {325--340},
	Title = {{A shortest augmenting path algorithm for dense and sparse linear assignment problems}},
	Url = {http://www.springerlink.com/index/7003M6N54004M004.pdf},
	Volume = {340},
	Year = {1987},
	Bdsk-Url-1 = {http://www.springerlink.com/index/7003M6N54004M004.pdf}}

@book{Santos2004,
	Abstract = {The School Timetabling Problem (STP) regards the weekly scheduling of encounters between teachers and classes. Since this scheduling must satisfy organizational, pedagogical and personal costs, this problem is recognized as a very difficult combinatorial optimization problem. This work presents a new Tabu Search (TS) heuristic for STP. Two different memory-based diversification strategies are presented. Computational experiments with real world instances, in comparison with a previously proposed TS found in literature, show that the proposed method produces better solutions for all instances, as well as observed increased speed in the production of good quality solutions. {\copyright} Springer-Verlag 2004.},
	Author = {Santos, H.G. and Ochi, L.S. and Souza, M.J.F.},
	Booktitle = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
	Pages = {468--481},
	Title = {{An efficient tabu search heuristic for the school timetabling problem}},
	Volume = {3059},
	Year = {2004}}

@article{Bron1973,
	Author = {Bron, C. and Kerbosch, J.},
	Doi = {10.1145/362342.362367},
	Issn = {0001-0782},
	Journal = {Commun. ACM},
	Keywords = {backtracking algorithm, branch and bound technique, cliques, clusters, maximal complete subgraphs, recursion},
	Mendeley-Tags = {backtracking algorithm,branch and bound technique,cliques,clusters,maximal complete subgraphs,recursion},
	Month = {sep},
	Number = {9},
	Pages = {575--577},
	Title = {{Algorithm 457: finding all cliques of an undirected graph}},
	Url = {http://doi.acm.org/10.1145/362342.362367},
	Volume = {16},
	Year = {1973},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/362342.362367},
	Bdsk-Url-2 = {https://doi.org/10.1145/362342.362367}}

@article{Abramson1991,
	Author = {Abramson, D.},
	Journal = {Management Science},
	Pages = {98--113},
	Title = {{Constructing school timetables using simulated annealing: sequential and parallel algorithms}},
	Volume = {37},
	Year = {1991}}

@article{year,
	Author = {{J{\"u}nger, M. and Mutzel}, P.},
	Journal = {Algorithmica},
	Pages = {33--59},
	Title = {{Maximum planar subgraphs and nice embeddings: Practical layout tools}},
	Volume = {16},
	Year = {1996}}

@article{Lewis2008,
	Abstract = {The set-partitioning problem (SPP) is widely known for both its application potential and its computational challenge. This NP-hard problem is known to pose considerable difficulty for classical solution methods such as those based on LP technologies. In recent years, the unconstrained binary quadratic program has proven to perform well as a unified modeling and solution framework for a variety of IP problems. In this paper we illustrate how this unified framework can be applied to SPP. Computational experience is presented, illustrating the attractiveness of the approach. ?? 2006 Elsevier Ltd. All rights reserved.},
	Author = {Lewis, Mark and Kochenberger, Gary and Alidaee, Bahram},
	Doi = {10.1016/j.cor.2006.04.002},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lewis, Kochenberger, Alidaee - 2008 - A new modeling and solution approach for the set-partitioning problem.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers and Operations Research},
	Keywords = {Combinatorial problems, Metaheuristics, Set partitioning},
	Number = {3},
	Pages = {807--813},
	Title = {{A new modeling and solution approach for the set-partitioning problem}},
	Volume = {35},
	Year = {2008},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.cor.2006.04.002}}

@article{Fukasawa2006,
	Author = {Fukasawa, R. and Longo, H. and Lysgaard, J. and {Poggi de Arag{\~a}o}, M.V. and Reis, M. and Uchoa, E. and Werneck, R.F.},
	Journal = {Mathematical Programming},
	Pages = {491--511},
	Title = {{Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem}},
	Volume = {106},
	Year = {2006}}

@article{Brito2015,
	Author = {Brito, S.S. and Santos, H.G. and Poggi, M.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Brito, Santos, Poggi - 2015 - A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming.pdf:pdf},
	Journal = {Electronic Notes in Discrete Mathematics},
	Keywords = {Cliques, Conflict graphs, Cutting planes, Integer programming, Odd-holes},
	Pages = {355--360},
	Title = {{A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming}},
	Volume = {50},
	Year = {2015}}

@book{Pochet2006,
	Author = {Pochet, Y. and Wolsey, L. A.},
	Publisher = {Springer},
	Title = {{Production Planning by Mixed Integer Programming}},
	Year = {2006}}

@article{DeGans1981,
	Author = {{De Gans}, O.B.},
	Journal = {European Journal of Operational Research},
	Pages = {175--182},
	Title = {{A computer timetabling system for secondary schools in the Netherlands}},
	Volume = {7},
	Year = {1981}}

@article{Drexl1997,
	Author = {Drexl, A. and Salewski, F.},
	Journal = {European Journal of Operational Research},
	Month = {oct},
	Number = {1},
	Pages = {193--214},
	Title = {{Distribution requirements and compactness constraints in school timetabling}},
	Volume = {102},
	Year = {1997}}

@inproceedings{Artigues2013,
	Author = {Artigues, C. and Hebrard, E.},
	Booktitle = {{MISTA 2013}},
	Pages = {815--819},
	Title = {{MIP Relaxation and Large Neighborhood Search for a Multi-Mode Resource-Constrained Multi-Project Scheduling Problem}},
	Year = {2013}}

@article{Barnhart1998,
	Author = {Barnhart, C. and Johnson, E. L. and Nemhauser, G. L. and Savelsbergh, M. W. P. and Vance, P. H.},
	Journal = {Operations Research},
	Pages = {316--329},
	Title = {{Branch-and-price: column generation for solving huge integer programs}},
	Url = {http://citeseer.ist.psu.edu/barnhart96branchprice.html},
	Volume = {46},
	Year = {1998},
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/barnhart96branchprice.html}}

@inproceedings{Gotlieb1963,
	Address = {Amnsterdam},
	Author = {Gotlieb, C.C.},
	Editor = {Popplewell, C. M.},
	Pages = {73--77},
	Title = {{The construction of class-teacher timetables}},
	Year = {1963}}

@incollection{Dash2006,
	Annote = {From Duplicate 2 (Valid Inequalities Based on Simple Mixed-Integer Sets - Dash, S; G{\"u}nl{\"u}k, O) NULL},
	Author = {Dash, S and G{\"u}nl{\"u}k, O},
	Booktitle = {{Integer Programming and Combinatorial Optimization}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Dash, G{\"{u}}nl{\"{u}}k - 2004 - Valid Inequalities Based on Simple Mixed-Integer Sets.pdf:pdf},
	Pages = {33--45},
	Title = {{Valid Inequalities Based on Simple Mixed-Integer Sets}},
	Volume = {3064},
	Year = {2004}}

@article{Lorenzoni2006,
	Abstract = {We discuss a problem of attending ships within agreed time limits at a port under the condition of the first come first served order. In addition, we indicate the use of the developed tool to support decisions at a strategic level with the objective of improving the attendance of the ships. The tool is based on a mathematical model of a multi-mode resource-constrained scheduling problem and on an extension of a differential evolution algorithm. We illustrate the implementation by computational tests with data generated on the basis of the characteristics of a real port environment. {\copyright} 2006 Elsevier Ltd. All rights reserved.},
	Author = {Lorenzoni, L.L. and Ahonen, H. and Alvarenga, A.G.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lorenzoni, Ahonen, Alvarenga - 2006 - A multi-mode resource-constrained scheduling problem in the context of port operations.pdf:pdf},
	Journal = {Computers and Industrial Engineering},
	Keywords = {Attending ships, Differential evolution algorithm, Layday period, Local search, Multi-mode resource-constrained scheduling, Port operations},
	Number = {1-2},
	Pages = {55--65},
	Title = {{A multi-mode resource-constrained scheduling problem in the context of port operations}},
	Volume = {50},
	Year = {2006}}

@book{Bertsekas1999,
	Author = {Bertsekas, D. P.},
	Publisher = {Athena Scientific},
	Title = {{Nonlinear Programming}},
	Year = {1999}}

@inproceedings{Cambazard2008,
	Author = {Cambazard, H. and E., Hebrard and O'Sullivan, B. and Papadopoulos, A.},
	Title = {{Local Search and Constraint Programming for the Post Enrolment-based Course Timetabling Problem}},
	Year = {2008}}

@article{Dantzig54,
	Author = {{G. Dantzig}, R. Fulkerson and Johnson, S.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/G. Dantzig - 1954 - Solution of a Large-Scale Traveling-Salesman Problem.pdf:pdf},
	Journal = {Journal of the Operations Research Society of America},
	Number = {4},
	Pages = {393--410},
	Title = {{Solution of a Large-Scale Traveling-Salesman Problem}},
	Volume = {2},
	Year = {1954}}

@phdthesis{Borndorfer1998,
	Author = {Borndorfer, R.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Borndorfer - 1998 - Aspects of Set Packing, Partitioning, and Covering.pdf:pdf},
	Title = {{Aspects of Set Packing, Partitioning, and Covering}},
	Year = {1998}}

@article{Fayyad1996,
	Author = {Fayyad, Usama and Piatetsky-Shapiro, Gregory and Smyth, Padhraic},
	Journal = {AI Magazine},
	Number = {3},
	Pages = {37--54},
	Title = {{From Data Mining to Knowledge Discovery in Databases}},
	Volume = {17},
	Year = {1996}}

@incollection{Araujo2016,
	Abstract = {{\copyright} Springer International Publishing Switzerland 2016. Methods based on Stochastic Local Search (SLS) have been ranked as the best heuristics available for many hard combinatorial optimization problems. The design of SLS methods which use many neighborhoods poses difficult questions regarding the exploration of these neighborhoods: how much computational effort should be invested in each neighborhood? Should this effort remain fixed during the entire search or should it be dynamically updated as the search progresses? Additionally, is it possible to learn the best configurations during runtime without sacrificing too much the computational efficiency of the search method? In this paper we explore different tuning strategies to configure a state-of-the-art algorithm employing fourteen neighborhoods for the Multi-Mode Resource Constrained Multi-Project Scheduling Problem. An extensive set of computational experiments provide interesting insights for neighborhood selection and improved upper bounds for many hard instances from the literature.},
	Address = {Cham},
	Author = {Araujo, J.A.S. Janniele A S and Santos, Haroldo G H.G. and Baltar, D.D. Davi D and Toffolo, T{\'u}lio A M T.A.M. and Wauters, Tony},
	Booktitle = {{Hybrid Metaheuristics: 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings}},
	Doi = {10.1007/978-3-319-39636-1_9},
	Editor = {Blesa, J Maria and Blum, Christian and Cangelosi, Angelo and Cutello, Vincenzo and {DI NUOVO}, ALESSANDRO and Pavone, Mario and Talbi, El-Ghazali},
	Isbn = {978-3-319-39636-1},
	Issn = {16113349},
	Keywords = {Learning, Multineigh borhood search, Online and offline tuning, Project scheduling, Stochastic local search},
	Pages = {118--130},
	Publisher = {Springer International Publishing},
	Title = {{Neighborhood Composition Strategies in Stochastic Local Search}},
	Url = {http://dx.doi.org/10.1007/978-3-319-39636-1{\_}9},
	Volume = {9668},
	Year = {2016},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-319-39636-1%7B%5C_%7D9},
	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-3-319-39636-1_9}}

@article{Jepsen2006,
	Author = {Jepsen, Mads and Spoorendonk, Simon and Pisinger, David},
	Doi = {10.1287/xxxx.0000.0000},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Jepsen, Spoorendonk, Pisinger - 2006 - Introducing Subset Row Inequalities in a Branch-and-Cut-and-Price Algorithm for the Vehicle Routi.pdf:pdf},
	Journal = {Operations Research},
	Number = {2},
	Pages = {497--511},
	Title = {{Introducing Subset Row Inequalities in a Branch-and-Cut-and-Price Algorithm for the Vehicle Routing Problem with Time Windows}},
	Volume = {56},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1287/xxxx.0000.0000}}

@article{Marchand2002,
	Abstract = {This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for (i) general integer programs, (ii) problems with local structure such as knapsack constraints, and (iii) problems with 0--1 coefficient matrices, such as set packing, are examined in turn. Finally, the use of valid inequalities for classes of problems with structure, such as network design, is explored.},
	Author = {Marchand, Hugues and Martin, Alexander and Weismantel, Robert and Wolsey, Laurence},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Marchand et al. - 2002 - Cutting planes in integer and mixed integer programming.pdf:pdf},
	Journal = {Discrete Applied Mathematics},
	Keywords = {Cutting planes, Mixed integer programming},
	Pages = {397--446},
	Title = {{Cutting planes in integer and mixed integer programming}},
	Volume = {123},
	Year = {2002}}

@article{Chvatal1973,
	Author = {Chv{\'a}tal, V.},
	Journal = {Discrete Mathematics},
	Pages = {305--337},
	Title = {{Edmonds polytopes and a hierarchy of combinatorial problems}},
	Volume = {4},
	Year = {1973}}

@article{Gendreau1994,
	Author = {Gendreau, M. and Hertz, A. and Laporte, G.},
	Journal = {Management Science},
	Month = {oct},
	Number = {10},
	Pages = {1276--1290},
	Title = {{A tabu search heuristic for the vehicle routing problem}},
	Volume = {40},
	Year = {1994}}

@article{Hoffman1993,
	Author = {Hoffman, K.L. and Padberg, M.},
	Journal = {Management Science},
	Number = {6},
	Pages = {657--682},
	Title = {{Solving airline crew scheduling problems by branch-and-cut}},
	Volume = {39},
	Year = {1993}}

@article{Sprecher1998,
	Author = {Sprecher, Arno and Drexl, Andreas},
	Doi = {10.1016/S0377-2217(97)00348-2},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Sprecher, Drexl - 1998 - Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {branch-and-bound, computational, heuristic, multiple modes, project scheduling, resource constraints},
	Month = {jun},
	Number = {2},
	Pages = {431--450},
	Title = {{Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221797003482},
	Volume = {107},
	Year = {1998},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221797003482},
	Bdsk-Url-2 = {https://doi.org/10.1016/S0377-2217(97)00348-2}}

@inproceedings{Gomes2013,
	Abstract = {This paper proposes an adaptation of the RINS MIP heuristic which explicitly explores pre-processing techniques. The method systematically searches for the ideal number of fixations to produce sub-problems of controlled size. These problems are explored in a Variable Neighborhood Descent fashion until a stopping criterion is met. Preliminary experiments implemented upon the open source MIP solver COIN-OR CBC are presented. {\copyright} 2013 Springer-Verlag.},
	Author = {Gomes, T.M. Thiago M. and Santos, Haroldo Gambini H.G. and Souza, M.J.F. Marcone J F},
	Booktitle = {{Hybrid Metaheuristics}},
	Doi = {10.1007/978-3-642-38516-2_1},
	Editor = {Blesa, Maria J. and Blum, Christian and Festa, Paola and Roli, Andrea and Sampels, Michael},
	Isbn = {9783642385155},
	Issn = {03029743 16113349},
	Pages = {1--11},
	Publisher = {Springer},
	Title = {{A Pre-processing Aware RINS Based MIP Heuristic}},
	Volume = {7919 LNCS},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-38516-2_1}}

@article{Fischetti2007a-2,
	Annote = {From Duplicate 1 (MIPping closures: An instant survey - Fischetti, Matteo; Lodi, Andrea) NULL},
	Author = {Fischetti, Matteo and Lodi, Andrea},
	Doi = {10.1007/s00373-007-0711-6},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - MIPping closures An instant survey.pdf:pdf},
	Issn = {09110119},
	Journal = {Graphs and Combinatorics},
	Keywords = {Cutting plane methods, Mixed integer programs, Separation problems},
	Number = {SUPPL. 1},
	Pages = {233--243},
	Title = {{MIPping closures: An instant survey}},
	Volume = {23},
	Year = {2007},
	Bdsk-Url-1 = {https://doi.org/10.1007/s00373-007-0711-6}}

@article{Wauters2016,
	Abstract = {{\copyright} 2014 Springer Science+Business Media New York Scheduling projects is a difficult and time consuming process, and has far-reaching implications for any organization's operations. By generalizing various aspects of project scheduling, decision makers are enabled to capture reality and act accordingly. In the context of the MISTA 2013 conference, the first MISTA challenge, organized by the authors, introduced such a general problem model: the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (MRCMPSP). The present paper reports on the competition and provides a discussion on its results. Furthermore, it provides an analysis of the submitted algorithms, and a study of their common elements. By making all benchmark datasets and results publicly available, further research on the MRCMPSP is stimulated.},
	Author = {Wauters, T. and Kinable, J. and Smet, P. and Vancroonenburg, W. and {Vanden Berghe}, G. and Verstichel, J.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Wauters et al. - 2016 - The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem The MISTA 2013 challenge.pdf:pdf},
	Journal = {Journal of Scheduling},
	Keywords = {Competition, Heuristics, Multi-mode, Multi-project, Project scheduling},
	Number = {3},
	Pages = {271--283},
	Publisher = {Springer US},
	Title = {{The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem: The MISTA 2013 challenge}},
	Volume = {19},
	Year = {2016}}

@incollection{Fischetti2011,
	Author = {Fischetti, M. and Lodi, A.},
	Booktitle = {{Wiley Encyclopedia of Operations Research and Management Science}},
	Editor = {Cochran, James J},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2011 - Heuristics in Mixed Integer Programming.pdf:pdf},
	Pages = {738--747},
	Publisher = {John Wiley {\&} Sons},
	Title = {{Heuristics in Mixed Integer Programming}},
	Year = {2011}}

@article{Fischetti2004,
	Author = {Fischetti, M. and Polo, C. and Scantamburlo, M.},
	Journal = {Networks},
	Month = {jul},
	Number = {2},
	Pages = {61--72},
	Title = {{A Local Branching Heuristic for Mixed-Integer Programs with 2-Level Variables}},
	Volume = {44},
	Year = {2004}}

@article{Karp1972,
	Abstract = {A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements of other countable domains. Through simple encodings from such domains into the set of words over a finite alphabet these problems can be converted into language recognition problems, and we can inquire into their computational complexity. It is reasonable to consider such a problem satisfactorily solved when an algorithm for its solution is found which terminates within a number of steps bounded by a polynomial in the length of the input. We show that a large number of classic unsolved problems of covering, matching, packing, routing, assignment and sequencing are equivalent, in the sense that either each of them possesses a polynomial-bounded algorithm or none of them does.},
	Author = {Karp, Richard M.},
	Journal = {Complexity of Computer Computations},
	Pages = {85--103},
	Title = {{Reducibility Among Combinatorial Problems}},
	Year = {1972}}

@article{Breiman2001,
	Archiveprefix = {arXiv},
	Arxivid = {http://dx.doi.org/10.1023{\%}2FA{\%}3A1010933404324},
	Author = {Breiman, L.},
	Eprint = {/dx.doi.org/10.1023{\%}2FA{\%}3A1010933404324},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Breiman - 2001 - Random forests.pdf:pdf},
	Journal = {Machine Learning},
	Number = {1},
	Pages = {5--32},
	Primaryclass = {http:},
	Title = {{Random forests}},
	Volume = {45},
	Year = {2001}}

@article{Pataki2003,
	Author = {Pataki, G.},
	Journal = {SIAM Review},
	Pages = {116--123},
	Title = {{Teaching Integer Programming Formulations Using the Traveling Salesman Problem}},
	Volume = {45},
	Year = {2003}}

@article{Demassey2005,
	Abstract = {We propose a cooperation method between constraint programming and integer programming to compute lower bounds for the resource-constrained project scheduling problem (RCPSP). The lower bounds are evaluated through linear-programming (LP) relaxations of two different integer linear formulations. Efficient resource-constraint propagation algorithms serve as a preprocessing technique for these relaxations. The originality of our approach is to use additionally some deductions performed by constraint propagation, and particularly by the shaving technique, to derive new cutting planes that strengthen the linear programs. Such new valid linear inequalities are given in this paper, as well as a computational. analysis of our approach. Through this analysis, we also compare the two considered linear formulations for the RCPSP and confirm the efficiency of lower bounds computed in a destructive way.},
	Author = {Demassey, Sophie and Artigues, Christian and Michelon, Philippe},
	Doi = {10.1287/ijoc.1030.0043},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Demassey, Artigues, Michelon - 2005 - Constraint-Propagation-Based Cutting Planes An Application to the Resource-Constrained Project Sch.pdf:pdf},
	Isbn = {1091-9856},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Keywords = {accepted by john w, accepted may 2003, area editor, chinneck, constraint propagation, cutting plane, december 2002, history, march 2003, received february 2001, resource-constrained project scheduling problem, revised december 2001, shaving},
	Number = {1},
	Pages = {52--65},
	Title = {{Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem}},
	Url = {http://pubsonline.informs.org/doi/10.1287/ijoc.1030.0043},
	Volume = {17},
	Year = {2005},
	Bdsk-Url-1 = {http://pubsonline.informs.org/doi/10.1287/ijoc.1030.0043},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1030.0043}}

@article{Burke2010,
	Author = {Burke, E.K. and Mare$\backslash$vcek, J. and Parkes, A.J. and Rudov{\'a}, H.},
	Journal = {Comput. Oper. Res.},
	Number = {1},
	Pages = {582--597},
	Title = {{Decomposition, Reformulation, and Diving in University Course Timetabling}},
	Volume = {37},
	Year = {2010}}

@article{Fischetti2007-2,
	Author = {Fischetti, M. and Lodi, A.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - Optimizing over the first Chv{\`{a}}tal closure.pdf:pdf},
	Journal = {Mathematical Programming B},
	Number = {1},
	Pages = {3--20},
	Title = {{Optimizing over the first Chv{\`a}tal closure}},
	Volume = {110},
	Year = {2007}}

@article{Frangioni2005-2,
	Author = {Frangioni, Antonio},
	Journal = {Annals of Operations Research},
	Keywords = {integer linear programs, lagrangian dual},
	Pages = {163--193},
	Title = {{About Lagrangian methods in integer optimization}},
	Url = {http://link.springer.com/article/10.1007/s10479-005-3447-9},
	Year = {2005},
	Bdsk-Url-1 = {http://link.springer.com/article/10.1007/s10479-005-3447-9}}

@article{McCollum2010,
	Author = {McCollum, B. and Schaerf, A. and Paechter, B. and McMullan, P. and Lewis, R. and Parkes, A. J. and Gaspero, L. and Qu, R. and Burke, E. K.},
	Doi = {10.1287/ijoc.1090.0320},
	Issn = {1526-5528},
	Journal = {INFORMS J. on Computing},
	Number = {1},
	Pages = {120--130},
	Title = {{Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition}},
	Volume = {22},
	Year = {2010},
	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.1090.0320}}

@inproceedings{Pigatti2005,
	Address = {Amsterdam, Holanda},
	Author = {Pigatti, A. and {Poggi de Arag{\~a}o}, M. and Uchoa, E.},
	Pages = {385--395},
	Publisher = {Elsevier Science},
	Title = {{Stabilized branch-and-cut-and-price for the generalized assigment problem}},
	Volume = {19},
	Year = {2005}}

@article{Kirkpatrick1983,
	Author = {Kirkpatrick, S. and Gelatt, C. D. and Vecchi, M. P.},
	Journal = {Science},
	Pages = {671--680},
	Title = {{Optimization by Simulated Annealing}},
	Volume = {220},
	Year = {1983}}

@incollection{Ross1995,
	Address = {Berlin},
	Author = {Ross, P. and Corne, D. and H., Fang},
	Editor = {Eiben, A. E. and Manderick, B. and Z., Ruttkay},
	Publisher = {Springer},
	Title = {{Successful Lecture Timetabling with Evolutionary Algorithms}},
	Year = {1995}}

@article{Colorni1998,
	Author = {Colorni, A. and Dorigo, M. and Maniezzo, V.},
	Journal = {Computational Optimization and Applications},
	Number = {3},
	Pages = {277--298},
	Title = {{Metaheuristics for High-School Timetabling}},
	Volume = {9},
	Year = {1998}}

@book{Junger2010,
	Annote = {From Duplicate 2 (50 Years of Integer Programming 1958--2008 - J{\"u}nger, Michael; Liebling, Thomas; Naddef, Denis; Nemhauser, George; Pulleyblank, William; Reinelt, Gerhard; Rinaldi, Giovanni; Wolsey, Laurence) NULL},
	Archiveprefix = {arXiv},
	Arxivid = {arXiv:1011.1669v3},
	Doi = {10.1017/CBO9781107415324.004},
	Editor = {J{\"u}nger, M. and Liebling, T. and Naddef, D. and Nemhauser, G. and Pulleyblank, W. and Reinelt, G. and Rinaldi, G. and Wolsey, L.},
	Eprint = {arXiv:1011.1669v3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - 2010 - 50 Years of Integer Programming 1958--2008.pdf:pdf},
	Isbn = {9788578110796},
	Issn = {1098-6596},
	Pmid = {25246403},
	Publisher = {Springer},
	Title = {{50 Years of Integer Programming}},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1017/CBO9781107415324.004}}

@book{Glover1997a,
	Address = {Boston},
	Author = {Glover, F. and Laguna, M.},
	Publisher = {Kluwer},
	Title = {{Tabu Search}},
	Year = {1997}}

@article{Adida2009,
	Abstract = {In a rapidly changing and highly uncertain environment, Petri net-based project management systems can be used in the rescheduling (control reconfiguration) of projects, when unforeseen changes occur or new data estimates become available. However, having to reschedule the project after it has started can result in significant suboptimality due to increased cost. In this paper, we present a solution method which is, to a large extent, robust to data uncertainty and does not require rescheduling for a certain predefined level of uncertainty. We build the model using robust optimisation techniques which address data uncertainty in project parameters, by taking advantage of risk pooling and without knowledge of their probability distributions. We illustrate that the total cost when the robust solution is used is generally lower than the cost of reconfiguring the deterministic solution, or than a penalty cost due to overtime of the deterministic solution, for a high enough penalty cost per time unit. We find that the robust solution is better protected against constraint violations, including time and cost overruns. Copyright 2009, Inderscience Publishers.},
	Author = {Adida, E. and Joshi, P.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Adida, Joshi - 2009 - A robust optimisation approach to project scheduling and resource allocation.pdf:pdf},
	Journal = {International Journal of Services Operations and Informatics},
	Keywords = {2009, a robust optimisation approach, adida, allocation, and joshi, control reconfiguration, e, follows, optimisation under uncertainty, p, petri nets, project management, reference to this paper, resource, robust optimisation, should be made as, to project scheduling and},
	Number = {2},
	Pages = {169},
	Title = {{A robust optimisation approach to project scheduling and resource allocation}},
	Volume = {4},
	Year = {2009}}

@article{Lopez-Ibanez2014,
	Author = {L{\'o}pez-Ib{\'a}{\~n}ez, Manuel and St{\"u}tzle, Thomas},
	Doi = {10.1016/j.ejor.2013.10.043},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/L{\'{o}}pez-Ib{\'{a}}{\~{n}}ez, St{\"{u}}tzle - 2014 - Automatically improving the anytime behaviour of optimisation algorithms.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Month = {jun},
	Number = {3},
	Pages = {569--582},
	Title = {{Automatically improving the anytime behaviour of optimisation algorithms}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221713008667},
	Volume = {235},
	Year = {2014},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221713008667},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2013.10.043}}

@article{Muller2018,
	Author = {M{\"u}ller, T. and Rudov{\'a}, H. and M{\"u}llerov{\'a}, Z.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/M{\"{u}}ller, Rudov{\'{a}}, M{\"{u}}llerov{\'{a}} - 2018 - University course timetabling and International Timetabling Competition 2019.pdf:pdf},
	Journal = {Proceedings of the 12th International Conference on the Practice ant Theory of Automated Timetabling},
	Keywords = {Competition {\textcdot}, Real-world problems, University course timetabling {\textcdot}},
	Pages = {5--31},
	Title = {{University course timetabling and International Timetabling Competition 2019}},
	Url = {http://www.itc2019.org.},
	Year = {2018},
	Bdsk-Url-1 = {http://www.itc2019.org.}}

@article{Zonghao98,
	Author = {Gu, Zonghao and Nemhauser, George L. and Savelsbergh, Martin W. P.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gu, Nemhauser, Savelsbergh - 1998 - Lifted Cover Inequalities for 0-1 Integer Programs Computation.pdf:pdf},
	Journal = {INFORMS Journal on Computing},
	Number = {4},
	Pages = {427--437},
	Title = {{Lifted Cover Inequalities for 0-1 Integer Programs: Computation}},
	Volume = {10},
	Year = {1998}}

@book{Griffith2002,
	Author = {Griffith, A.},
	Publisher = {McGraw-Hill},
	Title = {{GCC: The Complete Reference}},
	Year = {2002}}

@misc{Martin2013,
	Author = {Martin, Kipp},
	Title = {{COIN-OR Technical Leadership Council Home Page}},
	Url = {https://projects.coin-or.org/CoinTLC},
	Year = {2013},
	Bdsk-Url-1 = {https://projects.coin-or.org/CoinTLC}}

@article{Kone2011,
	Annote = {From Duplicate 1 (Event-based MILP models for resource-constrained project scheduling problems - Kon{\'e}, Oumar; Artigues, Christian; Lopez, Pierre; Mongeau, Marcel) NULL},
	Author = {Kon{\'e}, Oumar and Artigues, Christian and Lopez, Pierre and Mongeau, Marcel},
	Doi = {10.1016/j.cor.2009.12.011},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kon{\'{e}} et al. - 2011 - Event-based MILP models for resource-constrained project scheduling problems.pdf:pdf},
	Issn = {03050548},
	Journal = {Computers {\&} Operations Research},
	Keywords = {mixed integer linear programming, resource-constrained project scheduling},
	Month = {jan},
	Number = {1},
	Pages = {3--13},
	Title = {{Event-based MILP models for resource-constrained project scheduling problems}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809003360},
	Volume = {38},
	Year = {2011},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809003360},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2009.12.011}}

@book{Demeulemeester2002,
	Abstract = {Our objectives in writing Project Scheduling: A Research Handbook are threefold: (1) Provide a unified scheme for classifying the numerous project scheduling problems occurring in practice and studied in the literature; (2) Provide a unified and up-to-date treatment of the state-of-the-art procedures developed for their solution; (3) Alert the reader to various important problems that are still in need of considerable research effort. Project Scheduling: A Research Handbook has been divided into four parts. Part I consists of three chapters on the scope and relevance of project scheduling, on the nature of project scheduling, and finally on the introduction of a unified scheme that will be used in subsequent chapters for the identification and classification of the project scheduling problems studied in this book. Part II focuses on the time analysis of project networks. Part III carries the discussion further into the crucial topic of scheduling under scarce resources. Part IV deals with robust scheduling and stochastic scheduling issues. Numerous tables and figures are used throughout the book to enhance the clarity and effectiveness of the discussions. For the interested and motivated reader, the problems at the end of each chapter should be considered as an integral part of the presentation.},
	Author = {Demeulemeester, Erik L. and Herroelen, Willy S.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Demeulemeester, Herroelen - 2002 - Project Scheduling A Research Handbook.pdf:pdf},
	Language = {Ingl{\^e}s},
	Pages = {685},
	Publisher = {Kluwer Academic Publishers},
	Title = {{Project Scheduling: A Research Handbook}},
	Year = {2002}}

@article{Lancia2008,
	Author = {Lancia, G. and Serafini, P.},
	Doi = {10.1287/ijoc.1080.0285},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lancia, Serafini - 2008 - A Set-Covering Approach with Column Generation for Parsimony Haplotyping.pdf:pdf},
	Issn = {1091-9856},
	Journal = {INFORMS Journal on Computing},
	Month = {sep},
	Number = {1},
	Pages = {151--166},
	Title = {{A Set-Covering Approach with Column Generation for Parsimony Haplotyping}},
	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1080.0285},
	Volume = {21},
	Year = {2008},
	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1080.0285},
	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1080.0285}}

@article{Bertsimas2018,
	Author = {Bertsimas, D. and Dunn, J. and Pawlowski, C. and Zhuo, Y.D.},
	Doi = {10.1287/ijoo.2018.0001},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bertsimas et al. - 2018 - Robust Classification.pdf:pdf},
	Isbn = {0000000327817},
	Issn = {2575-1484},
	Journal = {INFORMS Journal on Optimization},
	Keywords = {classification problems, machine learning, robust optimization},
	Number = {1},
	Pages = {2--34},
	Title = {{Robust Classification}},
	Volume = {1},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1287/ijoo.2018.0001}}

@article{Alfandari2014-2,
	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
	Doi = {10.1016/j.dam.2011.11.030},
	Issn = {0166218X},
	Journal = {Discrete Applied Mathematics},
	Pages = {13--19},
	Title = {{A note on the Clustered Set Covering Problem}},
	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
	Volume = {164},
	Year = {2014},
	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
	Bdsk-Url-2 = {https://doi.org/10.1016/j.dam.2011.11.030}}

@book{Finger2002-2,
	Author = {Finger, Markus and St{\"u}tzle, T and Louren{\c c}o, H},
	Pages = {61--71},
	Title = {{Exploiting fitness distance correlation of set covering problems}},
	Url = {http://link.springer.com/chapter/10.1007/3-540-46004-7{\_}7},
	Year = {2002},
	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/3-540-46004-7%7B%5C_%7D7}}

@article{Coll2002,
	Author = {Coll, P. and Marenco, J. and {M{\'e}ndez D{\'\i}az}, I. and Zabala, P.},
	Journal = {Annals of Operations Research},
	Pages = {79--90},
	Title = {{Facets of the Graph Coloring Polytope}},
	Volume = {116},
	Year = {2002}}

@article{Koch2011,
	Annote = {From Duplicate 1 (MIPLIB 2010 - Koch, T.; Achterberg, T.; Andersen, E.; Bastert, O.; Berthold, T.; Bixby, R.; Danna, E.; Gamrath, G.; Gleixner, A.; Heinz, S.; Lodi, A.; Mittelmann, H.; Ralphs, T.; Salvagnin, D.; Steffy, D.; Wolter, K.) NULL},
	Author = {Koch, T. and Achterberg, T. and Andersen, E. and Bastert, O. and Berthold, T. and Bixby, R. and Danna, E. and Gamrath, G. and Gleixner, A. and Heinz, S. and Lodi, A. and Mittelmann, H. and Ralphs, T. and Salvagnin, D. and Steffy, D. and Wolter, K.},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Koch et al. - 2011 - MIPLIB 2010.pdf:pdf},
	Issn = {1867-2949},
	Journal = {Mathematical Programming Computation},
	Keywords = {Mathematics, Statistics, and},
	Mendeley-Tags = {Mathematics,Statistics,and},
	Number = {2},
	Pages = {103--163},
	Title = {{MIPLIB 2010}},
	Url = {http://dx.doi.org/10.1007/s12532-011-0025-9},
	Volume = {3},
	Year = {2011},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/s12532-011-0025-9}}

@article{Neumann2017-2,
	Author = {Neumann, Christoph and Stein, Oliver and Nathan, Sudermann-Merx},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Neumann, Stein, Nathan - 2017 - A feasible rounding approach for mixed-integer optimization problems.pdf:pdf},
	Keywords = {2000, 2017, 90c10, 90c11, consistency, granularity, inner parallel set, mathematics subject classification, preliminary citation optimization online, preprint id 2017-12-6367, rounding},
	Title = {{A feasible rounding approach for mixed-integer optimization problems}},
	Year = {2017}}

@article{Fischetti2009-2,
	Abstract = {Abstract Finding a feasible solution of a given mixed-integer programming (MIP) model is a very important {\$}{\$}{\{}$\backslash$mathcal{\{}NP{\}}{\}}{\$}{\$} -complete problem that can be extremely hard in practice. Feasibility Pump (FP) is a heuristic scheme for finding a feasible$\backslash$nsolution to general MIPs that can be viewed as a clever way to round a sequence of fractional solutions of the LP relaxation,$\backslash$nuntil a feasible one is eventually found. In this paper we study the effect of replacing the original rounding function (which$\backslash$nis fast and simple, but somehow blind) with more clever rounding heuristics. In particular, we investigate the use of a diving-like$\backslash$nprocedure based on rounding and constraint propagation---a basic tool in Constraint Programming. Extensive computational results$\backslash$non binary and general integer MIPs from the literature show that the new approach produces a substantial improvement of the$\backslash$nFP success rate, without slowing-down the method and with a significantly better quality of the feasible solutions found.},
	Author = {Fischetti, Matteo and Salvagnin, Domenico},
	Doi = {10.1007/s12532-009-0007-3},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2009 - Feasibility pump 2.0.pdf:pdf},
	Isbn = {1867-2949},
	Issn = {18672949},
	Journal = {Mathematical Programming Computation},
	Keywords = {Constraint programming, Constraint propagation, Mixed-integer programming, Primal heuristics},
	Number = {2-3},
	Pages = {201--222},
	Title = {{Feasibility pump 2.0}},
	Volume = {1},
	Year = {2009},
	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-009-0007-3}}

@article{Fischetti2005-2,
	Author = {Fischetti, M. and Glover, F. and Lodi, A.},
	Journal = {Mathematical Programming},
	Pages = {91--104},
	Title = {{The feasibility pump}},
	Volume = {104},
	Year = {2005}}

@incollection{Gamrath2016-2,
	Author = {Gamrath, Gerald and Berthold, Timo and Heinz, Stefan and Winkler, Michael},
	Booktitle = {{Optimization in the Real World: Toward Solving Real-World Optimization Problems}},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath et al. - 2016 - Structure-Based Primal Heuristics forMixed Integer Programming.pdf:pdf},
	Keywords = {domain propagation, large neighborhood search, primal heuristics},
	Pages = {37--53},
	Title = {{Structure-Based Primal Heuristics forMixed Integer Programming}},
	Year = {2016}}

@article{Boland2014-2,
	Abstract = {The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP feasible but fractional solutions, and integer but LP infeasible solutions. The process attempts to minimize the distance between consecutive iterates, producing an integer feasible solution when closing the distance between them. We investigate the benefits of enhancing the rounding procedure with a clever integer line search that efficiently explores a large set of integer points. An extensive computational study on benchmark instances demonstrates the efficacy of the proposed approach.},
	Author = {Boland, Natashia L. and Eberhard, Andrew C. and Engineer, Faramroze G. and Fischetti, Matteo and Savelsbergh, Martin W.P. and Tsoukalas, Angelos},
	Doi = {10.1007/s12532-014-0068-9},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Boland et al. - 2014 - Boosting the feasibility pump.pdf:pdf},
	Issn = {18672957},
	Journal = {Mathematical Programming Computation},
	Keywords = {65K05, 90C10, 90C11},
	Number = {3},
	Pages = {255--279},
	Title = {{Boosting the feasibility pump}},
	Volume = {6},
	Year = {2014},
	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-014-0068-9}}

@misc{Hill2009-2,
	Author = {Hill, H.},
	Booktitle = {{Phi Delta Kappan}},
	Doi = {10.1177/0964663912467814},
	Issn = {09646639},
	Pages = {470--476},
	Title = {{Fixing Teacher Professional Development}},
	Volume = {90},
	Year = {2009},
	Bdsk-Url-1 = {https://doi.org/10.1177/0964663912467814}}

@article{Andrade2017-2,
	Abstract = {We present a new framework for finding feasible solutions to mixed integer programs (MIP). We use the feasibility pump heuristic coupled to a biased random-key genetic algorithm (BRKGA). The feasibility pump heuristic attempts to find a feasible solution to a MIP by first rounding a solution to the linear programming (LP) relaxation to an integer (but not necessarily feasible) solution and then projecting it to a feasible solution to the LP relaxation. The BRKGA is able to build a pool of projected and rounded but not necessarily feasible solutions and to combine them using information from previous projections. This information is also used to fix variables during the process to speed up the solution of the LP relaxations, and to reduce the problem size in enumeration phases. Experimental results show that this approach is able to find feasible solutions for instances where the original feasibility pump or a commercial mixed integer programming solver often fail.},
	Author = {Andrade, Carlos E. and Ahmed, Shabbir and Nemhauser, George L. and Shao, Yufen},
	Doi = {10.1016/j.ejor.2017.05.003},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Andrade et al. - 2017 - A hybrid primal heuristic for finding feasible solutions to mixed integer programs.pdf:pdf},
	Issn = {03772217},
	Journal = {European Journal of Operational Research},
	Keywords = {Feasibility, Integer programming, Primal heuristics},
	Number = {1},
	Pages = {62--71},
	Publisher = {Elsevier B.V.},
	Title = {{A hybrid primal heuristic for finding feasible solutions to mixed integer programs}},
	Volume = {263},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.ejor.2017.05.003}}

@article{Berthold2017-2,
	Abstract = {The Feasibility Pump (fp) is probably the best known primal heuristic for mixed integer programming. The original work by Fischetti, Glover, and Lodi [24], which introduced the heuristic for 0-1 mixed-integer linear programs, has been succeeded by more than twenty follow-up publications which improve the performance of the fp and extend it to other problem classes. Year 2015 was the tenth anniversary of the first fp publication. The present paper provides an overview of the diverse Feasibility Pump literature that has been presented over the last decade.},
	Author = {Berthold, Timo and Lodi, Andrea and Salvagnin, Domenico},
	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Berthold, Lodi, Salvagnin - 2017 - Ten years of Feasibility Pump, and counting.pdf:pdf},
	Title = {{Ten years of Feasibility Pump, and counting}},
	Url = {http://www.dei.unipd.it/{~}salvagni/pdf/10yearsFP.pdf},
	Year = {2017},
	Bdsk-Url-1 = {http://www.dei.unipd.it/%7B~%7Dsalvagni/pdf/10yearsFP.pdf}}

@article{Lucena2006-2,
	Author = {Lucena, Abilio},
	Journal = {Handbook of Optimization in Telecommunications},
	Keywords = {cutting planes, knapsack problem, lagrangian relaxation, relax-and-cut},
	Number = {1994},
	Pages = {129--145},
	Title = {{Lagrangian Relax-and-Cut Algorithms}},
	Year = {2006}}

@article{Johnson2000-2,
	Author = {Johnson, E.L. and Nemhauser, G. and Savelsbergh, W.P.},
	Journal = {INFORMS Journal on Computing},
	Title = {{Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition}},
	Volume = {12},
	Year = {2000}}

@article{Fischetti2011a-2,
	Abstract = {Gomory mixed-integer cuts (GMICs) are widely used in modern branchand-cut codes for the solution of mixed-integer programs. Typically, GMICs are iteratively generated from the optimal basis of the current linear programming (LP) relaxation, and immediately added to the LP before the next round of cuts is generated. Unfortunately, this approach is prone to instability. In this paper we analyze a different scheme for the generation of rank-1 GMICs read from a basis of the original LP---the one before the addition of any cut.We adopt a relax-and-cut approach where the generated GMICs are not added to the current LP, but immediately relaxed in a Lagrangian fashion. Various elaborations of the basic idea are presented, that lead to very fast---yet accurate---variants of the basic scheme. Very encouraging computational results are presented, with a comparison with alternative techniques from the literature also aimed at improving the GMIC quality. We also show how our method can be integrated with other cut generators, and successfully used in a cut-and-branch enumerative framework.},
	Author = {Fischetti, Matteo and Salvagnin, Domenico},
	Doi = {10.1007/s12532-011-0024-x},
	Isbn = {3642135196},
	Issn = {18672949},
	Journal = {Mathematical Programming Computation},
	Keywords = {Gomory cuts, Lagrangian relaxation, Mixed-integer programming, Relax-and-cut},
	Number = {2},
	Pages = {79--102},
	Title = {{A relax-and-cut framework for gomory mixed-integer cuts}},
	Volume = {3},
	Year = {2011},
	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-011-0024-x}}

@book{Junger2010-2,
	Abstract = {Predicting the binding mode of flexible polypeptides to proteins is an important task that falls outside the domain of applicability of most small molecule and protein−protein docking tools. Here, we test the small molecule flexible ligand docking program Glide on a set of 19 non-$\alpha$-helical peptides and systematically improve pose prediction accuracy by enhancing Glide sampling for flexible polypeptides. In addition, scoring of the poses was improved by post-processing with physics-based implicit solvent MM- GBSA calculations. Using the best RMSD among the top 10 scoring poses as a metric, the success rate (RMSD \ensuremath{\leq} 2.0 {\AA} for the interface backbone atoms) increased from 21{\%} with default Glide SP settings to 58{\%} with the enhanced peptide sampling and scoring protocol in the case of redocking to the native protein structure. This approaches the accuracy of the recently developed Rosetta FlexPepDock method (63{\%} success for these 19 peptides) while being over 100 times faster. Cross-docking was performed for a subset of cases where an unbound receptor structure was available, and in that case, 40{\%} of peptides were docked successfully. We analyze the results and find that the optimized polypeptide protocol is most accurate for extended peptides of limited size and number of formal charges, defining a domain of applicability for this approach.},
	Annote = {From Duplicate 2 (50 Years of Integer Programming 1958--2008 - J{\"u}nger, Michael; Liebling, Thomas; Naddef, Denis; Nemhauser, George; Pulleyblank, William; Reinelt, Gerhard; Rinaldi, Giovanni; Wolsey, Laurence) NULL},
	Archiveprefix = {arXiv},
	Arxivid = {arXiv:1011.1669v3},
	Author = {Fallis, A.G},
	Booktitle = {{Journal of Chemical Information and Modeling}},
	Doi = {10.1017/CBO9781107415324.004},
	Editor = {J{\"u}nger, M. and Liebling, T. and Naddef, D. and Nemhauser, G. and Pulleyblank, W. and Reinelt, G. and Rinaldi, G. and Wolsey, L.},
	Eprint = {arXiv:1011.1669v3},
	Isbn = {9788578110796},
	Issn = {1098-6596},
	Keywords = {icle},
	Number = {9},
	Pages = {1689--1699},
	Pmid = {25246403},
	Publisher = {Springer},
	Title = {{50 Years of Integer Programming}},
	Volume = {53},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1017/CBO9781107415324.004}}

@book{Junger2010-3,
	Abstract = {The name integer programming refers to the class of constrained optimization prob- lems in which some or all of the variables are required to be integers. In the most widely studied and used integer programs, the objective function is linear and the constraints are linear inequalities. The field of integer programming has achieved great success in the academic and business worlds. Hundreds of papers are published every year in a variety of journals, several international conferences are held annu- ally and software for solving integer programs, both commercial and open source, is widely available and used by thousands of organizations. The application areas in- clude logistics and supply chains, telecommunications, finance, manufacturing and many others. This book is dedicated to the theoretical, algorithmic and computational aspects of integer programming. While it is not a textbook, it can be read as an introduction to the field and provides a historical perspective. Graduate students, academics and practitioners, even those who have spent most of their careers in discrete optimiza- tion, will all find something useful to learn from the material in this book. Given the amount that has been accomplished, it is remarkable that the field of integer programming began only fifty years ago. The 12th Combinatorial Optimization Workshop AUSSOIS 2008 took place in Aussois, France, 7--11 January 2008. The workshop, entitled Fifty Years of Inte- ger Programming, and this book, which resulted from the workshop, were created to celebrate the 50th anniversary of integer programming. The workshop had a to- tal of 136 participants from 14 countries ranging in experience from pioneers who founded the field to current graduate students. In addition to the formal program, the workshop provided many opportunities for informal discussions among participants as well as a chance to enjoy the spectacular Alpine setting provided by Aussois. The book is organized into four parts. The first day of the workshop honored some of the pioneers of the field. Ralph Gomory's path-breaking paper, showing how the simplex algorithm could be generalized to provide a finite algorithm for integer programming and published in 1958, provided the justification of the an- niversary celebration. The activities of the first day, led by George Nemhauser and Bill Pulleyblank, included a panel discussion with the pioneers who attended the viiviii Preface workshop (Egon Balas, Michel Balinski, Jack Edmonds, Arthur Geoffrion, Ralph Gomory and Richard Karp) as well as three invited talks by Bill Cook, G ́ erard Cornu ́ ejols and Laurence Wolsey on integer programming and combinatorial op- timization from the beginnings to the state-of-the-art. The whole day is captured in two Video DVDs which come with the book (Part IV). Parts I, II, and III contain 20 papers of historical and current interest. Part I of the book, entitled The Early Years, presents, in order of publication date, reprints of eleven fundamental papers published between 1954 and 1979. Ten of these papers were selected by one or more of the authors of the paper, who also wrote new introductions to the papers that explain their motivations for working on the problems addressed and their reason for selecting the paper for inclusion in this volume. The authors are Egon Balas, Michel Balinski, Alison Doig, Jack Edmonds, Arthur Geoffrion, Ralph Gomory, Alan Hoffman, Richard Karp, Joseph Kruskal, Harold Kuhn, and Ailsa Land. Each of these heavily cited papers has had a major influence on the development of the field and lasting value. The eleventh selection, which starts this section, is a groundbreaking paper by George Dantzig, Ray Fulkerson, and Selmer Johnson, with an introduction by Vaˇ sek Chv ́ atal and William Cook. The introduction to Part I closes with a list, in chronological order, of our selection of some of the most influential papers appearing between 1954 and 1973 pertaining to the many facets of integer programming. Part II contains papers based on the talks given by Cornu ́ ejols, Cook, and Wolsey. The paper Polyhedral Approaches to Mixed Integer Programming by Michele Con- forti, G ́ erard Cornu ́ ejols, and Giacomo Zambelli presents tools from polyhedral the- ory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory's mixed integer cuts. The study of combinatorial optimization problems such as the traveling salesman problem has had a significant influence on integer programming. Fifty-plus Years of Combinatorial Integer Programming by Bill Cook discusses these connections. In solving integer programming problems by branch-and-bound methods, it is impor- tant to use relaxations that provide tight bounds. In the third paper entitled Refor- mulation and Decomposition of Integer Programs, Franc ̧ ois Vanderbeck and Lau- rence Wolsey survey ways to reformulate integer and mixed integer programs to obtain stronger linear programming relaxations. Together, these three papers give a remarkably broad and comprehensive survey of developments in the last fifty-plus years and their impacts on state-of-the-art theory and methodology. Six survey talks on current hot topics in integer programming were given at the workshop by Fritz Eisenbrand, Andrea Lodi, Franc ̧ ois Margot, Franz Rendl, Jean- Philippe P. Richard, and Robert Weismantel. These talks covered topics that are actively being researched now and likely to have substantial influence in the coming decade and beyond. Part III contains the six papers that are based on these talks. Integer Programming and Algorithmic Geometry of Numbers by Fritz Eisenbrand surveys some of the most important results from the interplay of integer programming and the geome- try of numbers. Nonlinear Integer Programming by Raymond Hemmecke, Matthias K ̈ oppe, Jon Lee, and Robert Weismantel generalizes the usual integer programmingPreface ix model by studying integer programs with nonlinear objective functions. Mixed Inte- ger Programming Computation by Andrea Lodi discusses the important ingredients involved in building a successful mixed integer solver as well as the problems that need to be solved in building the next generation of faster and more stable solvers. Symmetry is a huge obstacle encountered in solving mixed integer programs ef- ficiently. In Symmetry in Integer Programming, Franc ̧ ois Margot presents several techniques that have been used successfully to overcome this difficulty. Semidefi- nite programming is a generalization of linear programming that provides a tighter relaxation to integer programs than linear programs. In Semidefinite Relaxations for Integer Programming, Franz Rendl surveys how semidefinite models and algorithms can be used effectively in solving certain combinatorial optimization problems. In the 1960s Ralph Gomory created a new tight relaxation for integer programs based on group theory. Recently the group theoretic model has been revived in the study of two-row integer programs. In The Group-Theoretic Approach in Mixed Integer Programming, Jean-Philippe P. Richard and Santanu S. Dey provide an overview of the mathematical foundations and recent theoretical and computational advances in the study of the group-theoretic approach. We close with the hope that the next fifty years will be as rich as the last fifty have been in theoretical and practical accomplishments in integer programming.},
	Annote = {From Duplicate 2 (50 Years of Integer Programming 1958--2008 - J{\"u}nger, Michael; Liebling, Thomas; Naddef, Denis; Nemhauser, George; Pulleyblank, William; Reinelt, Gerhard; Rinaldi, Giovanni; Wolsey, Laurence) NULL},
	Editor = {J{\"u}nger, M. and Liebling, T. and Naddef, D. and Nemhauser, G. and Pulleyblank, W. and Reinelt, G. and Rinaldi, G. and Wolsey, L.},
	Isbn = {9783540682745},
	Pages = {803},
	Publisher = {Springer},
	Title = {{50 Years of Integer Programming 1958--2008}},
	Year = {2010}}

@article{Burke2017,
	Author = {Burke, E. K. and Bykov, Y.},
	Journal = {European Journal of Operational Research},
	Localfile = {../../../../Documentos/optimization/metaheuristics/lahc/The late acceptance Hill-Climbing heuristic.pdf},
	Pages = {70--78},
	Title = {{The late acceptance Hill-Climbing heuristic}},
	Volume = {258},
	Year = {2017}}

@techreport{Reinelt95,
	Author = {Reinelt, G.},
	Institution = {Universit{\"a}t Heidelberg},
	Number = {D-69120},
	Title = {{TSPLIB 95}},
	Year = {1995}}

@article{Tange2011,
	Author = {Tange, O.},
	Journal = {The USENIX Magazine},
	Number = {1},
	Pages = {43--47},
	Title = {{{G}{N}{U} parallel-the command-line power tool}},
	Volume = {36},
	Year = {2011}}

@inbook{Cook2019,
	Author = {Cook, W.},
	Booktitle = {{Computing and Software Science: State of the Art and Perspectives}},
	Editor = {Steffen, B. and Woeginger, G.},
	Pages = {27--47},
	Publisher = {Springer International Publishing},
	Title = {{Computing in Combinatorial Optimization}},
	Year = {2019}}
