1%% This BibTeX bibliography file was created using BibDesk.
2%% https://bibdesk.sourceforge.io/
3
4%% Created for Túlio Toffolo at 2019-12-15 21:21:39 -0300
5
6
7%% Saved with string encoding Unicode (UTF-8)
8
9
10
11@article{Castellucci2017,
12	Author = {Pedro Belin Castellucci},
13	Date-Modified = {2019-12-15 21:01:15 -0300},
14	Doi = {10.4322/PODes.2017.005},
15	Issn = {1984-3534},
16	Issue = {2},
17	Pages = {48--61},
18	Title = {Julia e {JuMP}: Novas ferramentas para programa\c{c}\~{a}o matem\'{a}tica},
19	Volume = {9},
20	Year = {2017},
21	Bdsk-Url-1 = {https://doi.org/10.4322/PODes.2017.005}}
22
23@article{Alfandari2010,
24	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
25	Doi = {10.1016/j.endm.2010.05.061},
26	File = {::},
27	Issn = {15710653},
28	Journal = {Electronic Notes in Discrete Mathematics},
29	Keywords = {alarme processing, approximation, integer programming, maximal coverage, np-hardness, set covering},
30	Mendeley-Tags = {alarme processing},
31	Month = {aug},
32	Pages = {479--485},
33	Title = {{Approximation of the Clustered Set Covering Problem}},
34	Url = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624 http://www.sciencedirect.com/science/article/pii/S1571065310000624},
35	Volume = {36},
36	Year = {2010},
37	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624%20http://www.sciencedirect.com/science/article/pii/S1571065310000624},
38	Bdsk-Url-2 = {https://doi.org/10.1016/j.endm.2010.05.061}}
39
40@article{Monaci2006,
41	Author = {Monaci, Michele and Toth, Paolo},
42	Doi = {10.1287/ijoc.1040.0089},
43	File = {::},
44	Issn = {1091-9856},
45	Journal = {INFORMS Journal on Computing},
46	Keywords = {column genera-, heuristics, set-covering, tion, two-constraint bin packing, two-dimensional bin packing},
47	Month = {jan},
48	Number = {1},
49	Pages = {71--85},
50	Title = {{A set-covering-based heuristic approach for bin-packing problems}},
51	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1040.0089 http://joc.journal.informs.org/content/18/1/71.short},
52	Volume = {18},
53	Year = {2006},
54	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},
55	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1040.0089}}
56
57@article{Sapkota2011,
58	Author = {Sapkota, Nabin and Reilly, Charles H.},
59	Doi = {10.1016/j.cie.2011.02.008},
60	File = {::},
61	Issn = {03608352},
62	Journal = {Computers {\&} Industrial Engineering},
63	Keywords = {explicit correlation induction, karush, kuhn, set covering problem, tucker conditions},
64	Month = {aug},
65	Number = {1},
66	Pages = {39--47},
67	Publisher = {Elsevier Ltd},
68	Title = {{Simulating realistic set covering problems with known optimal solutions}},
69	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
70	Volume = {61},
71	Year = {2011},
72	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
73	Bdsk-Url-2 = {https://doi.org/10.1016/j.cie.2011.02.008}}
74
75@article{Beasley1987,
76	Author = {Beasley, J.E.},
77	Doi = {10.1016/0377-2217(87)90141-X},
78	File = {::},
79	Issn = {03772217},
80	Journal = {European Journal of Operational Research},
81	Keywords = {optimisation, set covering},
82	Month = {jul},
83	Number = {1},
84	Pages = {85--93},
85	Title = {{An algorithm for set covering problem}},
86	Url = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
87	Volume = {31},
88	Year = {1987},
89	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
90	Bdsk-Url-2 = {https://doi.org/10.1016/0377-2217(87)90141-X}}
91
92@book{Finger2002,
93	Author = {Finger, Markus and St{\"u}tzle, T and Louren{\c c}o, H},
94	File = {::},
95	Pages = {61--71},
96	Title = {{Exploiting fitness distance correlation of set covering problems}},
97	Url = {http://link.springer.com/chapter/10.1007/3-540-46004-7{\_}7},
98	Year = {2002},
99	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/3-540-46004-7%7B%5C_%7D7}}
100
101@article{Bilal2014,
102	Author = {Bilal, Nehme and Galinier, Philippe and Guibault, Francois},
103	Doi = {10.1007/s10732-013-9235-9},
104	File = {::},
105	Isbn = {1073201392},
106	Issn = {1381-1231},
107	Journal = {Journal of Heuristics},
108	Keywords = {hybrid heuristics, iterated local search, partial covering, profit maximization, set covering, tabu search},
109	Month = {jan},
110	Number = {2},
111	Pages = {143--164},
112	Title = {{An iterated-tabu-search heuristic for a variant of the partial set covering problem}},
113	Url = {http://link.springer.com/10.1007/s10732-013-9235-9 http://link.springer.com/article/10.1007/s10732-013-9235-9},
114	Volume = {20},
115	Year = {2014},
116	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-013-9235-9%20http://link.springer.com/article/10.1007/s10732-013-9235-9},
117	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-013-9235-9}}
118
119@article{Muter2010,
120	Author = {Muter, I. and Birbil, S. I. and Sahin, G.},
121	Doi = {10.1287/ijoc.1090.0376},
122	File = {::},
123	Issn = {1091-9856},
124	Journal = {INFORMS Journal on Computing},
125	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},
126	Month = {mar},
127	Number = {4},
128	Pages = {603--619},
129	Title = {{Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems}},
130	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
131	Volume = {22},
132	Year = {2010},
133	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
134	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1090.0376}}
135
136@article{Fritzen2012,
137	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},
138	Doi = {10.1016/j.epsr.2012.04.002},
139	File = {::},
140	Issn = {03787796},
141	Journal = {Electric Power Systems Research},
142	Month = {sep},
143	Pages = {55--66},
144	Publisher = {Elsevier B.V.},
145	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}},
146	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
147	Volume = {90},
148	Year = {2012},
149	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
150	Bdsk-Url-2 = {https://doi.org/10.1016/j.epsr.2012.04.002}}
151
152@article{Parragh2013,
153	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.},
154	Author = {Parragh, Sophie N and Schmid, Verena},
155	Doi = {10.1016/j.cor.2012.08.004},
156	File = {::},
157	Issn = {0305-0548},
158	Journal = {Computers {\&} operations research},
159	Keywords = {Column generation, Dial-a-ride problem, Hybrid algorithm, Variable neighborhood search, large neighborhood search},
160	Month = {jan},
161	Number = {1},
162	Pages = {490--497},
163	Pmid = {23471127},
164	Publisher = {Elsevier},
165	Title = {{Hybrid column generation and large neighborhood search for the dial-a-ride problem.}},
166	Url = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368{\&}tool=pmcentrez{\&}rendertype=abstract},
167	Volume = {40},
168	Year = {2013},
169	Bdsk-Url-1 = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368%7B%5C&%7Dtool=pmcentrez%7B%5C&%7Drendertype=abstract},
170	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2012.08.004}}
171
172@article{Caprara2000,
173	Author = {Caprara, Alberto and Toth, Paolo and Fischetti, M},
174	File = {::},
175	Journal = {Annals of Operations Research},
176	Pages = {353--371},
177	Title = {{Algorithms for the set covering problem}},
178	Url = {http://link.springer.com/article/10.1023/A:1019225027893},
179	Year = {2000},
180	Bdsk-Url-1 = {http://link.springer.com/article/10.1023/A:1019225027893}}
181
182@article{Fleszar2011,
183	Author = {Fleszar, Krzysztof and Charalambous, Christoforos and Hindi, Khalil S.},
184	Doi = {10.1007/s10845-011-0522-8},
185	File = {::},
186	Issn = {0956-5515},
187	Journal = {Journal of Intelligent Manufacturing},
188	Keywords = {hybrid optimization, makespan minimization, mip neighborhood, mixed-integer programming, neighborhood search, parallel machine, parallel machine scheduling},
189	Mendeley-Tags = {mip neighborhood,parallel machine},
190	Month = {mar},
191	Number = {5},
192	Pages = {1949--1958},
193	Title = {{A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times}},
194	Url = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
195	Volume = {23},
196	Year = {2011},
197	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
198	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-011-0522-8}}
199
200@article{Smith-Miles2012,
201	Author = {Smith-Miles, Kate and Lopes, Leo},
202	Doi = {10.1016/j.cor.2011.07.006},
203	File = {::},
204	Issn = {03050548},
205	Journal = {Computers {\&} Operations Research},
206	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},
207	Mendeley-Tags = {testing},
208	Month = {may},
209	Number = {5},
210	Pages = {875--889},
211	Publisher = {Elsevier},
212	Title = {{Measuring instance difficulty for combinatorial optimization problems}},
213	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
214	Volume = {39},
215	Year = {2012},
216	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
217	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2011.07.006}}
218
219@article{Pereira2011,
220	Author = {Pereira, Jordi and Averbakh, Igor},
221	Doi = {10.1007/s10479-011-0876-5},
222	File = {::},
223	Issn = {0254-5330},
224	Journal = {Annals of Operations Research},
225	Keywords = {benders decomposition, branch-and-cut, combinatorial optimization, genetic algorithms, heuristics, minmax regret, optimization, set covering problem},
226	Month = {mar},
227	Number = {1},
228	Pages = {217--235},
229	Title = {{The robust set covering problem with interval data}},
230	Url = {http://link.springer.com/10.1007/s10479-011-0876-5 http://link.springer.com/article/10.1007/s10479-011-0876-5},
231	Volume = {207},
232	Year = {2011},
233	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10479-011-0876-5%20http://link.springer.com/article/10.1007/s10479-011-0876-5},
234	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-011-0876-5}}
235
236@article{Kodali2013,
237	Author = {Kodali, Anuradha and Singh, Satnam and Pattipati, Krishna},
238	Doi = {10.1109/TSMCA.2012.2208101},
239	File = {::},
240	Issn = {2168-2216},
241	Journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
242	Month = {may},
243	Number = {3},
244	Pages = {547--562},
245	Title = {{Dynamic Set-Covering for Real-Time Multiple Fault Diagnosis With Delayed Test Outcomes}},
246	Url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
247	Volume = {43},
248	Year = {2013},
249	Bdsk-Url-1 = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
250	Bdsk-Url-2 = {https://doi.org/10.1109/TSMCA.2012.2208101}}
251
252@article{Gutin2000,
253	Author = {Gutin, G and Zverovich, A},
254	File = {::},
255	Journal = {submitted for publication},
256	Title = {{Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP}},
257	Url = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf},
258	Year = {2000},
259	Bdsk-Url-1 = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf}}
260
261@article{Santos2013,
262	Author = {Santos, Dorabella and de Sousa, Amaro and Alvelos, Filipe},
263	Doi = {10.1016/j.cor.2013.05.006},
264	File = {::},
265	Issn = {03050548},
266	Journal = {Computers {\&} Operations Research},
267	Keywords = {Column generation, Hybrid meta-heuristics, Network load balancing, grasp with path relinking},
268	Month = {may},
269	Pages = {1--12},
270	Publisher = {Elsevier},
271	Title = {{A hybrid column generation with GRASP and path relinking for the network load balancing problem}},
272	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
273	Year = {2013},
274	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
275	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2013.05.006}}
276
277@article{Boschetti2007,
278	Author = {Boschetti, Marco and Maniezzo, Vittorio},
279	Doi = {10.1007/s10732-007-9064-9},
280	File = {::},
281	Issn = {1381-1231},
282	Journal = {Journal of Heuristics},
283	Keywords = {benders, combinatorial optimization, decomposition, lagrangean relaxation, metaheuristic, s},
284	Month = {oct},
285	Number = {3},
286	Pages = {283--312},
287	Title = {{Benders decomposition, Lagrangean relaxation and metaheuristic design}},
288	Url = {http://link.springer.com/10.1007/s10732-007-9064-9},
289	Volume = {15},
290	Year = {2007},
291	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-007-9064-9},
292	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-007-9064-9}}
293
294@article{Alfandari2014,
295	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
296	Doi = {10.1016/j.dam.2011.11.030},
297	File = {::},
298	Issn = {0166218X},
299	Journal = {Discrete Applied Mathematics},
300	Month = {feb},
301	Pages = {13--19},
302	Title = {{A note on the Clustered Set Covering Problem}},
303	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
304	Volume = {164},
305	Year = {2014},
306	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
307	Bdsk-Url-2 = {https://doi.org/10.1016/j.dam.2011.11.030}}
308
309@article{Vallada2011a,
310	Author = {Vallada, Eva and Ruiz, Rub{\'e}n},
311	Doi = {10.1016/j.ejor.2011.01.011},
312	File = {::},
313	Issn = {03772217},
314	Journal = {European Journal of Operational Research},
315	Month = {jun},
316	Number = {3},
317	Pages = {612--622},
318	Publisher = {Elsevier B.V.},
319	Title = {{A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times}},
320	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
321	Volume = {211},
322	Year = {2011},
323	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
324	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2011.01.011}}
325
326@article{Yelbay2012,
327	Author = {Yelbay, Belma and Birbil, {\c S}{\.I} and B{\"u}lb{\"u}l, K},
328	File = {::},
329	Journal = {{\ldots} Operational Research},
330	Keywords = {dual information, heuristics, lp relaxation, primal-dual heuristic, set covering},
331	Title = {{The set covering problem revisited: an empirical study of the value of dual information}},
332	Url = {http://research.sabanciuniv.edu/19359/},
333	Year = {2012},
334	Bdsk-Url-1 = {http://research.sabanciuniv.edu/19359/}}
335
336@article{Lan2007,
337	Author = {Lan, Guanghui and DePuy, Gail W. and Whitehouse, Gary E.},
338	Doi = {10.1016/j.ejor.2005.09.028},
339	File = {::},
340	Issn = {03772217},
341	Journal = {European Journal of Operational Research},
342	Keywords = {combinatorial optimization, meta-raps, set covering},
343	Month = {feb},
344	Number = {3},
345	Pages = {1387--1403},
346	Title = {{An effective and simple heuristic for the set covering problem}},
347	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
348	Volume = {176},
349	Year = {2007},
350	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
351	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2005.09.028}}
352
353@article{Arnaout2009,
354	Author = {Arnaout, Jean-Paul and Rabadi, Ghaith and Musa, Rami},
355	Doi = {10.1007/s10845-009-0246-1},
356	File = {::},
357	Issn = {0956-5515},
358	Journal = {Journal of Intelligent Manufacturing},
359	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},
360	Month = {feb},
361	Number = {6},
362	Pages = {693--701},
363	Title = {{A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times}},
364	Url = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
365	Volume = {21},
366	Year = {2009},
367	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
368	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-009-0246-1}}
369
370@article{Glover2001,
371	Author = {Glover, Fred and Gutin, Gregory and Yeo, Anders and Zverovich, Alexey},
372	Doi = {10.1016/S0377-2217(99)00468-3},
373	File = {::},
374	Issn = {03772217},
375	Journal = {European Journal of Operational Research},
376	Keywords = {construction heuristics, heuristics, traveling salesman},
377	Month = {mar},
378	Number = {3},
379	Pages = {555--568},
380	Title = {{Construction heuristics for the asymmetric TSP}},
381	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
382	Volume = {129},
383	Year = {2001},
384	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
385	Bdsk-Url-2 = {https://doi.org/10.1016/S0377-2217(99)00468-3}}
386
387@article{Jonker1987,
388	Author = {Jonker, R and Volgenant, A},
389	File = {::},
390	Journal = {Computing},
391	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},
392	Pages = {325--340},
393	Title = {{A shortest augmenting path algorithm for dense and sparse linear assignment problems}},
394	Url = {http://www.springerlink.com/index/7003M6N54004M004.pdf},
395	Volume = {340},
396	Year = {1987},
397	Bdsk-Url-1 = {http://www.springerlink.com/index/7003M6N54004M004.pdf}}
398
399@article{Frangioni2005,
400	Author = {Frangioni, Antonio},
401	File = {::},
402	Journal = {Annals of Operations Research},
403	Keywords = {integer linear programs, lagrangian dual},
404	Pages = {163--193},
405	Title = {{About Lagrangian methods in integer optimization}},
406	Url = {http://link.springer.com/article/10.1007/s10479-005-3447-9},
407	Year = {2005},
408	Bdsk-Url-1 = {http://link.springer.com/article/10.1007/s10479-005-3447-9}}
409
410@article{Yagiura2006,
411	Author = {Yagiura, Mutsunori and Kishida, Masahiro and Ibaraki, Toshihide},
412	Doi = {10.1016/j.ejor.2004.10.018},
413	File = {::},
414	Issn = {03772217},
415	Journal = {European Journal of Operational Research},
416	Keywords = {lagrangian relaxation, large neighborhood, metaheuristics, set covering problem, strategic oscillation},
417	Month = {jul},
418	Number = {2},
419	Pages = {472--499},
420	Title = {{A 3-flip neighborhood local search for the set covering problem}},
421	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
422	Volume = {172},
423	Year = {2006},
424	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
425	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2004.10.018}}
426
427@article{Alvelos2013,
428	Author = {Alvelos, Filipe and Sousa, Amaro De and Santos, Dorabella},
429	File = {::},
430	Journal = {Hybrid Metaheuristics},
431	Pages = {1--50},
432	Title = {{Combining column generation and metaheuristics}},
433	Url = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6{\_}11},
434	Year = {2013},
435	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6%7B%5C_%7D11}}
436
437@article{Letchford2002,
438	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.},
439	Author = {Letchford, Adam N. and Lodi, Andrea},
440	Doi = {10.1016/S0167-6377(02)00112-8},
441	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},
442	Issn = {01676377},
443	Journal = {Operations Research Letters},
444	Keywords = {Cutting planes, Integer programming, Valid inequalities},
445	Number = {2},
446	Pages = {74--82},
447	Title = {{Strengthening Chv{\'a}tal-Gomory cuts and Gomory fractional cuts}},
448	Volume = {30},
449	Year = {2002},
450	Bdsk-Url-1 = {https://doi.org/10.1016/S0167-6377(02)00112-8}}
451
452@article{J??nger2010,
453	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},
454	Archiveprefix = {arXiv},
455	Arxivid = {arXiv:1011.1669v3},
456	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.},
457	Doi = {10.1007/978-3-540-68279-0},
458	Eprint = {arXiv:1011.1669v3},
459	File = {::},
460	Isbn = {9783540682745},
461	Issn = {0894069X},
462	Journal = {50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art},
463	Pages = {1--804},
464	Pmid = {15890271},
465	Title = {{Outline of an Algorithm for Integer Solutions to Linear Programs}},
466	Year = {2010},
467	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-540-68279-0}}
468
469@article{Andreello2007,
470	Author = {Andreello, G. and Caprara, A. and Fischetti, M.},
471	Doi = {10.1287/ijoc.1050.0162},
472	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},
473	Issn = {1091-9856},
474	Journal = {INFORMS Journal on Computing},
475	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},
476	Month = {jan},
477	Number = {2},
478	Pages = {229--238},
479	Title = {{Embedding {\{}0,1/2{\}}-Cuts in a Branch-and-Cut Framework: A Computational Study}},
480	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
481	Volume = {19},
482	Year = {2007},
483	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
484	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1050.0162}}
485
486@article{Fischetti2007a,
487	Author = {Fischetti, Matteo and Lodi, Andrea},
488	Doi = {10.1007/s00373-007-0711-6},
489	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - MIPping closures An instant survey.pdf:pdf},
490	Issn = {09110119},
491	Journal = {Graphs and Combinatorics},
492	Keywords = {Cutting plane methods, Mixed integer programs, Separation problems},
493	Number = {SUPPL. 1},
494	Pages = {233--243},
495	Title = {{MIPping closures: An instant survey}},
496	Volume = {23},
497	Year = {2007},
498	Bdsk-Url-1 = {https://doi.org/10.1007/s00373-007-0711-6}}
499
500@article{Fischetti2007,
501	Author = {Fischetti, M. and Lodi, A.},
502	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - Optimizing over the first Chv{\`{a}}tal closure.pdf:pdf},
503	Journal = {Mathematical Programming B},
504	Number = {1},
505	Pages = {3--20},
506	Title = {{Optimizing over the first Chv{\`a}tal closure}},
507	Volume = {110},
508	Year = {2007}}
509
510@article{Camerini2006,
511	Author = {Camerini, P. M. and Fratta, L. and Maffioli, F.},
512	Journal = {Networks},
513	Month = {oct},
514	Number = {4},
515	Pages = {309--312},
516	Title = {{A note on finding optimum branchings}},
517	Volume = {9},
518	Year = {2006}}
519
520@inproceedings{Bresina1996,
521	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 ) },
522	Author = {Bresina, J.L. L and Bresina, L},
523	Booktitle = {{AAAI-96 Proceedings}},
524	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bresina - 1996 - Heuristic-Biased Stochastic Sampling.pdf:pdf},
525	Pages = {271--278},
526	Title = {{Heuristic-Biased Stochastic Sampling}},
527	Year = {1996}}
528
529@incollection{Goltz1998,
530	Author = {Goltz, HJ. and Matzke, D.},
531	Publisher = {Springer Berlin},
532	Title = {{University Timetabling Using Constraint Logic Programming}},
533	Year = {1998}}
534
535@article{pythonEconomist2018,
536	Author = {{{The Economist}}},
537	Date-Modified = {2019-12-15 21:21:39 -0300},
538	Journal = {The Economist Group Limited, London 1969},
539	Title = {{Python is becoming the world's most popular coding language}},
540	Year = {2018},
541	Volume = {Daily chart of 26/07/2018},
542	Bdsk-Url-1 = {https://www.economist.com/graphic-detail/2018/07/26/python-is-becoming-the-worlds-most-popular-coding-language}}
543
544@article{Kececioglu2000,
545	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.},
546	Author = {Kececioglu, John D. and Lenhof, Hans-Peter and Mehlhorn, Kurt and Mutzel, Petra and Reinert, Knut and Vingron, Martin},
547	Doi = {10.1016/S0166-218X(00)00194-3},
548	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kececioglu et al. - 2000 - A polyhedral approach to sequence alignment problems.pdf:pdf},
549	Issn = {0166218X},
550	Journal = {Discrete Applied Mathematics},
551	Keywords = {Branch-and-cut, Combinatorial optimization, Computational biology, Multiple sequence alignment, RNA sequence alignment},
552	Number = {1-3},
553	Pages = {143--186},
554	Title = {{A polyhedral approach to sequence alignment problems}},
555	Url = {http://www.sciencedirect.com/science/article/pii/S0166218X00001943},
556	Volume = {104},
557	Year = {2000},
558	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0166218X00001943},
559	Bdsk-Url-2 = {https://doi.org/10.1016/S0166-218X(00)00194-3}}
560
561@article{Blum2016,
562	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.},
563	Author = {Blum, Christian and Pinacho, Pedro and L{\'o}pez-Ib{\'a}{\~n}ez, Manuel and Lozano, Jos{\'e} A.},
564	Doi = {10.1016/j.cor.2015.10.014},
565	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},
566	Issn = {03050548},
567	Journal = {Computers and Operations Research},
568	Keywords = {Exact solver, Hybrid algorithms, Metaheuristics, Minimum common string partition, Minimum covering arborescence},
569	Pages = {75--88},
570	Publisher = {Elsevier},
571	Title = {{Construct, Merge, Solve {\&} Adapt A new general algorithm for combinatorial optimization}},
572	Url = {http://dx.doi.org/10.1016/j.cor.2015.10.014},
573	Volume = {68},
574	Year = {2016},
575	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.cor.2015.10.014}}
576
577@article{Bertsimas2004,
578	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.},
579	Author = {Bertsimas, D. and Sim, M.},
580	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bertsimas, Sim - 2004 - The Price of Robustness.pdf:pdf},
581	Isbn = {0030-364X},
582	Issn = {0030-364X},
583	Journal = {Operations Research},
584	Number = {1},
585	Pages = {35--53},
586	Title = {{The Price of Robustness}},
587	Volume = {52},
588	Year = {2004}}
589
590@article{Dantzig1960,
591	Author = {Dantzig, G. B. and Wolfe, P.},
592	Journal = {Operations Research},
593	Number = {1},
594	Pages = {101--111},
595	Title = {{Decomposition Principle for Linear Programs}},
596	Volume = {8},
597	Year = {1960}}
598
599@article{Mendez-Diaz2008,
600	Author = {M{\'e}ndez-D{\'\i}az, I. and Zabala, P.},
601	Journal = {Discrete Applied Mathematics},
602	Pages = {159--179},
603	Title = {{A cutting plane algorithm for graph coloring}},
604	Volume = {156},
605	Year = {2008}}
606
607@phdthesis{Souza2000a,
608	Address = {Rio de Janeiro, Brasil},
609	Author = {Souza, M.J.F.},
610	Title = {{School Timetabling: An Approximation by Metaheuristics (in portuguese)}},
611	Year = {2000}}
612
613@inproceedings{Hansen1986,
614	Address = {Capri, Italy},
615	Author = {Hansen, P.},
616	Title = {{The steepest ascent mildest descent heuristic for combinatorial programming}},
617	Year = {1986}}
618
619@article{Glover2000,
620	Author = {Glover, F. and Laguna, M. and Mart{\'\i}, R.},
621	Journal = {Control and Cybernetics},
622	Number = {3},
623	Pages = {653--684},
624	Title = {{Fundamentals of Scatter Search and Path Relinking}},
625	Volume = {39},
626	Year = {2000}}
627
628@misc{Kendal2013,
629	Author = {Kendal, Graham and McCollum, Barry and Berghe, Greet Vanden},
630	Title = {{MISTA 2013 Challenge: Qualification results}},
631	Url = {http://allserv.kahosl.be/mista2013challenge/results.html},
632	Year = {2013},
633	Bdsk-Url-1 = {http://allserv.kahosl.be/mista2013challenge/results.html}}
634
635@incollection{Papatheocharous2009,
636	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.},
637	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},
638	Author = {Haddad, Matheus N. and Cota, Luciano P. and Souza, Marcone J.F. F and Maculan, Nelson},
639	Booktitle = {{Lecture Notes in Business Information Processing}},
640	Doi = {10.1007/978-3-642-00670-8},
641	Editor = {Cordeiro, Jos{\'e} and Hammoudi, Slimane and Maciaszek, Leszek and Camp, Olivier and Filipe, Joaquim},
642	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},
643	Isbn = {978-3-642-00669-2},
644	Issn = {18651348},
645	Keywords = {Artificial neural networks, Genetic algorithms, Software cost estimation},
646	Pages = {131--148},
647	Publisher = {Springer},
648	Title = {{Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search}},
649	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},
650	Volume = {227},
651	Year = {2015},
652	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-00670-8}}
653
654@article{Neumann2017,
655	Author = {Neumann, Christoph and Stein, Oliver and Nathan, Sudermann-Merx},
656	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},
657	Keywords = {2000, 2017, 90c10, 90c11, consistency, granularity, inner parallel set, mathematics subject classification, preliminary citation optimization online, preprint id 2017-12-6367, rounding},
658	Title = {{A feasible rounding approach for mixed-integer optimization problems}},
659	Year = {2017}}
660
661@article{Polat2007,
662	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.},
663	Author = {Polat, Kemal and G{\"u}ne{\c s}, Salih},
664	Doi = {10.1016/j.amc.2006.09.022},
665	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},
666	Isbn = {0096-3003},
667	Issn = {00963003},
668	Journal = {Applied Mathematics and Computation},
669	Keywords = {Decision tree classifier, Electroencephalogram (EEG), Epileptic seizure, FFT, k-Fold cross-validation},
670	Number = {2},
671	Pages = {1017--1026},
672	Title = {{Classification of epileptiform EEG using a hybrid system based on decision tree classifier and fast Fourier transform}},
673	Volume = {187},
674	Year = {2007},
675	Bdsk-Url-1 = {https://doi.org/10.1016/j.amc.2006.09.022}}
676
677@article{Yelbay2012-2,
678	Author = {Yelbay, Belma and Birbil, {\c S} {\.I} and B{\"u}lb{\"u}l, K},
679	Journal = {{\ldots}Operational Research},
680	Keywords = {dual information, heuristics, lp relaxation, primal-dual heuristic, set covering},
681	Title = {{The set covering problem revisited: an empirical study of the value of dual information}},
682	Url = {http://research.sabanciuniv.edu/19359/},
683	Year = {2012},
684	Bdsk-Url-1 = {http://research.sabanciuniv.edu/19359/}}
685
686@article{Palubeckis2008,
687	Author = {Palubeckis, G.},
688	Journal = {Information technology and control},
689	Number = {1},
690	Title = {{On the graph coloring polytope}},
691	Volume = {37},
692	Year = {2008}}
693
694@article{Alvelos2013-2,
695	Author = {Alvelos, Filipe and Sousa, Amaro De and Santos, Dorabella},
696	Journal = {Hybrid Metaheuristics},
697	Pages = {1--50},
698	Title = {{Combining column generation and metaheuristics}},
699	Url = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6{\_}11},
700	Year = {2013},
701	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/978-3-642-30671-6%7B%5C_%7D11}}
702
703@article{Mendez-Diaz2016,
704	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.},
705	Author = {M{\'e}ndez-D{\'\i}az, Isabel and Zabala, Paula and Miranda-Bront, Juan Jos{\'e}},
706	Doi = {10.1016/j.cor.2016.06.018},
707	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},
708	Issn = {03050548},
709	Journal = {Computers and Operations Research},
710	Keywords = {Integer programming, Matheuristic, University timetabling},
711	Pages = {195--207},
712	Publisher = {Elsevier},
713	Title = {{An ILP based heuristic for a generalization of the post-enrollment course timetabling problem}},
714	Url = {http://dx.doi.org/10.1016/j.cor.2016.06.018},
715	Volume = {76},
716	Year = {2016},
717	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.cor.2016.06.018}}
718
719@article{Liaw2002,
720	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.},
721	Archiveprefix = {arXiv},
722	Arxivid = {1609-3631},
723	Author = {Liaw, A and Wiener, M},
724	Doi = {10.1177/154405910408300516},
725	Eprint = {1609-3631},
726	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Liaw, Wiener - 2002 - Classification and Regression by randomForest.pdf:pdf},
727	Isbn = {1609-3631},
728	Issn = {16093631},
729	Journal = {R news},
730	Number = {December},
731	Pages = {18--22},
732	Pmid = {21196786},
733	Title = {{Classification and Regression by randomForest}},
734	Volume = {2},
735	Year = {2002},
736	Bdsk-Url-1 = {https://doi.org/10.1177/154405910408300516}}
737
738@article{Johnson2008,
739	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]},
740	Author = {Johnson, Ellis L. and Kostreva, Michael M. and Suhl, Uwe H.},
741	Doi = {10.1287/opre.33.4.803},
742	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},
743	Issn = {0030-364X},
744	Journal = {Operations Research},
745	Number = {4},
746	Pages = {803--819},
747	Title = {{Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models}},
748	Volume = {33},
749	Year = {2008},
750	Bdsk-Url-1 = {https://doi.org/10.1287/opre.33.4.803}}
751
752@book{Michalewicz2004,
753	Author = {Michalewicz, Z. and Fogel, D.B.},
754	Edition = {2},
755	Publisher = {Springer},
756	Title = {{How to Solve It: Modern Heuristics}},
757	Year = {2004}}
758
759@phdthesis{Eso1999,
760	Address = {NY, USA},
761	Annote = {From Duplicate 1 (Parallel branch-and-cut for set partitioning - Eso, M) NULL},
762	Author = {Eso, M.},
763	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Eso - 1999 - Parallel branch-and-cut for set partitioning.pdf:pdf},
764	Title = {{Parallel branch-and-cut for set partitioning}},
765	Year = {1999}}
766
767@incollection{Cung2002,
768	Author = {Cung, V.D. and Martins, S.L. and Ribeiro, C.C. and Roucairol, C.},
769	Editor = {Ribeiro, C.C. and Hansen, P.},
770	Pages = {263--308},
771	Publisher = {Kluwer Academic Publishers},
772	Title = {{Strategies for the parallel implementation of metaheuristics}},
773	Year = {2002}}
774
775@phdthesis{Santos2007,
776	Author = {Santos, H. G.},
777	Title = {{Formula$\backslash$cces e Algoritmos para o Problema de Programa$\backslash$cc{\~a}o de Hor{\'a}rios em Escolas}},
778	Year = {2007}}
779
780@article{Fonseca2016a,
781	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.},
782	Author = {Fonseca, G.H.G. and Santos, H.G. and Carrano, E.G.},
783	Doi = {10.1007/s10951-015-0458-5},
784	Issn = {10946136},
785	Journal = {Journal of Scheduling},
786	Keywords = {High School Timetabling, Late Acceptance Hill-Climbing, Local search, Third International Timetabling Competition},
787	Number = {4},
788	Pages = {453--465},
789	Title = {{Late acceptance hill-climbing for high school timetabling}},
790	Volume = {19},
791	Year = {2016},
792	Bdsk-Url-1 = {https://doi.org/10.1007/s10951-015-0458-5}}
793
794@article{Fischetti2003,
795	Author = {Fischetti, M. and Lodi, A.},
796	Journal = {Mathematical Programming},
797	Pages = {23--47},
798	Title = {{Local Branching}},
799	Volume = {98},
800	Year = {2003}}
801
802@article{Kodali2013-2,
803	Author = {Kodali, Anuradha and Singh, Satnam and Pattipati, Krishna},
804	Doi = {10.1109/TSMCA.2012.2208101},
805	Issn = {2168-2216},
806	Journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
807	Number = {3},
808	Pages = {547--562},
809	Title = {{Dynamic Set-Covering for Real-Time Multiple Fault Diagnosis With Delayed Test Outcomes}},
810	Url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
811	Volume = {43},
812	Year = {2013},
813	Bdsk-Url-1 = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6301764},
814	Bdsk-Url-2 = {https://doi.org/10.1109/TSMCA.2012.2208101}}
815
816@inproceedings{Post2008,
817	Author = {Post, Gerhard and Ahmadi, Samad and Daskalaki, Sophia and Kyngas, Jari and Nurmi, Cimmo and Ranson, David and Ruizenaar, Henri},
818	Booktitle = {{PATAT'08 Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling}},
819	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},
820	Title = {{An XML format for Benchmarks in High School Timetabling}},
821	Volume = {03018},
822	Year = {2008}}
823
824@phdthesis{Gomes1982,
825	Author = {Gomes, C. M. N.},
826	School = {Instituto Militar de Engenharia},
827	Title = {{An{\'a}lise do desempenho operacional de p{\'a}tios ferrovi{\'a}rios}},
828	Type = {Disserta{\c c}{\~a}o de Mestrado},
829	Year = {1982}}
830
831@article{Gunluk2016,
832	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.},
833	Archiveprefix = {arXiv},
834	Arxivid = {1612.03225},
835	Author = {Gunluk, Oktay and Kalagnanam, Jayant and Menickelly, Matt and Scheinberg, Katya},
836	Eprint = {1612.03225},
837	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gunluk et al. - 2016 - Optimal Generalized Decision Trees via Integer Programming.pdf:pdf},
838	Keywords = {decision trees, integer programming, machine learning},
839	Title = {{Optimal Generalized Decision Trees via Integer Programming}},
840	Url = {http://arxiv.org/abs/1612.03225},
841	Year = {2016},
842	Bdsk-Url-1 = {http://arxiv.org/abs/1612.03225}}
843
844@article{Leus2011,
845	Author = {Leus, R.},
846	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Leus - 2011 - Resource Allocation by Means of Project Networks Dominance Results.pdf:pdf},
847	Journal = {Networks},
848	Pages = {50--58},
849	Title = {{Resource Allocation by Means of Project Networks: Dominance Results}},
850	Volume = {28},
851	Year = {2011}}
852
853@article{Macedo2010,
854	Author = {Macedo, Rita and Alves, Cl{\'a}udio and {Val{\'e}rio de Carvalho}, J.M. M},
855	Doi = {10.1016/j.cor.2009.08.005},
856	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},
857	Issn = {03050548},
858	Journal = {Computers {\&} Operations Research},
859	Keywords = {Combinatorial optimization, Furniture industry, Guillotine constraints, Integer programming, Two-dimensional cutting stock problem},
860	Month = {jun},
861	Number = {6},
862	Pages = {991--1001},
863	Publisher = {Elsevier},
864	Title = {{Arc-flow model for the two-dimensional guillotine cutting stock problem}},
865	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002007},
866	Volume = {37},
867	Year = {2010},
868	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002007},
869	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2009.08.005}}
870
871@article{Savelsbergh1994,
872	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},
873	Author = {Savelsbergh, M. W. P.},
874	Doi = {10.1287/ijoc.6.4.445},
875	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Savelsbergh - 1994 - Preprocessing and Probing Techniques for Mixed Integer Programming Problems.pdf:pdf},
876	Issn = {1091-9856},
877	Journal = {INFORMS Journal on Computing},
878	Number = {4},
879	Pages = {445--454},
880	Title = {{Preprocessing and Probing Techniques for Mixed Integer Programming Problems}},
881	Volume = {6},
882	Year = {1994},
883	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.6.4.445}}
884
885@article{Sugumaran2007,
886	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.},
887	Author = {Sugumaran, V. and Muralidharan, V. and Ramachandran, K. I.},
888	Doi = {10.1016/j.ymssp.2006.05.004},
889	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},
890	Issn = {08883270},
891	Journal = {Mechanical Systems and Signal Processing},
892	Keywords = {Decision Tree, Fault detection, Feature selection, PSVM, Roller bearing, Statistical features},
893	Number = {2},
894	Pages = {930--942},
895	Title = {{Feature selection using Decision Tree and classification through Proximal Support Vector Machine for fault diagnostics of roller bearing}},
896	Volume = {21},
897	Year = {2007},
898	Bdsk-Url-1 = {https://doi.org/10.1016/j.ymssp.2006.05.004}}
899
900@misc{MISTAorganizers2013,
901	Author = {Organizers, MISTA and organizers, MISTA},
902	Title = {{MISTA - Multidisciplinary International Scheduling Conference}},
903	Url = {http://www.schedulingconference.org/},
904	Year = {2013},
905	Bdsk-Url-1 = {http://www.schedulingconference.org/}}
906
907@phdthesis{Mata1989,
908	Address = {Rio de Janeiro, Brasil},
909	Author = {Mata, S.S.},
910	Title = {{O Problema do Hor{\'a}rio na Escola do Segundo Grau: Modelagem e Implementa$\backslash$cc{\~a}o}},
911	Year = {1989}}
912
913@incollection{Letchfort2016,
914	Author = {Letchford, A.N. and Marzi, F. and Rossi, F. and Smriglio, S.},
915	Booktitle = {{International Symposium on Combinatorial Optimization}},
916	Doi = {10.1201/b16812},
917	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},
918	Isbn = {9781439898536},
919	Keywords = {chv, clique inequalities, cuts, cutting plane algorithm, stable set problem},
920	Pages = {201--212},
921	Title = {{Strengthening Chv{\'a}tal-Gomory cuts for the stable set problem}},
922	Year = {2016},
923	Bdsk-Url-1 = {https://doi.org/10.1201/b16812}}
924
925@article{Batini1984,
926	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.},
927	Author = {Batini, C. and Talamo, M. and Tamassia, R.},
928	Doi = {10.1016/0164-1212(84)90006-2},
929	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Batini, Talamo, Tamassia - 1984 - Computer aided layout of entity relationship diagrams.pdf:pdf},
930	Issn = {01641212},
931	Journal = {The Journal of Systems and Software},
932	Number = {2-3},
933	Pages = {163--173},
934	Title = {{Computer aided layout of entity relationship diagrams}},
935	Volume = {4},
936	Year = {1984},
937	Bdsk-Url-1 = {https://doi.org/10.1016/0164-1212(84)90006-2}}
938
939@article{Vallada2011,
940	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},
941	Author = {Vallada, Eva and Ruiz, Rub{\'e}n},
942	Doi = {10.1016/j.ejor.2011.01.011},
943	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},
944	Issn = {03772217},
945	Journal = {European Journal of Operational Research},
946	Month = {jun},
947	Number = {3},
948	Pages = {612--622},
949	Publisher = {Elsevier B.V.},
950	Title = {{A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times}},
951	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
952	Volume = {211},
953	Year = {2011},
954	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711000142},
955	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2011.01.011}}
956
957@book{Breiman1984,
958	Author = {Breiman, L. and Friedman, Jerome and Stone, Charles J. and Olshen, R.A.},
959	Booktitle = {{Taylor {\&} Francis}},
960	Doi = {10.1007/s00038-011-0315-z},
961	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Breiman et al. - 1984 - Classification and regression trees Regression trees.pdf:pdf},
962	Isbn = {9781351460491},
963	Issn = {1661-8564},
964	Keywords = {Discriminant analysis., Regression analysis., Statistics., Trees (Graph theory)},
965	Pmid = {22015650},
966	Title = {{Classification and regression trees Regression trees}},
967	Year = {1984},
968	Bdsk-Url-1 = {https://doi.org/10.1007/s00038-011-0315-z}}
969
970@article{Lucena2006,
971	Author = {Lucena, Abilio},
972	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lucena - 2006 - Lagrangian Relax-and-Cut Algorithms.pdf:pdf},
973	Journal = {Handbook of Optimization in Telecommunications},
974	Keywords = {cutting planes, knapsack problem, lagrangian relaxation, relax-and-cut},
975	Number = {1994},
976	Pages = {129--145},
977	Title = {{Lagrangian Relax-and-Cut Algorithms}},
978	Year = {2006}}
979
980@article{Santos2016a,
981	Author = {Santos, H.G. and Toffolo, T.A M. and Gomes, R.A.M. and Ribas, S.},
982	Issn = {0254-5330},
983	Journal = {Annals of Operations Research},
984	Number = {1},
985	Pages = {225--251},
986	Title = {{Integer programming techniques for the nurse rostering problem}},
987	Volume = {239},
988	Year = {2016}}
989
990@article{Insitute2003,
991	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.},
992	Author = {Cicirello, Vincent A. and Smith, Stephen F.},
993	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},
994	Journal = {Journal of Heuristics},
995	Keywords = {combinatorial optimization, randomized heuristics, sequence-dependent setups, stochastic sampling, stochastic search, weighted tardiness scheduling},
996	Pages = {5--34},
997	Title = {{Enhancing Stochastic Search Performance by Value- Biased Randomization of Heuristics}},
998	Volume = {11},
999	Year = {2003}}
1000
1001@phdthesis{Ravetti2007,
1002	Author = {Ravetti, Mart{\'\i}n G{\'o}mez},
1003	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},
1004	School = {Universidade Federal de Minas Gerais},
1005	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}},
1006	Year = {2007}}
1007
1008@incollection{Linderoth2005,
1009	Annote = {From Duplicate 1 (Noncommercial Software for Mixed-Integer Linear Programming - Linderoth, J T; Ralphs, T K) NULL},
1010	Author = {Linderoth, J.T. and Ralphs, T.K.},
1011	Booktitle = {{Integer Programming: Theory and Practice}},
1012	Editor = {Karlof, J.K.},
1013	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Linderoth, Ralphs - 2005 - Noncommercial Software for Mixed-Integer Linear Programming.pdf:pdf},
1014	Pages = {253--303},
1015	Publisher = {CRC Press},
1016	Title = {{Noncommercial Software for Mixed-Integer Linear Programming}},
1017	Year = {2005}}
1018
1019@incollection{Resende2005,
1020	Author = {Resende, M.G.C. and Ribeiro, C.C.},
1021	Editor = {Ibaraki, T. and Nonobe, K. e Yagiura M.},
1022	Pages = {29--63},
1023	Publisher = {Kluwer Academic Publishers},
1024	Title = {{GRASP with path-relinking: Recent advances and applications}},
1025	Year = {2005}}
1026
1027@book{Bellman2003,
1028	Author = {Bellman, R.},
1029	Publisher = {Dover Publications},
1030	Title = {{Dynamic Programming}},
1031	Year = {2003}}
1032
1033@article{Wauters2015,
1034	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.},
1035	Author = {Wauters, T. and Verbeeck, K. and {De Causmaecker}, P. and {Vanden Berghe}, G.},
1036	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},
1037	Journal = {Journal of Scheduling},
1038	Keywords = {Dispersion games, Learning automata, Multi-project scheduling},
1039	Number = {1},
1040	Pages = {61--74},
1041	Title = {{A learning-based optimization approach to multi-project scheduling}},
1042	Volume = {18},
1043	Year = {2015}}
1044
1045@inproceedings{Geiger2013,
1046	Author = {Geiger, Martin Josef},
1047	Booktitle = {{Proceedings of the 6th Multidisciplinary International Scheduling Conference (MISTA 2013)}},
1048	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},
1049	Title = {{Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem}},
1050	Year = {2013}}
1051
1052@article{Towhidi2016,
1053	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.},
1054	Author = {Towhidi, Mehdi and Orban, Dominique},
1055	Doi = {10.1007/s12532-015-0094-2},
1056	File = {:home/haroldo/Documentos/cylp/Customizing the solution process of COIN-OR's linear solvers with Python.pdf:pdf},
1057	Issn = {18672957},
1058	Journal = {Mathematical Programming Computation},
1059	Keywords = {CBC, CGL, CLP, COIN-OR, Cython, Linear programming, Mixed-integer programming, Python, Simplex pivot},
1060	Number = {4},
1061	Pages = {377--391},
1062	Publisher = {Springer Berlin Heidelberg},
1063	Title = {{Customizing the solution process of COIN-OR's linear solvers with Python}},
1064	Volume = {8},
1065	Year = {2016},
1066	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-015-0094-2}}
1067
1068@article{Zilberstein1996,
1069	Author = {Zilberstein, S.},
1070	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Zilberstein - 1996 - Using Anytime Algorithms in Intelligent Systems.pdf:pdf},
1071	Isbn = {9783319120683},
1072	Journal = {AI Magazine},
1073	Number = {3},
1074	Pages = {73--83},
1075	Title = {{Using Anytime Algorithms in Intelligent Systems}},
1076	Volume = {17},
1077	Year = {1996}}
1078
1079@article{Alba2007,
1080	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.},
1081	Annote = {From Duplicate 1 (Software Project Management with GAs - Alba, Enrique; Chicano, J Francisco) NULL},
1082	Author = {Alba, E. and Chicano, J.F.},
1083	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Alba, Chicano - 2007 - Software Project Management with GAs.pdf:pdf},
1084	Journal = {Information Sciences},
1085	Number = {177},
1086	Pages = {2380--2401},
1087	Title = {{Software Project Management with GAs}},
1088	Year = {2007}}
1089
1090@article{Rothberg2007,
1091	Author = {Rothberg, E.},
1092	Journal = {INFORMS JOURNAL ON COMPUTING},
1093	Pages = {534--541},
1094	Title = {{An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions}},
1095	Volume = {19},
1096	Year = {2007}}
1097
1098@incollection{Orman2007a,
1099	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.},
1100	Author = {Orman, A J and Williams, H P},
1101	Booktitle = {{Optimisation, Econometric and Financial Analysis}},
1102	Editor = {Kontoghiorghes, Erricos John and Gatu, Cristian},
1103	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},
1104	Keywords = {polytopes, travelling salesman problem},
1105	Number = {1991},
1106	Pages = {91--104},
1107	Publisher = {Springer Berlin Heidelberg},
1108	Title = {{A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem}},
1109	Year = {2007}}
1110
1111@article{Hertz1991,
1112	Author = {Hertz, A.},
1113	Journal = {European Journal or Operational Research},
1114	Pages = {39--47},
1115	Title = {{Tabu Search for Large Scale Timetabling Problems}},
1116	Volume = {54},
1117	Year = {1991}}
1118
1119@inproceedings{Asta2013,
1120	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},
1121	Author = {Asta, Shahriar and Karapetyan, Daniel and Kheiri, Ahmed and Ozcan, Ender and Parkes, Andrew J},
1122	Booktitle = {{Proceedings of the 6th Multidisciplinary International Scheduling Conference}},
1123	Editor = {Kendall, G and {Vanden Berghe}, G and McCollum, B},
1124	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},
1125	Pages = {836--839},
1126	Title = {{Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem}},
1127	Volume = {(in review},
1128	Year = {2013}}
1129
1130@article{Hansen1997,
1131	Author = {Hansen, P. and Mladenovi{\'c}, N.},
1132	Journal = {Computers and Operations Research},
1133	Number = {11},
1134	Pages = {1097--1100},
1135	Title = {{Variable Neighborhood Search}},
1136	Volume = {24},
1137	Year = {1997}}
1138
1139@article{Aardal1996,
1140	Author = {Aardal, K. and van Hoesel, C. P. M.},
1141	Journal = {Statistica Neerlandica},
1142	Month = {mar},
1143	Number = {1},
1144	Pages = {3--26},
1145	Title = {{Polyhedral techniques in combinatorial optimization I: Theory}},
1146	Volume = {50},
1147	Year = {1996}}
1148
1149@article{Fonseca2017,
1150	Author = {Fonseca, G.H.G. and Santos, H.G. and Carrano, E.G. and Stidsen, T.J.R.},
1151	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fonseca et al. - 2017 - Integer programming techniques for educational timetabling.pdf:pdf},
1152	Journal = {European Journal of Operational Research},
1153	Pages = {28--39},
1154	Title = {{Integer programming techniques for educational timetabling}},
1155	Volume = {262},
1156	Year = {2017}}
1157
1158@article{Parragh2013-2,
1159	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.},
1160	Author = {Parragh, Sophie N and Schmid, Verena},
1161	Doi = {10.1016/j.cor.2012.08.004},
1162	Issn = {0305-0548},
1163	Journal = {Computers {\&} operations research},
1164	Keywords = {Column generation, Dial-a-ride problem, Hybrid algorithm, Variable neighborhood search, large neighborhood search},
1165	Number = {1},
1166	Pages = {490--497},
1167	Pmid = {23471127},
1168	Publisher = {Elsevier},
1169	Title = {{Hybrid column generation and large neighborhood search for the dial-a-ride problem.}},
1170	Url = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368{\&}tool=pmcentrez{\&}rendertype=abstract},
1171	Volume = {40},
1172	Year = {2013},
1173	Bdsk-Url-1 = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=3587368%7B%5C&%7Dtool=pmcentrez%7B%5C&%7Drendertype=abstract},
1174	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2012.08.004}}
1175
1176@article{Burke2004a,
1177	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},
1178	Author = {Burke, E.K. and {De Causmaecker}, P. and {Vanden Berghe}, G. and {Van Landeghem}, H.},
1179	Journal = {Journal of Scheduling},
1180	Pages = {441--499},
1181	Title = {{The State of the Art of Nurse Rostering}},
1182	Volume = {7},
1183	Year = {2004}}
1184
1185@article{Achterberg2007,
1186	Author = {Achterberg, T.},
1187	Journal = {Discrete Optimization},
1188	Pages = {4--20},
1189	Title = {{Conflict analysis in mixed integer programming}},
1190	Volume = {4},
1191	Year = {2007}}
1192
1193@book{Callahan1992,
1194	Author = {Callahan, M T and Quackenbush, D G and Rowings, J E},
1195	Isbn = {0070097011},
1196	Publisher = {McGraw-Hill},
1197	Title = {{Construction Project Scheduling}},
1198	Year = {1992}}
1199
1200@article{Fleszar2011-2,
1201	Author = {Fleszar, Krzysztof and Charalambous, Christoforos and Hindi, Khalil S},
1202	Doi = {10.1007/s10845-011-0522-8},
1203	Issn = {0956-5515},
1204	Journal = {Journal of Intelligent Manufacturing},
1205	Keywords = {hybrid optimization, makespan minimization, mip neighborhood, mixed-integer programming, neighborhood search, parallel machine, parallel machine scheduling},
1206	Mendeley-Tags = {mip neighborhood,parallel machine},
1207	Number = {5},
1208	Pages = {1949--1958},
1209	Title = {{A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times}},
1210	Url = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
1211	Volume = {23},
1212	Year = {2011},
1213	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-011-0522-8},
1214	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-011-0522-8}}
1215
1216@misc{Post2012,
1217	Author = {Post, Gerhard},
1218	Title = {{International Timetabling Competition: Results}},
1219	Url = {http://www.utwente.nl/ctit/hstt/itc2011/results/},
1220	Year = {2012},
1221	Bdsk-Url-1 = {http://www.utwente.nl/ctit/hstt/itc2011/results/}}
1222
1223@article{Hammer1975,
1224	Author = {Hammer, P.L. and Johnson, E.L. and Peled, U.N.},
1225	Journal = {Mathematical Programming},
1226	Number = {1},
1227	Pages = {179--206},
1228	Title = {{Facets of Regular 0-1 Polytopes}},
1229	Volume = {8},
1230	Year = {1975}}
1231
1232@article{Belotti2016,
1233	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.},
1234	Author = {Belotti, Pietro and Bonami, Pierre and Fischetti, Matteo and Lodi, Andrea and Monaci, Michele and Nogales-G{\'o}mez, Amaya and Salvagnin, Domenico},
1235	Doi = {10.1007/s10589-016-9847-8},
1236	File = {:home/haroldo/Documentos/IntegerProgramming/indicator constraints/On{\_}handling{\_}indicator{\_}constraints{\_}in{\_}mixed{\_}integer.pdf:pdf},
1237	Issn = {15732894},
1238	Journal = {Computational Optimization and Applications},
1239	Keywords = {Indicator constraints, Mixed-integer linear programming, Mixed-integer quadratic programming},
1240	Number = {3},
1241	Pages = {545--566},
1242	Title = {{On handling indicator constraints in mixed integer programming}},
1243	Volume = {65},
1244	Year = {2016},
1245	Bdsk-Url-1 = {https://doi.org/10.1007/s10589-016-9847-8}}
1246
1247@book{Fourer1987,
1248	Author = {Fourer, Robert and Gay, David and Kernighan, Brian},
1249	File = {:home/haroldo/Documentos/ampl/ampl3.pdf:pdf},
1250	Publisher = {AT {\&} T Bell Laboratories},
1251	Title = {{AMPL: A mathematical programming language}},
1252	Year = {1987}}
1253
1254@article{Pecin2017a,
1255	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.},
1256	Author = {Pecin, D. and Pessoa, A. and Poggi, M. and Uchoa, E.},
1257	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},
1258	Isbn = {9783319075563},
1259	Journal = {Mathematical Programming Computation},
1260	Keywords = {Algorithmic engineering, Column generation, Cut separation, Integer programming},
1261	Number = {1},
1262	Pages = {61--100},
1263	Publisher = {Springer Berlin Heidelberg},
1264	Title = {{Improved branch-cut-and-price for capacitated vehicle routing}},
1265	Volume = {9},
1266	Year = {2017}}
1267
1268@article{Xiao2013,
1269	Author = {Xiao, Jing and Ao, Xian-Ting and Tang, Yong},
1270	Doi = {10.1016/j.cor.2012.05.007},
1271	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},
1272	Issn = {03050548},
1273	Journal = {Computers {\&} Operations Research},
1274	Keywords = {Ant colony optimization, Automatic software management, Scheduling, Software project scheduling},
1275	Month = {jan},
1276	Number = {1},
1277	Pages = {33--46},
1278	Publisher = {Elsevier},
1279	Title = {{Solving software project scheduling problems with ant colony optimization}},
1280	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054812001104},
1281	Volume = {40},
1282	Year = {2013},
1283	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054812001104},
1284	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2012.05.007}}
1285
1286@incollection{Tomita2011,
1287	Author = {Tomita, Etsuji and Akutsu, Tatsuya and Matsunaga, Tsutomu},
1288	Booktitle = {{Biomedical Engineering, Trends in Electronics, Communications and Software}},
1289	Editor = {Laskovski, Anthony N},
1290	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},
1291	Number = {3},
1292	Pages = {625--640},
1293	Publisher = {InTech},
1294	Title = {{Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics}},
1295	Year = {2011}}
1296
1297@article{Boyd1994a,
1298	Author = {Boyd, E.A.},
1299	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Boyd - 1994 - Solving 01 integer programs with enumeration cutting planes.pdf:pdf},
1300	Journal = {Annals of Operations Research},
1301	Number = {1},
1302	Pages = {61--72},
1303	Title = {{Solving 0/1 integer programs with enumeration cutting planes}},
1304	Volume = {50},
1305	Year = {1994}}
1306
1307@inproceedings{Fischetti2018,
1308	Author = {Fischetti, Matteo and Salvagnin, Domenico},
1309	Booktitle = {{Proceedings of the CPAIOR 2018 : Integration of Constraint Programming, Artificial Intelligence, and Operations Research}},
1310	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2018 - Chasing first queens by integer programming.pdf:pdf},
1311	Keywords = {Lexicographic simplex, Mixed-integer programming, n-Queens problem},
1312	Pages = {232--244},
1313	Title = {{Chasing first queens by integer programming}},
1314	Year = {2018}}
1315
1316@article{Graham1979,
1317	Author = {Graham, R.L. and Lawler, Eugene and Lenstra, Jan Karel and {Rinnooy Kan}, A.H.G.},
1318	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},
1319	Journal = {Annals of Discrete Mathematics},
1320	Number = {2},
1321	Pages = {287--326},
1322	Title = {{Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey}},
1323	Volume = {5},
1324	Year = {1979}}
1325
1326@article{Santos2005,
1327	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.},
1328	Author = {Santos, H.G. G. and Ochi, L.S. and Souza, M.J.F.},
1329	Doi = {10.1145/1064546.1180621},
1330	Issn = {1084-6654},
1331	Journal = {Journal of Experimental Algorithmics (JEA)},
1332	Keywords = {Metaheuristics, Tabu search, Timetabling},
1333	Title = {{A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem}},
1334	Volume = {10},
1335	Year = {2005},
1336	Bdsk-Url-1 = {https://doi.org/10.1145/1064546.1180621}}
1337
1338@article{Hoffman1991,
1339	Author = {Hoffman, K. L. and Padberg, M.},
1340	Doi = {10.1287/ijoc.3.2.121},
1341	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},
1342	Issn = {1091-9856},
1343	Journal = {INFORMS Journal on Computing},
1344	Number = {2},
1345	Pages = {121--134},
1346	Title = {{Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut}},
1347	Volume = {3},
1348	Year = {1991},
1349	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.3.2.121}}
1350
1351@article{Toffolo2016,
1352	Author = {Toffolo, T.A.M. and Santos, H.G. and Carvalho, M.A.M. and Soares, J.A.},
1353	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},
1354	Journal = {Journal of Scheduling},
1355	Number = {3},
1356	Pages = {295--307},
1357	Publisher = {Springer US},
1358	Title = {{An integer programming approach to the multimode resource-constrained multiproject scheduling problem}},
1359	Volume = {19},
1360	Year = {2016}}
1361
1362@article{Sapkota2011-2,
1363	Author = {Sapkota, Nabin and Reilly, Charles H},
1364	Doi = {10.1016/j.cie.2011.02.008},
1365	Issn = {03608352},
1366	Journal = {Computers {\&} Industrial Engineering},
1367	Keywords = {explicit correlation induction, karush, kuhn, set covering problem, tucker conditions},
1368	Number = {1},
1369	Pages = {39--47},
1370	Publisher = {Elsevier Ltd},
1371	Title = {{Simulating realistic set covering problems with known optimal solutions}},
1372	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
1373	Volume = {61},
1374	Year = {2011},
1375	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0360835211000635},
1376	Bdsk-Url-2 = {https://doi.org/10.1016/j.cie.2011.02.008}}
1377
1378@misc{CenterforHistoryandNewMedia,
1379	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.},
1380	Author = {{Center for History and New Media}},
1381	Title = {{Guia de In{\'\i}cio R{\'a}pido}},
1382	Url = {http://zotero.org/support/quick{\_}start{\_}guide},
1383	Bdsk-Url-1 = {http://zotero.org/support/quick%7B%5C_%7Dstart%7B%5C_%7Dguide}}
1384
1385@incollection{Rice1976,
1386	Author = {Rice, J.R.},
1387	Booktitle = {{Advances in Computers}},
1388	Editor = {Rubinoff, Morris and Yovits, Marshall C.},
1389	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Rice - 1976 - The Algorithm Selection Problem.pdf:pdf},
1390	Pages = {65--118},
1391	Publisher = {Elsevier},
1392	Title = {{The Algorithm Selection Problem}},
1393	Year = {1976}}
1394
1395@article{Costa1994,
1396	Author = {Costa, D.},
1397	Journal = {European Journal of Operational Research},
1398	Pages = {98--110},
1399	Title = {{A Tabu Search algorithm for computing an operational timetable}},
1400	Volume = {76},
1401	Year = {1994}}
1402
1403@phdthesis{Souza2000,
1404	Address = {Rio de Janeiro, Brasil},
1405	Author = {Souza, M J F},
1406	Title = {{Programa$\backslash$cc{\{}{\~a}{\}}o de Hor{\{}{\'a}{\}}rios em Escolas: Uma Aproxima$\backslash$cc{\{}{\~a}{\}}o por Metaheur{\{}{\'\i}{\}}sticas}},
1407	Year = {2000}}
1408
1409@article{AAtamturk2005,
1410	Author = {AAtamt{\"u}rk, A. and Savelsbergh, M.W.P.},
1411	Journal = {Annals of Operations Research},
1412	Pages = {67--124},
1413	Title = {{Integer-Programming Software Systems}},
1414	Volume = {140},
1415	Year = {2005}}
1416
1417@article{Garille2001,
1418	Author = {Marchand, Hugues and Wolsey, Laurence A.},
1419	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Marchand, Wolsey - 2001 - Aggregation and Mixed Integer Rounding to Solve MIPs.pdf:pdf},
1420	Journal = {Operations Research},
1421	Number = {3},
1422	Pages = {363--371},
1423	Title = {{Aggregation and Mixed Integer Rounding to Solve MIPs}},
1424	Volume = {49},
1425	Year = {2001}}
1426
1427@article{Carr2002,
1428	Author = {Carr, Robert D. and Lancia, Giuseppe},
1429	Doi = {10.1016/S0167-6377(01)00106-7},
1430	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Carr, Lancia - 2002 - Compact vs. exponential-size LP relaxations.pdf:pdf},
1431	Issn = {01676377},
1432	Journal = {Operations Research Letters},
1433	Keywords = {compact optimization, integer program, linear program, separation},
1434	Month = {feb},
1435	Number = {1},
1436	Pages = {57--65},
1437	Title = {{Compact vs. exponential-size LP relaxations}},
1438	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0167637701001067},
1439	Volume = {30},
1440	Year = {2002},
1441	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0167637701001067},
1442	Bdsk-Url-2 = {https://doi.org/10.1016/S0167-6377(01)00106-7}}
1443
1444@misc{Hill2009,
1445	Author = {Hill, H.},
1446	Booktitle = {{Phi Delta Kappan}},
1447	Doi = {10.1177/0964663912467814},
1448	Issn = {09646639},
1449	Pages = {470--476},
1450	Title = {{Fixing Teacher Professional Development}},
1451	Volume = {90},
1452	Year = {2009},
1453	Bdsk-Url-1 = {https://doi.org/10.1177/0964663912467814}}
1454
1455@article{Lawler,
1456	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.},
1457	Annote = {From Duplicate 2 (Sequencing and Scheduling Algorithms and Complexity - Lawler, Eugene; Lenstra, Jan Karel; Rinooy Kan, Alexander H G; Shmoys, David B) NULL},
1458	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.},
1459	Doi = {10.1016/S0927-0507(05)80189-6},
1460	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},
1461	Isbn = {978-0-444-87472-6},
1462	Issn = {09270507},
1463	Journal = {Handbooks in OR {\&} MS},
1464	Number = {C},
1465	Pages = {445--522},
1466	Title = {{Sequencing and Scheduling Algorithms and Complexity}},
1467	Volume = {4},
1468	Year = {1993},
1469	Bdsk-Url-1 = {https://doi.org/10.1016/S0927-0507(05)80189-6}}
1470
1471@article{Frota2004,
1472	Author = {Frota, Y and Camp{\^e}lo, M. and Corr{\^e}a, R.},
1473	Journal = {Information Processing Letters},
1474	Pages = {159--164},
1475	Title = {{Cliques, holes and the vertex coloring polytope}},
1476	Volume = {89},
1477	Year = {2004}}
1478
1479@article{Coelho2011,
1480	Author = {Coelho, Jos{\'e} and Vanhoucke, Mario},
1481	Doi = {10.1016/j.ejor.2011.03.019},
1482	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},
1483	Issn = {03772217},
1484	Journal = {European Journal of Operational Research},
1485	Month = {aug},
1486	Number = {1},
1487	Pages = {73--82},
1488	Title = {{Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers}},
1489	Url = {http://linkinghub.elsevier.com/retrieve/pii/S037722171100230X},
1490	Volume = {213},
1491	Year = {2011},
1492	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S037722171100230X},
1493	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2011.03.019}}
1494
1495@article{Alfandari2010-2,
1496	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
1497	Doi = {10.1016/j.endm.2010.05.061},
1498	Issn = {15710653},
1499	Journal = {Electronic Notes in Discrete Mathematics},
1500	Keywords = {alarme processing, approximation, integer programming, maximal coverage, np-hardness, set covering},
1501	Mendeley-Tags = {alarme processing},
1502	Pages = {479--485},
1503	Title = {{Approximation of the Clustered Set Covering Problem}},
1504	Url = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624 http://www.sciencedirect.com/science/article/pii/S1571065310000624},
1505	Volume = {36},
1506	Year = {2010},
1507	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571065310000624%20http://www.sciencedirect.com/science/article/pii/S1571065310000624},
1508	Bdsk-Url-2 = {https://doi.org/10.1016/j.endm.2010.05.061}}
1509
1510@article{Santos2006,
1511	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.},
1512	Author = {Santos, H.G. G. and Ochi, L.S. S. and Marinho, E.H. H. and Drummond, L.M.A. M. A.},
1513	Doi = {10.1016/j.neucom.2006.07.008},
1514	Issn = {0925-2312},
1515	Journal = {Neurocomputing},
1516	Keywords = {Data mining, Evolutionary algorithms, Vehicle routing},
1517	Number = {1-3},
1518	Pages = {70--77},
1519	Title = {{Combining an Evolutionary Algorithm with Data Mining to solve a Vehicle Routing Problem}},
1520	Url = {http://www.sciencedirect.com/science/article/pii/S0925231206002050},
1521	Volume = {70},
1522	Year = {2006},
1523	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0925231206002050},
1524	Bdsk-Url-2 = {https://doi.org/10.1016/j.neucom.2006.07.008}}
1525
1526@article{Aardal1999,
1527	Author = {Aardal, K. and van Hoesel, C. P. M.},
1528	Journal = {Statistica Neerlandica},
1529	Month = {jul},
1530	Number = {2},
1531	Pages = {131--177},
1532	Title = {{Polyhedral techniques in combinatorial optimization II: applications and computations}},
1533	Volume = {53},
1534	Year = {1999}}
1535
1536@techreport{miplib2017,
1537	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.},
1538	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},
1539	Institution = {Zuse Institute Berlin},
1540	Pages = {1--38},
1541	Title = {{MIPLIB 2017 : Data-Driven Compilation of the 6th Mixed-Integer Programming Library}},
1542	Url = {http://miplib.zib.de/},
1543	Year = {2019},
1544	Bdsk-Url-1 = {http://miplib.zib.de/}}
1545
1546@article{Cornuejols2007,
1547	Author = {Cornu{\'e}jols, G.},
1548	Journal = {Annals of Operations Research},
1549	Number = {1},
1550	Pages = {63--66},
1551	Title = {{Revival of the Gomory cuts in the 1990$\backslash$' s}},
1552	Volume = {149},
1553	Year = {2007}}
1554
1555@inproceedings{Rodrigues2013,
1556	Author = {Rodrigues, Lucas U and Santos, Haroldo G and Toffolo, T{\'u}lio {\^A}ngelo Machado and Silva, Cristiano L T F},
1557	Booktitle = {{MISTA 2013: Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications}},
1558	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},
1559	Pages = {458--471},
1560	Title = {{Local search techniques applied to the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times}},
1561	Year = {2013}}
1562
1563@article{Fonseca2016,
1564	Author = {Fonseca, George H.G. and Santos, Haroldo G. and Carrano, Eduardo G.},
1565	Doi = {10.1016/j.cor.2016.04.016},
1566	Issn = {03050548},
1567	Journal = {Computers {\&} Operations Research},
1568	Month = {oct},
1569	Pages = {108--117},
1570	Title = {{Integrating matheuristics and metaheuristics for timetabling}},
1571	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054816300879},
1572	Volume = {74},
1573	Year = {2016},
1574	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054816300879},
1575	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2016.04.016}}
1576
1577@article{DaFonseca2016,
1578	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.},
1579	Annote = {NULL},
1580	Author = {da Fonseca, G.H.G. and Santos, H.G. and Toffolo, T.{\^A}.M. and Brito, S.S. and Souza, M.J.F.},
1581	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},
1582	Journal = {Annals of Operations Research},
1583	Keywords = {High School Timetabling Problem, Iterated Local Search, Metaheuristics, Simulated Annealing, Third International Timetabling Competition},
1584	Pages = {77--97},
1585	Title = {{GOAL solver: a hybrid local search based solver for high school timetabling}},
1586	Volume = {239},
1587	Year = {2016}}
1588
1589@article{Johnson2000,
1590	Author = {Johnson, E.L. and Nemhauser, G. and Savelsbergh, W.P.},
1591	Journal = {INFORMS Journal on Computing},
1592	Title = {{Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition}},
1593	Volume = {12},
1594	Year = {2000}}
1595
1596@article{Kerninghan1970,
1597	Author = {Kerninghan, B.W. and Lin, S.},
1598	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kerninghan, Lin - 1970 - An efficient heuristic procedure for partitioning Graphs.pdf:pdf},
1599	Journal = {The bell system technical journal},
1600	Title = {{An efficient heuristic procedure for partitioning Graphs}},
1601	Year = {1970}}
1602
1603@book{Dantzig1998,
1604	Author = {Dantzig, G.},
1605	Publisher = {Princeton University Press},
1606	Title = {{Linear Programming and Extensions}},
1607	Year = {1998}}
1608
1609@article{Herroelen2005,
1610	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.},
1611	Author = {Herroelen, W. and Leus, R.},
1612	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Herroelen, Leus - 2005 - Project scheduling under uncertainty Survey and research potentials.pdf:pdf},
1613	Journal = {European Journal of Operational Research},
1614	Keywords = {Project management and scheduling, Robustness, Schedule stability, Scheduling under uncertainty},
1615	Number = {2},
1616	Pages = {289--306},
1617	Title = {{Project scheduling under uncertainty: Survey and research potentials}},
1618	Volume = {165},
1619	Year = {2005}}
1620
1621@book{Wolsey1998,
1622	Author = {Wolsey, Laurence A.},
1623	Isbn = {0471283665},
1624	Pages = {288},
1625	Publisher = {Wiley-Interscience},
1626	Title = {{Integer Programming}},
1627	Year = {1998}}
1628
1629@article{Tarantilis2004,
1630	Author = {Tarantilis, C. D. and Kiranoudis, C. T. and Vassiliadis, V. S.},
1631	Doi = {10.1016/S0377-2217(02)00669-0},
1632	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},
1633	Isbn = {0377-2217},
1634	Issn = {03772217},
1635	Journal = {European Journal of Operational Research},
1636	Keywords = {Combinatorial optimization, Distribution, Logistics, Metaheuristics, Routing},
1637	Number = {1},
1638	Pages = {148--158},
1639	Title = {{A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem}},
1640	Volume = {152},
1641	Year = {2004},
1642	Bdsk-Url-1 = {https://doi.org/10.1016/S0377-2217(02)00669-0}}
1643
1644@article{DePaula2007a,
1645	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.},
1646	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},
1647	Author = {{De Paula}, Mateus Rocha and Ravetti, M. G. and Mateus, Geraldo Robson and Pardalos, Panos M.},
1648	Doi = {10.1093/imaman/dpm016},
1649	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},
1650	Isbn = {1471678X (ISSN)},
1651	Issn = {1471678X},
1652	Journal = {IMA Journal Management Mathematics},
1653	Keywords = {GRASP, Scheduling problems, Variable neighbourhood search},
1654	Number = {2},
1655	Pages = {101--115},
1656	Title = {{Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search}},
1657	Volume = {18},
1658	Year = {2007},
1659	Bdsk-Url-1 = {https://doi.org/10.1093/imaman/dpm016}}
1660
1661@article{Alverez-Valdes2001,
1662	Author = {Alverez-Vald{\'e}s, R. and Crespo, E. and Tamarit, J.M.},
1663	Journal = {Investigacion Operacional},
1664	Number = {2},
1665	Pages = {104--113},
1666	Title = {{Tabu search: an efficient metaheuristic for university organization problems}},
1667	Volume = {22},
1668	Year = {2001}}
1669
1670@article{Zhu2006,
1671	Author = {Zhu, G. and Bard, J.F. and Yu, G.},
1672	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},
1673	Journal = {INFORMS Journal on Computing},
1674	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},
1675	Number = {3},
1676	Pages = {377--390},
1677	Title = {{A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem}},
1678	Volume = {18},
1679	Year = {2006}}
1680
1681@phdthesis{Ravetti2007-2,
1682	Author = {Ravetti, Mart{\'\i}n G{\'o}mez},
1683	School = {Universidade Federal de Minas Gerais},
1684	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}},
1685	Year = {2007}}
1686
1687@article{Souza2010,
1688	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.},
1689	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},
1690	Doi = {10.1016/j.ejor.2010.05.031},
1691	Issn = {0377-2217},
1692	Journal = {European Journal of Operational Research},
1693	Keywords = {{\textless}span style='font-family : courier'{\textgreater}GRASP{\textless}/span{\textgreater}, GRASP, Mathematical programming, Metaheuristics, Open-pit-mining, Variable neighborhood search},
1694	Number = {2},
1695	Pages = {1041--1051},
1696	Title = {{A hybrid heuristic algorithm for the open-pit-mining operational planning problem}},
1697	Url = {http://www.sciencedirect.com/science/article/pii/S0377221710003875},
1698	Volume = {207},
1699	Year = {2010},
1700	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0377221710003875},
1701	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2010.05.031}}
1702
1703@article{Pereira2011-2,
1704	Author = {Pereira, Jordi and Averbakh, Igor},
1705	Doi = {10.1007/s10479-011-0876-5},
1706	Issn = {0254-5330},
1707	Journal = {Annals of Operations Research},
1708	Keywords = {benders decomposition, branch-and-cut, combinatorial optimization, genetic algorithms, heuristics, minmax regret, optimization, set covering problem},
1709	Number = {1},
1710	Pages = {217--235},
1711	Title = {{The robust set covering problem with interval data}},
1712	Url = {http://link.springer.com/10.1007/s10479-011-0876-5 http://link.springer.com/article/10.1007/s10479-011-0876-5},
1713	Volume = {207},
1714	Year = {2011},
1715	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10479-011-0876-5%20http://link.springer.com/article/10.1007/s10479-011-0876-5},
1716	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-011-0876-5}}
1717
1718@inproceedings{Araujo2017,
1719	Author = {Araujo, J.A.S. and Santos, H.G.},
1720	Booktitle = {{Computational Science and Its Applications - ICCSA 2017}},
1721	Keywords = {Chv{\'a}tal-Gomory cuts, Cutting plane algorithms, Project scheduling problem, RCPSP},
1722	Pages = {452--466},
1723	Publisher = {Springer},
1724	Title = {{Separation strategies for chv{\'a}tal-gomory cuts in resource constrained project scheduling problems: A computational study}},
1725	Year = {2017}}
1726
1727@incollection{Desrosiers2005,
1728	Author = {Desrosiers, Jacques and L{\"u}bbecke, Marco E.},
1729	Booktitle = {{Column Generation}},
1730	Editor = {Desaulniers, Guy and Desrosiers, Jacques and Solomon, Marius M.},
1731	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Desrosiers, L{\"{u}}bbecke - 2005 - A Primer in Column Generation.pdf:pdf},
1732	Pages = {1--32},
1733	Publisher = {Springer US},
1734	Title = {{A Primer in Column Generation}},
1735	Year = {2005}}
1736
1737@incollection{Gamrath2016,
1738	Author = {Gamrath, Gerald and Berthold, Timo and Heinz, Stefan and Winkler, Michael},
1739	Booktitle = {{Optimization in the Real World: Toward Solving Real-World Optimization Problems}},
1740	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath et al. - 2016 - Structure-Based Primal Heuristics forMixed Integer Programming.pdf:pdf},
1741	Keywords = {domain propagation, large neighborhood search, primal heuristics},
1742	Pages = {37--53},
1743	Title = {{Structure-Based Primal Heuristics forMixed Integer Programming}},
1744	Year = {2016}}
1745
1746@article{Avalos-Rosales2015,
1747	Author = {Avalos-Rosales, Oliver and Angel-Bello, Francisco and Alvarez, Ada},
1748	Doi = {10.1007/s00170-014-6390-6},
1749	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},
1750	Isbn = {0017001463},
1751	Issn = {0268-3768},
1752	Journal = {The International Journal of Advanced Manufacturing Technology},
1753	Keywords = {dependent setup times, makespan, multi-start, scheduling, unrelated parallel machines, vnd},
1754	Number = {9-12},
1755	Pages = {1705--1718},
1756	Title = {{Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times}},
1757	Url = {http://link.springer.com/10.1007/s00170-014-6390-6},
1758	Volume = {76},
1759	Year = {2015},
1760	Bdsk-Url-1 = {http://link.springer.com/10.1007/s00170-014-6390-6},
1761	Bdsk-Url-2 = {https://doi.org/10.1007/s00170-014-6390-6}}
1762
1763@article{Campelo2005,
1764	Author = {Camp{\^e}lo, Manoel and Campos, Victor and Corr{\^e}a, Ricardo},
1765	Doi = {10.1016/j.endm.2005.05.045},
1766	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},
1767	Issn = {15710653},
1768	Journal = {Electronic Notes in Discrete Mathematics},
1769	Keywords = {facets of polyhedra, graph coloring, integer programming},
1770	Month = {jun},
1771	Pages = {337--343},
1772	Title = {{On the asymmetric representatives formulation for the vertex coloring problem}},
1773	Url = {http://linkinghub.elsevier.com/retrieve/pii/S1571065305050444},
1774	Volume = {19},
1775	Year = {2005},
1776	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571065305050444},
1777	Bdsk-Url-2 = {https://doi.org/10.1016/j.endm.2005.05.045}}
1778
1779@article{Eiselt1987,
1780	Author = {Eiselt, H. A. and Laporte, G.},
1781	Journal = {Journal of Operations Research},
1782	Number = {9},
1783	Pages = {785--795},
1784	Title = {{Combinatorial optimization problems with soft and hard requirements}},
1785	Volume = {38},
1786	Year = {1987}}
1787
1788@article{Hertz1987,
1789	Author = {Hertz, A. and Werra, D.},
1790	Journal = {Computing},
1791	Month = {dec},
1792	Number = {4},
1793	Pages = {345--351},
1794	Title = {{Using tabu search techniques for graph coloring}},
1795	Volume = {39},
1796	Year = {1987}}
1797
1798@article{Rocha2008,
1799	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.},
1800	Author = {Rocha, Pedro Leite and Ravetti, Mart{\'\i}n G{\'o}mez and Mateus, Geraldo Robson and Pardalos, Panos M.},
1801	Doi = {10.1016/j.cor.2006.07.015},
1802	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},
1803	Issn = {03050548},
1804	Journal = {Computers {\&} Operations Research},
1805	Keywords = {branch-and-bound, grasp, machine-dependent setups, parallel machines, scheduling, sequence-dependent setups},
1806	Month = {apr},
1807	Number = {4},
1808	Pages = {1250--1264},
1809	Title = {{Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times}},
1810	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054806001614},
1811	Volume = {35},
1812	Year = {2008},
1813	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054806001614},
1814	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2006.07.015}}
1815
1816@article{Tripathy1984,
1817	Author = {Tripathy, Arabinda},
1818	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},
1819	Journal = {Management Science},
1820	Number = {12},
1821	Pages = {1473--1489},
1822	Title = {{School Timetabling - A Case in Large Binary Integer Linear Programming}},
1823	Volume = {30},
1824	Year = {1984}}
1825
1826@article{Balas1975,
1827	Author = {Balas, E.},
1828	Journal = {Mathematical Programming},
1829	Number = {1},
1830	Pages = {146--164},
1831	Title = {{Facets of the Knapsack Polytope}},
1832	Volume = {8},
1833	Year = {1975}}
1834
1835@article{Berthold2017,
1836	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.},
1837	Author = {Berthold, Timo and Lodi, Andrea and Salvagnin, Domenico},
1838	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Berthold, Lodi, Salvagnin - 2017 - Ten years of Feasibility Pump, and counting.pdf:pdf},
1839	Title = {{Ten years of Feasibility Pump, and counting}},
1840	Url = {http://www.dei.unipd.it/{~}salvagni/pdf/10yearsFP.pdf},
1841	Year = {2017},
1842	Bdsk-Url-1 = {http://www.dei.unipd.it/%7B~%7Dsalvagni/pdf/10yearsFP.pdf}}
1843
1844@article{Fischetti2005,
1845	Author = {Fischetti, M. and Glover, F. and Lodi, A.},
1846	Journal = {Mathematical Programming},
1847	Pages = {91--104},
1848	Title = {{The feasibility pump}},
1849	Volume = {104},
1850	Year = {2005}}
1851
1852@article{Operativa2016,
1853	Author = {Operativa, Ricerca and Wiese, Sven},
1854	File = {:home/haroldo/Documentos/IntegerProgramming/indicator constraints/On the interplay of Mixed Integer Linear,Mixed Integer Nonlinear and Constraint Programming.pdf:pdf},
1855	Title = {{On the interplay of Mixed Integer Linear , Mixed Integer Nonlinear and Constraint Programming}},
1856	Year = {2016}}
1857
1858@article{Padberg1987,
1859	Author = {Padberg, M.W. and Rinaldi, G.},
1860	Journal = {Operations Research Letters},
1861	Pages = {1--7},
1862	Title = {{Optimization of a 532-city symmetric traveling salesman problem by branch and cut}},
1863	Volume = {6},
1864	Year = {1987}}
1865
1866@article{M.Groiez2015,
1867	Author = {{M. Groiez}, G. Desaulniers and Marcotte, O.},
1868	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},
1869	Isbn = {2550351290},
1870	Issn = {0705-5846},
1871	Number = {2004},
1872	Title = {{Valid inequalities and separation algorithms for the set partitioning problem}},
1873	Year = {2015}}
1874
1875@techreport{Haspeslagh2010,
1876	Address = {KULeuven Campus Kortrijk. Belgium},
1877	Author = {Haspeslagh, S. and {De Causmaecker}, P. and Stolevik, M. and A., Schaerf.},
1878	Institution = {CODeS, Department of Computer Science},
1879	Title = {{First international nurse rostering competition 2010}},
1880	Year = {2010}}
1881
1882@article{Muritiba2010,
1883	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.},
1884	Author = {Muritiba, Albert E.Fernandes and Iori, Manuel and Malaguti, Enrico and Toth, Paolo},
1885	Doi = {10.1287/ijoc.1090.0355},
1886	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},
1887	Isbn = {1091-9856},
1888	Issn = {10919856},
1889	Journal = {INFORMS Journal on Computing},
1890	Keywords = {Bin packing with conflicts, Branch and price, Heuristics, Lower bounds, Vertex coloring},
1891	Number = {3},
1892	Pages = {401--415},
1893	Title = {{Algorithms for the bin packing problem with conflicts}},
1894	Volume = {22},
1895	Year = {2010},
1896	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.1090.0355}}
1897
1898@article{Campelo2008,
1899	Author = {Camp{\^e}lo, M. and Campos, V.A. and Corr{\^e}a, R.C.},
1900	Journal = {Discrete Applied Mathematics},
1901	Number = {1},
1902	Pages = {1097--1111},
1903	Title = {{On the asymmetric representatives formulation for the vertex coloring problem}},
1904	Volume = {156},
1905	Year = {2008}}
1906
1907@inproceedings{Brito2011,
1908	Author = {Brito, S.S. and Santos, H. G.},
1909	Title = {{Pivoting in the Bron-Kerbosch algorithm for maximum-weight clique detection (in portuguese).}},
1910	Year = {2011}}
1911
1912@inproceedings{Soares2015,
1913	Author = {Soares, J.A. and Santos, H. G. and Baltar, Davi and Toffolo, T.A.M.},
1914	Booktitle = {{Proceedings of 7th Multidisciplinary International Conference on Scheduling}},
1915	Pages = {905-----908},
1916	Title = {{LAHC applied to The Multi-Mode Resource -Constrained Multi-Project Scheduling Problem.}},
1917	Year = {2015}}
1918
1919@article{Smith-Miles2012-2,
1920	Author = {Smith-Miles, Kate and Lopes, Leo},
1921	Doi = {10.1016/j.cor.2011.07.006},
1922	Issn = {03050548},
1923	Journal = {Computers {\&} Operations Research},
1924	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},
1925	Mendeley-Tags = {testing},
1926	Number = {5},
1927	Pages = {875--889},
1928	Publisher = {Elsevier},
1929	Title = {{Measuring instance difficulty for combinatorial optimization problems}},
1930	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
1931	Volume = {39},
1932	Year = {2012},
1933	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054811001997},
1934	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2011.07.006}}
1935
1936@inproceedings{Leyton-Brown2003,
1937	Author = {Leyton-Brown, K and Nudelman, Eugene and Andrew, Galen},
1938	Booktitle = {{Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03)}},
1939	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Leyton-Brown, Nudelman, Andrew - 2003 - A portfolio approach to algorithm selection.pdf:pdf},
1940	Pages = {1542--1543},
1941	Title = {{A portfolio approach to algorithm selection}},
1942	Url = {http://robotics.stanford.edu/people/shoham/www papers/portfolio-IJCAI03.pdf},
1943	Year = {2003},
1944	Bdsk-Url-1 = {http://robotics.stanford.edu/people/shoham/www%20papers/portfolio-IJCAI03.pdf}}
1945
1946@article{Mitchell2009,
1947	Author = {Mitchell, Stuart},
1948	File = {:home/haroldo/Documentos/coin/pulp/PulpForPythonProgrammers.pdf:pdf},
1949	Journal = {Python Papers Monograph},
1950	Number = {14},
1951	Title = {{An Introduction to PuLP for Python Programmers}},
1952	Volume = {1},
1953	Year = {2009}}
1954
1955@phdthesis{Santos2007-2,
1956	Author = {Santos, H G},
1957	Title = {{Formula$\backslash$cces e Algoritmos para o Problema de Programa$\backslash$cc{\{}{\~a}{\}}o de Hor{\{}{\'a}{\}}rios em Escolas}},
1958	Year = {2007}}
1959
1960@incollection{Cooper1996,
1961	Address = {London, UK},
1962	Author = {Cooper, T. and Kingston, J. H.},
1963	Pages = {283--295},
1964	Publisher = {Springer-Verlag},
1965	Series = {{Springer Lecture Notes in Computer Science}},
1966	Title = {{The complexity of timetable construction problems}},
1967	Volume = {1153},
1968	Year = {1996}}
1969
1970@book{Fischetti2010,
1971	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.},
1972	Address = {Boston, MA},
1973	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},
1974	Author = {Fischetti, Matteo and Lodi, Andrea and Salvagnin, Domenico},
1975	Doi = {10.1007/978-1-4419-1306-7},
1976	Editor = {Maniezzo, Vittorio and St{\"u}tzle, Thomas and Vo{\ss}, Stefan},
1977	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi, Salvagnin - 2010 - Matheuristics.pdf:pdf},
1978	Isbn = {978-1-4419-1305-0},
1979	Pages = {39--70},
1980	Publisher = {Springer US},
1981	Series = {{Annals of Information Systems}},
1982	Title = {{Matheuristics}},
1983	Url = {http://www.springerlink.com/index/10.1007/978-1-4419-1306-7},
1984	Volume = {10},
1985	Year = {2010},
1986	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/978-1-4419-1306-7},
1987	Bdsk-Url-2 = {https://doi.org/10.1007/978-1-4419-1306-7}}
1988
1989@article{Balas1993,
1990	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},
1991	Author = {Balas, Egon and Ceria, Sebasti{\'a}n and Cornu{\'e}jols, G{\'e}rard},
1992	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},
1993	Journal = {Mathematical Programming},
1994	Keywords = {Cutting planes, disjunctive programming, mixed 0-1 programming, projection},
1995	Number = {1-3},
1996	Pages = {295--324},
1997	Title = {{A lift-and-project cutting plane algorithm for mixed 0-1 programs}},
1998	Volume = {58},
1999	Year = {1993}}
2000
2001@article{Koulamas1994,
2002	Author = {Koulamas, C and Antony, S and Jaen, R},
2003	Doi = {10.1016/0305-0483(94)90006-X},
2004	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},
2005	Issn = {03050483},
2006	Journal = {Omega},
2007	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},
2008	Month = {jan},
2009	Number = {1},
2010	Pages = {41--56},
2011	Title = {{A survey of simulated annealing applications to operations research problems}},
2012	Url = {http://linkinghub.elsevier.com/retrieve/pii/030504839490006X},
2013	Volume = {22},
2014	Year = {1994},
2015	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/030504839490006X},
2016	Bdsk-Url-2 = {https://doi.org/10.1016/0305-0483(94)90006-X}}
2017
2018@article{Dietrich1993,
2019	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},
2020	Author = {Dietrich, B L and Escudero, L F and Chance, F},
2021	Doi = {10.1016/0166-218X(93)90044-O},
2022	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},
2023	Issn = {0166-218X},
2024	Journal = {Discrete Applied Mathematics},
2025	Keywords = {operations research, programming theory},
2026	Number = {2-3},
2027	Pages = {147},
2028	Title = {{Efficient reformulation for 0-1 programs-methods and computational results}},
2029	Volume = {42},
2030	Year = {1993},
2031	Bdsk-Url-1 = {https://doi.org/10.1016/0166-218X(93)90044-O}}
2032
2033@article{Ferland1992,
2034	Author = {Ferland, J.A. and Lavoue, A.},
2035	Journal = {Discrete Applied Mathematics},
2036	Pages = {237--253},
2037	Title = {{Exchange procedures for timetabling problems}},
2038	Year = {1992}}
2039
2040@incollection{Koster2008,
2041	Author = {Koster, A. M. C. A. and Orlowski, S. and Raack, C. and Baier, G. and Engel, T.},
2042	Editor = {Golden, B. and Raghavan, S. and Wasil, E.},
2043	Pages = {1--23},
2044	Publisher = {Springer-Verlag},
2045	Title = {{Single-layer Cuts for Multi-layer Network Design Problems}},
2046	Volume = {44},
2047	Year = {2008}}
2048
2049@techreport{Koch2000,
2050	Author = {Koch, T. and Martin, A. and Voss, S.},
2051	Institution = {Zuse Institute Berlin},
2052	Title = {{SteinLib: An Updated Library on Steiner Tree Problems in Graphs}},
2053	Year = {2000}}
2054
2055@article{Artigues2017,
2056	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.},
2057	Author = {Artigues, Christian},
2058	Doi = {10.1016/j.orl.2017.02.001},
2059	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},
2060	Issn = {01676377},
2061	Journal = {Operations Research Letters},
2062	Keywords = {Non-singular transformations, On/off variables, Relaxation strength, Resource-constrained project scheduling, The linear programming, Time-indexed variables},
2063	Number = {2},
2064	Pages = {154--159},
2065	Publisher = {Elsevier B.V.},
2066	Title = {{On the strength of time-indexed formulations for the resource-constrained project scheduling problem}},
2067	Url = {http://dx.doi.org/10.1016/j.orl.2017.02.001},
2068	Volume = {45},
2069	Year = {2017},
2070	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.orl.2017.02.001}}
2071
2072@article{Hooker1999,
2073	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},
2074	Author = {Hooker, J N and Ottosson, G and Thorsteinsson, E S and Hak-Jin, Kim},
2075	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},
2076	Isbn = {0 262 51106 1},
2077	Journal = {Proceedings Sixteenth National Conference on Artificial Intelligence (AAAI-99). Eleventh Innovative Applications of Artificial Intelligence Conference (IAAI-99), 18-22 July 1999},
2078	Keywords = {Artificial Intelligence, combinatorial mathematics, constraint handling, integration, linear programming, programming},
2079	Pages = {136},
2080	Pmid = {2693},
2081	Title = {{On integrating constraint propagation and linear programming for combinatorial optimization}},
2082	Url = {g:{\%}5Cpapers{\%}5Cbasic{\%}5C.pdf},
2083	Year = {1999}}
2084
2085@article{Vallsa2005,
2086	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.},
2087	Author = {Vallsa, Vicente and Ballest{\i}́na, Francisco and Quintanillab, Sacramento},
2088	Journal = {European Journal of Operational Research},
2089	Number = {2},
2090	Pages = {375--386},
2091	Title = {{Justification and RCPSP: A technique that pays}},
2092	Volume = {165},
2093	Year = {2005}}
2094
2095@article{Lbbecke2005,
2096	Annote = {From Duplicate 1 (Selected Topics in Column Generation - L{\"u}bbecke, Marco E; Desrosiers, Jacques) NULL},
2097	Author = {L{\"u}bbecke, Marco E. and Desrosiers, Jacques},
2098	Doi = {10.1287/opre.1050.0234},
2099	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/L{\"{u}}bbecke, Desrosiers - 2005 - Selected Topics in Column Generation.pdf:pdf},
2100	Issn = {0030-364X},
2101	Journal = {Operations Research},
2102	Month = {nov},
2103	Number = {6},
2104	Pages = {1007--1023},
2105	Title = {{Selected Topics in Column Generation}},
2106	Url = {http://or.journal.informs.org/cgi/doi/10.1287/opre.1050.0234},
2107	Volume = {53},
2108	Year = {2005},
2109	Bdsk-Url-1 = {http://or.journal.informs.org/cgi/doi/10.1287/opre.1050.0234},
2110	Bdsk-Url-2 = {https://doi.org/10.1287/opre.1050.0234}}
2111
2112@inproceedings{Abramson1992,
2113	Author = {Abramson, D. and Abela, J.},
2114	Title = {{A Parallel Genetic Algorithm for Solving the School Timetabling Problem}},
2115	Year = {1992}}
2116
2117@phdthesis{Achterberg2007-2,
2118	Author = {Achterberg, Tobias},
2119	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Achterberg - 2007 - Constraint Integer Programming.pdf:pdf},
2120	Title = {{Constraint Integer Programming}},
2121	Year = {2007}}
2122
2123@article{Letchford2002-2,
2124	Author = {Letchford, Adam N. and Lodi, Andrea},
2125	Doi = {10.1016/S0167-6377(02)00112-8},
2126	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},
2127	Issn = {01676377},
2128	Journal = {Operations Research Letters},
2129	Keywords = {Cutting planes, Integer programming, Valid inequalities},
2130	Number = {2},
2131	Pages = {74--82},
2132	Title = {{Strengthening Chv{\'a}tal-Gomory cuts and Gomory fractional cuts}},
2133	Volume = {30},
2134	Year = {2002},
2135	Bdsk-Url-1 = {https://doi.org/10.1016/S0167-6377(02)00112-8}}
2136
2137@incollection{Resende2003,
2138	Author = {Resende, M.G.C. and Ribeiro, C.C.},
2139	Pages = {219--249},
2140	Publisher = {Kluwer},
2141	Title = {{Greedy randomized adaptive search procedures}},
2142	Year = {2003}}
2143
2144@article{Pillay2013,
2145	Author = {Pillay, Nelishia},
2146	Doi = {10.1007/s10479-013-1321-8},
2147	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Pillay - 2013 - A survey of school timetabling research.pdf:pdf},
2148	Issn = {0254-5330},
2149	Journal = {Annals of Operations Research},
2150	Keywords = {educational timetabling, school timetabling},
2151	Month = {feb},
2152	Title = {{A survey of school timetabling research}},
2153	Url = {http://link.springer.com/10.1007/s10479-013-1321-8},
2154	Year = {2013},
2155	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10479-013-1321-8},
2156	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-013-1321-8}}
2157
2158@article{Padberg1973,
2159	Author = {Padberg, M.W.},
2160	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Padberg - 1973 - On the facial structure of set packing polyhedra.pdf:pdf},
2161	Journal = {Mathematical Programming},
2162	Month = {dec},
2163	Number = {1},
2164	Pages = {199--215},
2165	Title = {{On the facial structure of set packing polyhedra}},
2166	Volume = {5},
2167	Year = {1973}}
2168
2169@article{Birbas1997,
2170	Author = {Birbas, T. and Daskalaki, S. and Housos, E.},
2171	Journal = {Journal of the Operational Research Society},
2172	Pages = {1191--1200},
2173	Title = {{Timetabling for Greek high schools}},
2174	Volume = {48},
2175	Year = {1997}}
2176
2177@incollection{Lourenco2003,
2178	Address = {Boston},
2179	Author = {Lourenco, H. R. and Martin, O. C. and Stutzle, T.},
2180	Editor = {Glover, F. and Kochenberger, G.},
2181	Publisher = {Kluwer Academic Publishers},
2182	Title = {{Iterated Local Search}},
2183	Year = {2003}}
2184
2185@inproceedings{Burke2008,
2186	Author = {Burke, Edmund K. and Bykov, Yuri},
2187	Booktitle = {{PATAT 2008 Conference, Montreal, Canada}},
2188	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},
2189	Title = {{A late acceptance strategy in hill-climbing for exam timetabling problems}},
2190	Url = {http://www.cs.nott.ac.uk/{~}yxb/LAHC/LAHC-PATAT.pdf},
2191	Year = {2008},
2192	Bdsk-Url-1 = {http://www.cs.nott.ac.uk/%7B~%7Dyxb/LAHC/LAHC-PATAT.pdf}}
2193
2194@article{Aiex2002,
2195	Author = {Aiex, R. M. and Resende, M. G. C. and Ribeiro, C. C.},
2196	Journal = {Journal of Heuristics},
2197	Pages = {343--373},
2198	Title = {{Probability distribuition of solution time in GRASP: an experimental investigation}},
2199	Volume = {8},
2200	Year = {2002}}
2201
2202@article{Johnson1991a,
2203	Author = {Ritchie, Dennis M. and Johnson, Steven C. and Lesk, Michael E. and Kernighan, Brian W.},
2204	File = {:home/haroldo/Documentos/programming/c/The C programming Language - ritchie1978.pdf:pdf},
2205	Journal = {The Bell System Technical Journal},
2206	Number = {6},
2207	Pages = {1991-----2019},
2208	Title = {{Unix time-sharing system: The C programming language}},
2209	Volume = {57},
2210	Year = {1978}}
2211
2212@techreport{Sandholm2006,
2213	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.},
2214	Author = {Sandholm, Tuomas and Shields, Rob},
2215	Booktitle = {{CMU-CS-06-155}},
2216	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Sandholm, Shields - 2006 - Nogood Learning for Mixed Integer Programming.pdf:pdf},
2217	Institution = {School of Computer Science Carnegie Mellon University},
2218	Title = {{Nogood Learning for Mixed Integer Programming}},
2219	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},
2220	Year = {2006}}
2221
2222@article{Atamturk2000,
2223	Author = {Atamt{\"u}rk, A. and Nemhauser, G. L. and Savelsbergh, M. W. P},
2224	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},
2225	Journal = {European Journal of Operational Research},
2226	Pages = {40--55},
2227	Title = {{Conflict graphs in solving integer programming problems}},
2228	Volume = {121},
2229	Year = {2000}}
2230
2231@phdthesis{Mata1989a,
2232	Address = {Rio de Janeiro, Brasil},
2233	Author = {Mata, S.S.},
2234	Title = {{The High School Timetabling Problem: Modeling and Implementation (in portuguese)}},
2235	Year = {1989}}
2236
2237@misc{COIN-OR2013,
2238	Author = {COIN-OR},
2239	Title = {{COIN-OR CBC Developers Team}},
2240	Url = {https://projects.coin-or.org/Cbc/wiki/CbcTeam},
2241	Year = {2013},
2242	Bdsk-Url-1 = {https://projects.coin-or.org/Cbc/wiki/CbcTeam}}
2243
2244@book{Souza2017,
2245	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.},
2246	Author = {Souza, D.S. and Santos, H.G. and Coelho, I.M. and Araujo, J.A.S.},
2247	Booktitle = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
2248	Doi = {10.1007/978-3-319-62392-4_10},
2249	Isbn = {9783319623917},
2250	Issn = {16113349},
2251	Keywords = {Binary programming, Ejection chain, Generalized assignment problem, Scatter search, Tabu search},
2252	Title = {{A hybrid CPU-GPU scatter search for large-sized generalized assignment problems}},
2253	Volume = {10404 LNCS},
2254	Year = {2017},
2255	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-62392-4_10}}
2256
2257@incollection{Bergner2011,
2258	Annote = {From Duplicate 1 (Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation - Bergner, Martin; Caprara, Alberto; Furini, Fabio; Malaguti, Enrico; Traversi, Emiliano) NULL},
2259	Author = {Bergner, Martin and Caprara, Alberto and Furini, Fabio and Malaguti, Enrico and Traversi, Emiliano},
2260	Booktitle = {{Integer Programming and Combinatoral Optimization}},
2261	Editor = {G{\"u}nl{\"u}k, Oktay and Woeginger, Gerhard J},
2262	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},
2263	Pages = {39--51},
2264	Publisher = {Springer Berlin Heidelberg},
2265	Title = {{Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation}},
2266	Year = {2011}}
2267
2268@article{Achterberg2016,
2269	Author = {Achterberg, Tobias and {Robert E. Bixby} and Gu, Zonghao and Rothberg, Edward and Weninger, Dieter},
2270	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Achterberg et al. - 2016 - Presolve Reductions in Mixed Integer Programming.pdf:pdf},
2271	Number = {September},
2272	Title = {{Presolve Reductions in Mixed Integer Programming}},
2273	Volume = {44},
2274	Year = {2016}}
2275
2276@article{Lougee-Heimer2003,
2277	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.},
2278	Author = {Lougee-Heimer, R.},
2279	Journal = {IBM Journal of Research and Development},
2280	Number = {1},
2281	Pages = {57--66},
2282	Title = {{The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community}},
2283	Volume = {47},
2284	Year = {2003}}
2285
2286@article{Ochoa2014,
2287	Archiveprefix = {arXiv},
2288	Arxivid = {arXiv:1402.2959v1},
2289	Author = {Ochoa, Gabriela and Verel, Sebastien and Daolio, Fabio and Tomassini, Marco},
2290	Doi = {10.1007/978-3-642-41888-4_9},
2291	Eprint = {arXiv:1402.2959v1},
2292	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},
2293	Isbn = {978-3-642-41887-7},
2294	Journal = {Recent Advances in the Theory and Application of Fitness Landscapes},
2295	Keywords = {basin of attraction, combinatorial optimization, complex networks, fitness landscapes, local optima, nk landscapes, quadratic assignment problem},
2296	Pages = {233--262},
2297	Title = {{Local Optima Networks: A New Model of Combinatorial Fitness Landscapes}},
2298	Url = {http://dx.doi.org/10.1007/978-3-642-41888-4{\_}9},
2299	Volume = {6},
2300	Year = {2014},
2301	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-642-41888-4%7B%5C_%7D9},
2302	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-3-642-41888-4_9}}
2303
2304@article{Hansen2006a,
2305	Annote = {From Duplicate 2 (First vs. best improvement: An empirical study - Hansen, Pierre; Mladenovi{\'c}, Nenad) NULL},
2306	Author = {Hansen, Pierre and Mladenovi{\'c}, Nenad},
2307	Doi = {10.1016/j.dam.2005.05.020},
2308	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Hansen, Mladenovi{\'{c}} - 2006 - First vs. best improvement An empirical study.pdf:pdf},
2309	Issn = {0166218X},
2310	Journal = {Discrete Applied Mathematics},
2311	Keywords = {heuristic, metaheuristic, travelling salesman, variable neighborhood search},
2312	Number = {5},
2313	Pages = {802--817},
2314	Title = {{First vs. best improvement: An empirical study}},
2315	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X05003070},
2316	Volume = {154},
2317	Year = {2006},
2318	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X05003070},
2319	Bdsk-Url-2 = {https://doi.org/10.1016/j.dam.2005.05.020}}
2320
2321@article{Forrest2005,
2322	Author = {Forrest, J. and Lougee-Heimer, R.},
2323	Journal = {INFORMS Tutorials in Operations Research.},
2324	Pages = {257--277},
2325	Title = {{CBC User Guide}},
2326	Year = {2005}}
2327
2328@article{Peng2011,
2329	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.},
2330	Archiveprefix = {arXiv},
2331	Arxivid = {0901.4552},
2332	Author = {Peng, R.D.},
2333	Eprint = {0901.4552},
2334	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Peng - 2011 - Reproducible Research in Computational Science.pdf:pdf},
2335	Journal = {Sience},
2336	Pages = {1226--1227},
2337	Title = {{Reproducible Research in Computational Science}},
2338	Url = {http://arxiv.org/abs/0901.4552},
2339	Volume = {334},
2340	Year = {2011},
2341	Bdsk-Url-1 = {http://arxiv.org/abs/0901.4552}}
2342
2343@article{Fritzen2012-2,
2344	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},
2345	Doi = {10.1016/j.epsr.2012.04.002},
2346	Issn = {03787796},
2347	Journal = {Electric Power Systems Research},
2348	Pages = {55--66},
2349	Publisher = {Elsevier B.V.},
2350	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}},
2351	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
2352	Volume = {90},
2353	Year = {2012},
2354	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0378779612001022},
2355	Bdsk-Url-2 = {https://doi.org/10.1016/j.epsr.2012.04.002}}
2356
2357@article{Gorissen2015,
2358	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.},
2359	Author = {Gorissen, Bram L and Yan{\i}ko{\u g}lu, {\.I}hsan and {Dick Den Hertog}, @bullet},
2360	Doi = {10.1016/j.omega.2014.12.006},
2361	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},
2362	Journal = {Omega},
2363	Pages = {124 -- 137},
2364	Title = {{A Practical Guide to Robust Optimization}},
2365	Volume = {53},
2366	Year = {2015},
2367	Bdsk-Url-1 = {https://doi.org/10.1016/j.omega.2014.12.006}}
2368
2369@article{RainerKolischandArnoSprecher1997,
2370	Author = {{Rainer Kolisch and Arno Sprecher}},
2371	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},
2372	Journal = {European Journal of Operational Research},
2373	Number = {1},
2374	Pages = {205--216},
2375	Title = {{PSPLIB - A project scheduling problem library}},
2376	Url = {http://129.187.106.231/webdata/publikationen/Kolisch-S-96.pdf},
2377	Volume = {96},
2378	Year = {1997},
2379	Bdsk-Url-1 = {http://129.187.106.231/webdata/publikationen/Kolisch-S-96.pdf}}
2380
2381@article{Orlowski2010,
2382	Author = {Orlowski, S. and Wess{\"a}ly, R. and Pi{\'o}ro, M. and Tomaszewski, A.},
2383	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Orlowski et al. - 2010 - SNDlib 1.0 - Survivable Network Design Library.pdf:pdf},
2384	Journal = {Networks},
2385	Number = {3},
2386	Pages = {276-----286},
2387	Title = {{SNDlib 1.0 - Survivable Network Design Library}},
2388	Volume = {55},
2389	Year = {2010}}
2390
2391@article{Schaerf1999a,
2392	Author = {Schaerf, A.},
2393	Journal = {Artificial Intelligence Review},
2394	Number = {2},
2395	Pages = {87--127},
2396	Title = {{A Survey of Automated Timetabling}},
2397	Volume = {13},
2398	Year = {1999}}
2399
2400@article{Dunning2015,
2401	Author = {Dunning, Iain and Huchette, Joey and Lubin, Miles},
2402	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Dunning, Huchette, Lubin - 2015 - JuMP A Modeling Language for Mathematical Optimization.pdf:pdf},
2403	Journal = {SIAM Review},
2404	Number = {2},
2405	Pages = {295--320},
2406	Title = {{JuMP: A Modeling Language for Mathematical Optimization}},
2407	Volume = {59},
2408	Year = {2017}}
2409
2410@article{Fischetti2014,
2411	Author = {Fischetti, M. and Monaci, M.},
2412	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Monaci - 2014 - Exploiting Erraticism in Search.pdf:pdf},
2413	Journal = {Operations Research},
2414	Number = {1},
2415	Pages = {114--122},
2416	Title = {{Exploiting Erraticism in Search}},
2417	Volume = {62},
2418	Year = {2014}}
2419
2420@techreport{Achterberg2011,
2421	Author = {Achterberg, T. and Berthold, T. and Hendel, G.},
2422	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},
2423	Institution = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin},
2424	Number = {July},
2425	Title = {{Rounding and Propagation Heuristics for Mixed Integer Programming}},
2426	Volume = {29},
2427	Year = {2011}}
2428
2429@article{Daskalaki2004a,
2430	Author = {Daskalaki, S.},
2431	Journal = {European Journal of Operational Research},
2432	Pages = {117--135},
2433	Title = {{An integer progamming formulation for a case study in university timetabling}},
2434	Volume = {153},
2435	Year = {2004}}
2436
2437@article{Souza2004,
2438	Author = {Souza, M.J.F. and Cardoso, L.X.T. and Silva, G.P. and Rodrigues, M.M.S. and Mapa, S.M.S.},
2439	Journal = {Tend{\^e}ncias em Matem{\'a}tica Aplicada e Computacional},
2440	Pages = {357--368},
2441	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}},
2442	Volume = {5},
2443	Year = {2004}}
2444
2445@article{Herroelen1998,
2446	Author = {Herroelen, Willy and {De Reyck}, Bert and Demeulemeester, Erik},
2447	Doi = {10.1016/S0305-0548(97)00055-5},
2448	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},
2449	Issn = {03050548},
2450	Journal = {Computers {\&} Operations Research},
2451	Month = {apr},
2452	Number = {4},
2453	Pages = {279--302},
2454	Title = {{Resource-constrained project scheduling: A survey of recent developments}},
2455	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054897000555},
2456	Volume = {25},
2457	Year = {1998},
2458	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054897000555},
2459	Bdsk-Url-2 = {https://doi.org/10.1016/S0305-0548(97)00055-5}}
2460
2461@misc{CenterforHistoryandNewMedia-2,
2462	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.},
2463	Author = {{Center for History and New Media}},
2464	Title = {{Guia de In{\{}{\'\i}{\}}cio R{\{}{\'a}{\}}pido}},
2465	Url = {http://zotero.org/support/quick{\%}7B{\_}{\%}7Dstart{\%}7B{\_}{\%}7Dguide}}
2466
2467@phdthesis{Eso1999a,
2468	Annote = {From Duplicate 1 (Parallel branch and cut for set partitioning - Eso, Marta) NULL},
2469	Author = {Eso, Marta},
2470	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Eso - 1999 - Parallel branch-and-cut for set partitioning.pdf:pdf},
2471	School = {Cornell},
2472	Title = {{Parallel branch and cut for set partitioning}},
2473	Year = {1999}}
2474
2475@article{Lawrie1969,
2476	Author = {Lawrie, N.L.},
2477	Journal = {Computer Journal},
2478	Pages = {307--316},
2479	Title = {{An integer linear programming model of a school timetabling problem}},
2480	Volume = {12},
2481	Year = {1969}}
2482
2483@article{Schaerf1999,
2484	Author = {Schaerf, A.},
2485	Journal = {IEEE Transactions on Systems, Man and Cybernetics Part A:systems and Humans},
2486	Month = {jul},
2487	Number = {4},
2488	Pages = {368--377},
2489	Title = {{Local search techniques for large high school timetabling problems}},
2490	Volume = {29},
2491	Year = {1999}}
2492
2493@incollection{Birattari2007,
2494	Address = {Boston, MA},
2495	Author = {Birattari, Mauro and Balaprakash, Prasanna and Dorigo, Marco},
2496	Chapter = {The ACO/F-},
2497	Doi = {10.1007/978-0-387-71921-4_10},
2498	Editor = {Doerner, Karl F and Gendreau, Michel and Greistorfer, Peter and Gutjahr, Walter and Hartl, Richard F and Reimann, Marc},
2499	Isbn = {978-0-387-71921-4},
2500	Pages = {189--203},
2501	Publisher = {Springer US},
2502	Title = {{Metaheuristics: Progress in Complex Systems Optimization}},
2503	Url = {http://dx.doi.org/10.1007/978-0-387-71921-4{\_}10},
2504	Year = {2007},
2505	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-0-387-71921-4%7B%5C_%7D10},
2506	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-0-387-71921-4_10}}
2507
2508@article{Achterberg2006,
2509	Author = {Achterberg, T. and Koch, T. and Martin, A.},
2510	Journal = {Operations Research Letters},
2511	Number = {4},
2512	Pages = {1--12},
2513	Title = {{MIPLIB 2003}},
2514	Volume = {34},
2515	Year = {2006}}
2516
2517@article{Boschetti2007-2,
2518	Author = {Boschetti, Marco and Maniezzo, Vittorio},
2519	Doi = {10.1007/s10732-007-9064-9},
2520	Issn = {1381-1231},
2521	Journal = {Journal of Heuristics},
2522	Keywords = {benders, combinatorial optimization, decomposition, lagrangean relaxation, metaheuristic, s},
2523	Number = {3},
2524	Pages = {283--312},
2525	Title = {{Benders decomposition, Lagrangean relaxation and metaheuristic design}},
2526	Url = {http://link.springer.com/10.1007/s10732-007-9064-9},
2527	Volume = {15},
2528	Year = {2007},
2529	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-007-9064-9},
2530	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-007-9064-9}}
2531
2532@article{Bixby2002,
2533	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},
2534	Author = {Bixby, Robert E.},
2535	Doi = {10.1287/opre.50.1.3.17780},
2536	File = {:home/haroldo/Documentos/LinearProgramming/history/solving real-world linear programs$\backslash$: a decade and more of progress.pdf:pdf},
2537	Issn = {0030364X},
2538	Journal = {Operations Research},
2539	Number = {1},
2540	Pages = {3--15},
2541	Title = {{Solving real-world linear programs: A decade and more of progress}},
2542	Volume = {50},
2543	Year = {2002},
2544	Bdsk-Url-1 = {https://doi.org/10.1287/opre.50.1.3.17780}}
2545
2546@article{Andrade2017,
2547	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.},
2548	Author = {Andrade, Carlos E. and Ahmed, Shabbir and Nemhauser, George L. and Shao, Yufen},
2549	Doi = {10.1016/j.ejor.2017.05.003},
2550	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},
2551	Issn = {03772217},
2552	Journal = {European Journal of Operational Research},
2553	Keywords = {Feasibility, Integer programming, Primal heuristics},
2554	Number = {1},
2555	Pages = {62--71},
2556	Publisher = {Elsevier B.V.},
2557	Title = {{A hybrid primal heuristic for finding feasible solutions to mixed integer programs}},
2558	Volume = {263},
2559	Year = {2017},
2560	Bdsk-Url-1 = {https://doi.org/10.1016/j.ejor.2017.05.003}}
2561
2562@inproceedings{Caldeira1997,
2563	Address = {Toronto},
2564	Author = {Caldeira, J. and Agostinho, C.},
2565	Pages = {115--122},
2566	Title = {{School Timetabling Using Genetic Search}},
2567	Year = {1997}}
2568
2569@misc{Kendall2013,
2570	Author = {Kendall, G. and McCollum, B. and Berghe, G.V.},
2571	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kendall, McCollum, Berghe - 2013 - MISTA 2013 Challenge.pdf:pdf},
2572	Title = {{MISTA 2013 Challenge}},
2573	Url = {http://allserv.kahosl.be/mista2013challenge/},
2574	Year = {2013},
2575	Bdsk-Url-1 = {http://allserv.kahosl.be/mista2013challenge/}}
2576
2577@article{Burke2011,
2578	Author = {Burke, E.L. and Mare$\backslash$vcek, K. and Parkes, A. J. and Rudov{\'a}, H.},
2579	Doi = {10.1007/s10479-010-0828-5},
2580	Journal = {Ann. Oper. Res.},
2581	Pages = {1--17},
2582	Title = {{A Branch-and-cut Procedure for the Udine Course Timetabling Problem}},
2583	Url = {http://cs.nott.ac.uk/ jxm/timetabling/patat2008-paper.pdf},
2584	Year = {2011},
2585	Bdsk-Url-1 = {http://cs.nott.ac.uk/%20jxm/timetabling/patat2008-paper.pdf},
2586	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-010-0828-5}}
2587
2588@article{Yagiura2006-2,
2589	Author = {Yagiura, Mutsunori and Kishida, Masahiro and Ibaraki, Toshihide},
2590	Doi = {10.1016/j.ejor.2004.10.018},
2591	Issn = {03772217},
2592	Journal = {European Journal of Operational Research},
2593	Keywords = {lagrangian relaxation, large neighborhood, metaheuristics, set covering problem, strategic oscillation},
2594	Number = {2},
2595	Pages = {472--499},
2596	Title = {{A 3-flip neighborhood local search for the set covering problem}},
2597	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
2598	Volume = {172},
2599	Year = {2006},
2600	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704008264},
2601	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2004.10.018}}
2602
2603@article{Santos2013-2,
2604	Author = {Santos, Dorabella and de Sousa, Amaro and Alvelos, Filipe},
2605	Doi = {10.1016/j.cor.2013.05.006},
2606	Issn = {03050548},
2607	Journal = {Computers {\&} Operations Research},
2608	Keywords = {Column generation, Hybrid meta-heuristics, Network load balancing, grasp with path relinking},
2609	Pages = {1--12},
2610	Publisher = {Elsevier},
2611	Title = {{A hybrid column generation with GRASP and path relinking for the network load balancing problem}},
2612	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
2613	Year = {2013},
2614	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054813001354},
2615	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2013.05.006}}
2616
2617@inproceedings{Kezunovic2009,
2618	Author = {Kezunovic, M. and Guan, Yufan},
2619	Booktitle = {{HICSS '09. 42nd Hawaii International Conference on System Sciences}},
2620	Doi = {10.1109/HICSS.2009.268},
2621	Pages = {1--8},
2622	Title = {{Intelligent Alarm Processing: From Data Intensive to Information Rich}},
2623	Year = {2009},
2624	Bdsk-Url-1 = {https://doi.org/10.1109/HICSS.2009.268}}
2625
2626@article{Monaci2006-2,
2627	Author = {Monaci, Michele and Toth, Paolo},
2628	Doi = {10.1287/ijoc.1040.0089},
2629	Issn = {1091-9856},
2630	Journal = {INFORMS Journal on Computing},
2631	Keywords = {column genera-, heuristics, set-covering, tion, two-constraint bin packing, two-dimensional bin packing},
2632	Number = {1},
2633	Pages = {71--85},
2634	Title = {{A set-covering-based heuristic approach for bin-packing problems}},
2635	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1040.0089 http://joc.journal.informs.org/content/18/1/71.short},
2636	Volume = {18},
2637	Year = {2006},
2638	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},
2639	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1040.0089}}
2640
2641@techreport{Danna2003a,
2642	Author = {Danna, E. and Rothberg, E. and {Le Pape}, C.},
2643	Institution = {ILOG},
2644	Title = {{Exploring relaxation induced neighborhoods to improve MIP solutions}},
2645	Year = {2003}}
2646
2647@article{Lewis2007,
2648	Author = {Lewis, R. and Paechter, B. and McCollum, B.},
2649	Journal = {Working paper, available at: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.63.5962{\&}rep=rep1{\&}type=pdf},
2650	Title = {{Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition}},
2651	Year = {2007}}
2652
2653@article{Asta2015,
2654	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.},
2655	Author = {Asta, Shahriar and {\"O}zcan, Ender},
2656	Doi = {10.1016/j.ins.2014.12.020},
2657	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},
2658	Issn = {00200255},
2659	Journal = {Information Sciences},
2660	Keywords = {Algorithm selection, Data science, Hyper-heuristic, Machine learning, Move acceptance, Tensor analysis},
2661	Pages = {412--432},
2662	Publisher = {Elsevier Inc.},
2663	Title = {{A tensor-based selection hyper-heuristic for cross-domain heuristic search}},
2664	Url = {http://www.sciencedirect.com/science/article/pii/S0020025514011591},
2665	Volume = {299},
2666	Year = {2015},
2667	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0020025514011591},
2668	Bdsk-Url-2 = {https://doi.org/10.1016/j.ins.2014.12.020}}
2669
2670@article{Bischl2016,
2671	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.},
2672	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bischl et al. - 2016 - ASlib A benchmark library for algorithm selection.pdf:pdf},
2673	Journal = {Artificial Intelligence},
2674	Pages = {41--58},
2675	Title = {{ASlib: A benchmark library for algorithm selection}},
2676	Volume = {237},
2677	Year = {2016}}
2678
2679@misc{TheMendeleySupportTeam2011,
2680	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.},
2681	Address = {London},
2682	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 ) },
2683	Author = {{The Mendeley Support Team}},
2684	Booktitle = {{Mendeley Desktop}},
2685	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/The Mendeley Support Team - 2011 - Getting Started with Mendeley.pdf:pdf},
2686	Keywords = {Mendeley, how-to, user manual},
2687	Pages = {1--16},
2688	Publisher = {Mendeley Ltd.},
2689	Title = {{Getting Started with Mendeley}},
2690	Url = {http://www.mendeley.com},
2691	Year = {2011},
2692	Bdsk-Url-1 = {http://www.mendeley.com}}
2693
2694@article{Daskalaki2004,
2695	Author = {Daskalaki, S. and Birbas, T. and Housos, E.},
2696	Doi = {10.1016/S0377-2217(03)00103-6},
2697	Issn = {0377-2217},
2698	Journal = {European Journal of Operational Research},
2699	Keywords = {Timetabling},
2700	Mendeley-Tags = {Timetabling},
2701	Number = {1},
2702	Pages = {117--135},
2703	Title = {{An integer programming formulation for a case study in university timetabling}},
2704	Volume = {153},
2705	Year = {2004},
2706	Bdsk-Url-1 = {https://doi.org/10.1016/S0377-2217(03)00103-6}}
2707
2708@book{MichaelD.Meyer2009,
2709	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.},
2710	Edition = {3},
2711	Editor = {{Michael D. Meyer}},
2712	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - 2009 - Transportation Planning Handbook.pdf:pdf},
2713	Isbn = {1-933452-44-7},
2714	Pages = {1043},
2715	Publisher = {Institute of Transportation Engineers},
2716	Title = {{Transportation Planning Handbook}},
2717	Year = {2009}}
2718
2719@article{Xy2003,
2720	Author = {Xy, J. and Li, M. and Kim, D. and Xu, Y.},
2721	Journal = {Journal of Bioinformatics and Computational Biology},
2722	Number = {1},
2723	Pages = {95--117},
2724	Title = {{RAPTOR: optimal protein threading by linear programming}},
2725	Volume = {1},
2726	Year = {2003}}
2727
2728@article{Fischetti2009,
2729	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.},
2730	Author = {Fischetti, Matteo and Salvagnin, Domenico},
2731	Doi = {10.1007/s12532-009-0007-3},
2732	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2009 - Feasibility pump 2.0.pdf:pdf},
2733	Isbn = {1867-2949},
2734	Issn = {18672949},
2735	Journal = {Mathematical Programming Computation},
2736	Keywords = {Constraint programming, Constraint propagation, Mixed-integer programming, Primal heuristics},
2737	Number = {2-3},
2738	Pages = {201--222},
2739	Title = {{Feasibility pump 2.0}},
2740	Volume = {1},
2741	Year = {2009},
2742	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-009-0007-3}}
2743
2744@book{Grotschel1993,
2745	Author = {Grotschel, M. and Lovasz, L. and Schrijver, A.},
2746	Publisher = {Springer},
2747	Title = {{Geometric Algorithms and Combinatorial Optimization}},
2748	Year = {1993}}
2749
2750@inproceedings{Ceschia2014,
2751	Address = {York},
2752	Author = {Ceschia, S. and Thi, N. and Causmaecker, D.P.},
2753	Booktitle = {{Proceedings of 10th International Conference on the Practice and Theory of Automated Timetabing}},
2754	Editor = {{Ender {\"O}zcan, Edmund K. Burke}, Barry McCollum},
2755	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ceschia, Thi, Causmaecker - 2014 - The second International Nurse Rostering Competition.pdf:pdf},
2756	Pages = {554--556},
2757	Title = {{The second International Nurse Rostering Competition}},
2758	Year = {2014}}
2759
2760@article{Pecin2017,
2761	Author = {Pecin, D. and Pessoa, A. and Poggi, M. and Uchoa, E. and Santos, H.},
2762	Journal = {Operations Research Letters},
2763	Keywords = {Branch-cut-and-price algorithms, Polyhedral combinatorics, Set Partitioning},
2764	Number = {3},
2765	Pages = {206--209},
2766	Title = {{Limited memory Rank-1 Cuts for Vehicle Routing Problems}},
2767	Volume = {45},
2768	Year = {2017}}
2769
2770@article{Doig1960,
2771	Author = {Doig, A. H. Land and G., A.},
2772	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Doig - 1960 - An Automatic Method of Solving Discrete Programming Problems.pdf:pdf},
2773	Journal = {Econometrica},
2774	Number = {3},
2775	Pages = {497--520},
2776	Title = {{An Automatic Method of Solving Discrete Programming Problems}},
2777	Volume = {28},
2778	Year = {1960}}
2779
2780@article{Atamtrk2002,
2781	Author = {Atamt{\"u}rk, Alper},
2782	Doi = {10.1007/s101070100284},
2783	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Atamt{\"{u}}rk - 2002 - On capacitated network design cut-set polyhedra.pdf:pdf},
2784	Isbn = {1010701002},
2785	Issn = {0025-5610},
2786	Journal = {Mathematical Programming},
2787	Keywords = {facets, multicommodity flows, network design},
2788	Month = {may},
2789	Number = {3},
2790	Pages = {425--437},
2791	Title = {{On capacitated network design cut-set polyhedra}},
2792	Url = {http://link.springer.com/10.1007/s101070100284},
2793	Volume = {92},
2794	Year = {2002},
2795	Bdsk-Url-1 = {http://link.springer.com/10.1007/s101070100284},
2796	Bdsk-Url-2 = {https://doi.org/10.1007/s101070100284}}
2797
2798@article{Awadallah2017,
2799	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.},
2800	Author = {Awadallah, Mohammed A. and Al-Betar, Mohammed Azmi and Khader, Ahamad Tajudin and Bolaji, Asaju Laaro and Alkoffash, Mahmud},
2801	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},
2802	Issn = {09410643},
2803	Journal = {Neural Computing and Applications},
2804	Keywords = {Harmony search, Hill climbing, Metaheuristic, Nurse rostering, Particle swarm optimization},
2805	Number = {3},
2806	Pages = {463--482},
2807	Publisher = {Springer London},
2808	Title = {{Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem}},
2809	Volume = {28},
2810	Year = {2017}}
2811
2812@article{Kochenberger2004,
2813	Author = {Kochenberger, Gary a. and Glover, Fred and Alidaee, Bahram and Rego, Cesar},
2814	Doi = {10.1007/s00291-003-0153-3},
2815	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},
2816	Issn = {0171-6468},
2817	Journal = {OR Spectrum},
2818	Keywords = {combinatorial optimization, integer programming, metaheuristics},
2819	Month = {mar},
2820	Number = {2},
2821	Pages = {237--250},
2822	Title = {{A unified modeling and solution framework for combinatorial optimization problems}},
2823	Url = {http://link.springer.com/10.1007/s00291-003-0153-3},
2824	Volume = {26},
2825	Year = {2004},
2826	Bdsk-Url-1 = {http://link.springer.com/10.1007/s00291-003-0153-3},
2827	Bdsk-Url-2 = {https://doi.org/10.1007/s00291-003-0153-3}}
2828
2829@article{Blazewicz1983,
2830	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.},
2831	Author = {Blazewicz, J. and Lenstra, J. K. and Kan, A. H.G.R.},
2832	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},
2833	Isbn = {0166-218X},
2834	Issn = {0166218X},
2835	Journal = {Discrete Applied Mathematics},
2836	Number = {1},
2837	Pages = {11--24},
2838	Title = {{Scheduling subject to resource constraints: classification and complexity}},
2839	Volume = {5},
2840	Year = {1983}}
2841
2842@article{Ochoa,
2843	Author = {Ochoa, Gabriela and Tomassini, Marco},
2844	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ochoa, Tomassini - Unknown - Local Optima Networks of NK Landscapes.pdf:pdf},
2845	Title = {{Local Optima Networks of NK Landscapes}}}
2846
2847@article{Bilal2013,
2848	Author = {Bilal, Nehme and Galinier, Philippe and Guibault, Francois},
2849	Doi = {10.1155/2013/203032},
2850	Issn = {2314-6397},
2851	Journal = {ISRN Operations Research},
2852	Pages = {1--10},
2853	Title = {{A New Formulation of the Set Covering Problem for Metaheuristic Approaches}},
2854	Url = {http://www.hindawi.com/isrn/or/2013/203032/},
2855	Volume = {2013},
2856	Year = {2013},
2857	Bdsk-Url-1 = {http://www.hindawi.com/isrn/or/2013/203032/},
2858	Bdsk-Url-2 = {https://doi.org/10.1155/2013/203032}}
2859
2860@article{Gamrath2013,
2861	Author = {Gamrath, Gerald and Koch, Thorsten and Martin, Alexander and Miltenberger, Matthias and Weninger, Dieter},
2862	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath et al. - 2015 - Progress in Presolving for Mixed Integer Programming.pdf:pdf},
2863	Journal = {Mathematical Programming Computation},
2864	Pages = {367--398},
2865	Title = {{Progress in Presolving for Mixed Integer Programming}},
2866	Volume = {7},
2867	Year = {2015}}
2868
2869@article{Benoist2011,
2870	Author = {Benoist, Thierry and Estellon, Bertrand and Gardi, Fr{\'e}d{\'e}ric and Megel, Romain and Nouioua, Karim},
2871	Doi = {10.1007/s10288-011-0165-9},
2872	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},
2873	Issn = {1619-4500},
2874	Journal = {4OR},
2875	Month = {mar},
2876	Number = {3},
2877	Pages = {299--316},
2878	Title = {{LocalSolver 1.x: a black-box local-search solver for 0-1 programming}},
2879	Url = {http://link.springer.com/10.1007/s10288-011-0165-9},
2880	Volume = {9},
2881	Year = {2011},
2882	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10288-011-0165-9},
2883	Bdsk-Url-2 = {https://doi.org/10.1007/s10288-011-0165-9}}
2884
2885@techreport{Kingston2013,
2886	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.},
2887	Author = {Kingston, J. H.},
2888	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Kingston - 2013 - The KHE High School Timetabling Engine.pdf:pdf},
2889	Institution = {University of Sydney},
2890	Number = {April},
2891	Title = {{The KHE High School Timetabling Engine}},
2892	Url = {http://sydney.edu.au/engineering/it/{~}jeff/khe/khe{\_}guide-2013{\_}04{\_}12.pdf},
2893	Year = {2013},
2894	Bdsk-Url-1 = {http://sydney.edu.au/engineering/it/%7B~%7Djeff/khe/khe%7B%5C_%7Dguide-2013%7B%5C_%7D04%7B%5C_%7D12.pdf}}
2895
2896@article{Read2016,
2897	Author = {Read, Jesse and Reutemann, P and Pfahringer, Bernhard and Holmes, Geoff},
2898	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},
2899	Journal = {Journal of Machine Learning Research},
2900	Pages = {1--5},
2901	Title = {{MEKA: A Multi-label/Multi-target extension to WEKA}},
2902	Volume = {17},
2903	Year = {2016}}
2904
2905@article{Santos2012,
2906	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.},
2907	Author = {Santos, Haroldo Gambini and Uchoa, Eduardo and Ochi, Luiz Satoru and Maculan, Nelson},
2908	Doi = {10.1007/s10479-010-0709-y},
2909	Issn = {02545330},
2910	Journal = {Annals of Operations Research},
2911	Keywords = {column generation, cut generation, integer programming, timetabling},
2912	Number = {1},
2913	Pages = {399--412},
2914	Publisher = {Springer Netherlands},
2915	Title = {{Strong bounds with cut and column generation for class-teacher timetabling}},
2916	Url = {http://www.springerlink.com/index/10.1007/s10479-010-0709-y},
2917	Volume = {194},
2918	Year = {2012},
2919	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10479-010-0709-y},
2920	Bdsk-Url-2 = {https://doi.org/10.1007/s10479-010-0709-y}}
2921
2922@article{Baptiste2004,
2923	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.},
2924	Author = {Baptiste, P. and Demassey, S.},
2925	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Baptiste, Demassey - 2004 - Tight LP bounds for resourtce constrained project scheduling.pdf:pdf},
2926	Journal = {OR Spectrum},
2927	Keywords = {Branch an, Resource constrained project scheduling},
2928	Number = {2},
2929	Pages = {251--262},
2930	Title = {{Tight LP bounds for resourtce constrained project scheduling}},
2931	Volume = {26},
2932	Year = {2004}}
2933
2934@article{Kolisch2006,
2935	Author = {Kolisch, Rainer and Hartmann, S{\"o}nke},
2936	Doi = {10.1016/j.ejor.2005.01.065},
2937	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},
2938	Issn = {03772217},
2939	Journal = {European Journal of Operational Research},
2940	Keywords = {computational evaluation, heuristics, project scheduling, resource constraints},
2941	Month = {oct},
2942	Number = {1},
2943	Pages = {23--37},
2944	Title = {{Experimental investigation of heuristics for resource-constrained project scheduling: An update}},
2945	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705002596},
2946	Volume = {174},
2947	Year = {2006},
2948	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705002596},
2949	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2005.01.065}}
2950
2951@article{Beasley1990,
2952	Author = {Beasley, J.E.},
2953	Journal = {Journal of the Operational Research Society},
2954	Number = {11},
2955	Pages = {1069--1072},
2956	Title = {{OR-Library: distributing test problems by electronic mail}},
2957	Volume = {41},
2958	Year = {1990}}
2959
2960@article{Caprara2000-2,
2961	Author = {Caprara, Alberto and Toth, Paolo and Fischetti, M},
2962	Journal = {Annals of Operations Research},
2963	Pages = {353--371},
2964	Title = {{Algorithms for the set covering problem}},
2965	Url = {http://link.springer.com/article/10.1023/A:1019225027893},
2966	Year = {2000},
2967	Bdsk-Url-1 = {http://link.springer.com/article/10.1023/A:1019225027893}}
2968
2969@inproceedings{Romer2016,
2970	Author = {R{\"o}mer, M. and Mellouli, T.},
2971	Booktitle = {{Proceedings of the 30th European Conference on Modelling and Simulation}},
2972	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},
2973	Keywords = {computational stochastic optimization, lookahead poli-, optimization, personnel scheduling, simula-, tion, uncertainty},
2974	Pages = {502--507},
2975	Title = {{Future Demand Uncertainty In Personnel Scheduling: Investigating Deterministic Lookahead Policies Using Optimization And Simulation.}},
2976	Year = {2016}}
2977
2978@article{Glover2001-2,
2979	Author = {Glover, Fred and Gutin, Gregory and Yeo, Anders and Zverovich, Alexey},
2980	Doi = {10.1016/S0377-2217(99)00468-3},
2981	Issn = {03772217},
2982	Journal = {European Journal of Operational Research},
2983	Keywords = {construction heuristics, heuristics, traveling salesman},
2984	Number = {3},
2985	Pages = {555--568},
2986	Title = {{Construction heuristics for the asymmetric TSP}},
2987	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
2988	Volume = {129},
2989	Year = {2001},
2990	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221799004683},
2991	Bdsk-Url-2 = {https://doi.org/10.1016/S0377-2217(99)00468-3}}
2992
2993@inproceedings{PoggideAragao2003,
2994	Address = {Buzios, Brazil},
2995	Author = {{Poggi de Arag{\~a}o}, M.V. and Uchoa, E.},
2996	Pages = {56--61},
2997	Title = {{Integer program reformulation for robust branch-and-cut-and-price}},
2998	Year = {2003}}
2999
3000@article{Fukasawa2011,
3001	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.},
3002	Author = {Fukasawa, Ricardo and Goycoolea, Marcos},
3003	Doi = {10.1007/s10107-009-0284-7},
3004	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},
3005	Issn = {00255610},
3006	Journal = {Mathematical Programming},
3007	Keywords = {Cutting plane algorithms, Mixed integer knapsack problem, Mixed integer programming},
3008	Number = {1-2},
3009	Pages = {19--41},
3010	Title = {{On the exact separation of mixed integer knapsack cuts}},
3011	Volume = {128},
3012	Year = {2011},
3013	Bdsk-Url-1 = {https://doi.org/10.1007/s10107-009-0284-7}}
3014
3015@article{Kopanos2014,
3016	Author = {Kopanos, Georgios M. and Kyriakidis, Thomas S. and Georgiadis, Michael C.},
3017	Doi = {10.1016/j.compchemeng.2014.05.009},
3018	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},
3019	Issn = {00981354},
3020	Journal = {Computers {\&} Chemical Engineering},
3021	Number = {August 2015},
3022	Pages = {96--106},
3023	Title = {{New continuous-time and discrete-time mathematical formulations for resource-constrained project scheduling problems}},
3024	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0098135414001525},
3025	Volume = {68},
3026	Year = {2014},
3027	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0098135414001525},
3028	Bdsk-Url-2 = {https://doi.org/10.1016/j.compchemeng.2014.05.009}}
3029
3030@article{Silva2015,
3031	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.},
3032	Author = {Silva, Thiago A O and {De Souza}, Mauricio C. and Saldanha, Rodney R. and Burke, Edmund K.},
3033	Doi = {10.1016/j.ejor.2015.04.008},
3034	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},
3035	Issn = {03772217},
3036	Journal = {European Journal of Operational Research},
3037	Keywords = {Mathematical modelling, Relax-and-fix heuristics, Surgical scheduling},
3038	Number = {3},
3039	Pages = {719--730},
3040	Publisher = {Elsevier Ltd.},
3041	Title = {{Surgical scheduling with simultaneous employment of specialised human resources}},
3042	Url = {http://dx.doi.org/10.1016/j.ejor.2015.04.008},
3043	Volume = {245},
3044	Year = {2015},
3045	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.ejor.2015.04.008}}
3046
3047@book{AharonBen-TalLaurentElGhaoui2009,
3048	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.},
3049	Archiveprefix = {arXiv},
3050	Arxivid = {arXiv:1011.1669v3},
3051	Author = {Ben-Tal, A. and Ghaoui, L.E. and Nemirovski, A.},
3052	Eprint = {arXiv:1011.1669v3},
3053	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ben-Tal, Ghaoui, Nemirovski - 2009 - Robust Optimization.pdf:pdf},
3054	Publisher = {Princeton University Press},
3055	Title = {{Robust Optimization}},
3056	Year = {2009}}
3057
3058@article{Avella2005,
3059	Author = {Avella, P. and Vasil'ev, I.},
3060	Journal = {Journal of Scheduling},
3061	Pages = {497--514},
3062	Title = {{A Computational Study of a Cutting Plane Algorithm for University Course Timetabling}},
3063	Volume = {8},
3064	Year = {2005}}
3065
3066@book{Garey1979,
3067	Author = {Garey, Michael R. and Johnson, David S.},
3068	Isbn = {0-7167-1045-5},
3069	Publisher = {W. H. Freeman and Company},
3070	Title = {{Computers and Intractability: A Guide to the Theory of NP-Completeness}},
3071	Year = {1979}}
3072
3073@article{Souza2004-2,
3074	Author = {Souza, M J F and Cardoso, L X T and Silva, G P and Rodrigues, M M S and Mapa, S M S},
3075	Journal = {Tend{\{}{\^e}{\}}ncias em Matem{\{}{\'a}{\}}tica Aplicada e Computacional},
3076	Pages = {357--368},
3077	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}},
3078	Volume = {5},
3079	Year = {2004}}
3080
3081@article{Andreello2007-2,
3082	Author = {Andreello, G. and Caprara, A. and Fischetti, M.},
3083	Doi = {10.1287/ijoc.1050.0162},
3084	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},
3085	Issn = {1091-9856},
3086	Journal = {INFORMS Journal on Computing},
3087	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},
3088	Month = {jan},
3089	Number = {2},
3090	Pages = {229--238},
3091	Title = {{Embedding {\{}0,1/2{\}}-Cuts in a Branch-and-Cut Framework: A Computational Study}},
3092	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
3093	Volume = {19},
3094	Year = {2007},
3095	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1050.0162},
3096	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1050.0162}}
3097
3098@article{Kochetov2008,
3099	Author = {Kochetov, Yuri and Kononova, Polina and Paschenko, Mikhail},
3100	Doi = {10.2298/YUJOR0801001K},
3101	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},
3102	Journal = {Yugoslav Journal of Operations Research},
3103	Keywords = {fss approach, local search, metaheuristics, t imetable design},
3104	Number = {1},
3105	Pages = {1--11},
3106	Title = {{Formulation space search approach for the teacher/class timetabling problem}},
3107	Volume = {18},
3108	Year = {2008},
3109	Bdsk-Url-1 = {https://doi.org/10.2298/YUJOR0801001K}}
3110
3111@article{Saimurugan2011,
3112	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.},
3113	Author = {Saimurugan, M. and Ramachandran, K. I. and Sugumaran, V. and Sakthivel, N. R.},
3114	Doi = {10.1016/j.eswa.2010.09.042},
3115	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},
3116	Issn = {09574174},
3117	Journal = {Expert Systems with Applications},
3118	Keywords = {Decision tree, Fault diagnosis, Shaft and bearings, Support vector machine},
3119	Number = {4},
3120	Pages = {3819--3826},
3121	Publisher = {Elsevier Ltd},
3122	Title = {{Multi component fault diagnosis of rotational mechanical system based on decision tree and support vector machine}},
3123	Url = {http://dx.doi.org/10.1016/j.eswa.2010.09.042},
3124	Volume = {38},
3125	Year = {2011},
3126	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.eswa.2010.09.042}}
3127
3128@article{Bertsimas2017,
3129	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.},
3130	Author = {Bertsimas, D. and Dunn, J.},
3131	Doi = {10.1007/s10994-017-5633-9},
3132	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bertsimas, Dunn - 2017 - Optimal classification trees.pdf:pdf},
3133	Issn = {15730565},
3134	Journal = {Machine Learning},
3135	Keywords = {Classification, Decision trees, Mixed integer optimization},
3136	Number = {7},
3137	Pages = {1039--1082},
3138	Publisher = {Springer US},
3139	Title = {{Optimal classification trees}},
3140	Volume = {106},
3141	Year = {2017},
3142	Bdsk-Url-1 = {https://doi.org/10.1007/s10994-017-5633-9}}
3143
3144@phdthesis{Gamrath2010,
3145	Author = {Gamrath, Gerald},
3146	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath - 2010 - Generic Branch-Cut-and-Price.pdf:pdf},
3147	Pages = {200},
3148	School = {Technischen Universit{\"a}t Berlin},
3149	Title = {{Generic Branch-Cut-and-Price}},
3150	Year = {2010}}
3151
3152@article{Fischetti2011a,
3153	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.},
3154	Author = {Fischetti, Matteo and Salvagnin, Domenico},
3155	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},
3156	Journal = {Mathematical Programming Computation},
3157	Keywords = {Gomory cuts, Lagrangian relaxation, Mixed-integer programming, Relax-and-cut},
3158	Number = {2},
3159	Pages = {79--102},
3160	Title = {{A relax-and-cut framework for gomory mixed-integer cuts}},
3161	Volume = {3},
3162	Year = {2011}}
3163
3164@article{A.AlanB.Pritsker1969,
3165	Author = {{A. Alan B. Pritsker}, Lawrence J. Watters and Wolfe, Philip M.},
3166	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},
3167	Journal = {Management Science},
3168	Number = {1},
3169	Pages = {93--108},
3170	Title = {{Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach}},
3171	Volume = {16},
3172	Year = {1969}}
3173
3174@article{Xu2008,
3175	Author = {Xu, L. and Hutter, F. and Hoos, H.H. and Leyton-Brown, K.},
3176	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Xu et al. - 2008 - SATzilla Portfolio-based algorithm selection for SAT.pdf:pdf},
3177	Issn = {10769757},
3178	Journal = {Journal of Artificial Intelligence Research},
3179	Pages = {565--606},
3180	Title = {{SATzilla: Portfolio-based algorithm selection for SAT}},
3181	Volume = {32},
3182	Year = {2008}}
3183
3184@article{DiGaspero2006,
3185	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.},
3186	Author = {{Di Gaspero}, Luca and Schaerf, Andrea},
3187	Doi = {10.1007/s10852-005-9032-z},
3188	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},
3189	Isbn = {1085200590},
3190	Issn = {15701166},
3191	Journal = {Journal of Mathematical Modelling and Algorithms},
3192	Keywords = {Local search, Neighborhood, Tabu search, Timetabling},
3193	Number = {1},
3194	Pages = {65--89},
3195	Title = {{Neighborhood portfolio approach for local search applied to timetabling problems}},
3196	Volume = {5},
3197	Year = {2006},
3198	Bdsk-Url-1 = {https://doi.org/10.1007/s10852-005-9032-z}}
3199
3200@article{Boland2014,
3201	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.},
3202	Author = {Boland, Natashia L. and Eberhard, Andrew C. and Engineer, Faramroze G. and Fischetti, Matteo and Savelsbergh, Martin W.P. and Tsoukalas, Angelos},
3203	Doi = {10.1007/s12532-014-0068-9},
3204	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Boland et al. - 2014 - Boosting the feasibility pump.pdf:pdf},
3205	Issn = {18672957},
3206	Journal = {Mathematical Programming Computation},
3207	Keywords = {65K05, 90C10, 90C11},
3208	Number = {3},
3209	Pages = {255--279},
3210	Title = {{Boosting the feasibility pump}},
3211	Volume = {6},
3212	Year = {2014},
3213	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-014-0068-9}}
3214
3215@phdthesis{Gomes1982-2,
3216	Author = {Gomes, C M N},
3217	School = {Instituto Militar de Engenharia},
3218	Title = {{An{\{}{\'a}{\}}lise do desempenho operacional de p{\{}{\'a}{\}}tios ferrovi{\{}{\'a}{\}}rios}},
3219	Type = {Disserta{\{}{\c c}{\}}{\{}{\~a}{\}}o de Mestrado},
3220	Year = {1982}}
3221
3222@article{Glover1986,
3223	Author = {Glover, F.},
3224	Journal = {Computers {\&} Operations Research},
3225	Pages = {533--549},
3226	Title = {{Future paths for integer programming and artificial intelligence}},
3227	Volume = {13},
3228	Year = {1986}}
3229
3230@article{Lan2007-2,
3231	Author = {Lan, Guanghui and DePuy, Gail W and Whitehouse, Gary E},
3232	Doi = {10.1016/j.ejor.2005.09.028},
3233	Issn = {03772217},
3234	Journal = {European Journal of Operational Research},
3235	Keywords = {combinatorial optimization, meta-raps, set covering},
3236	Number = {3},
3237	Pages = {1387--1403},
3238	Title = {{An effective and simple heuristic for the set covering problem}},
3239	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
3240	Volume = {176},
3241	Year = {2007},
3242	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221705008313},
3243	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2005.09.028}}
3244
3245@incollection{Glover1997,
3246	Address = {Boston, M.A.},
3247	Author = {Glover, F.},
3248	Editor = {Barr, R.S. and Helgason, R.V. and Kennington, J.L.},
3249	Pages = {1--75},
3250	Publisher = {Kluwer},
3251	Title = {{Tabu search and adaptive memory programming - advances, applications and challenges}},
3252	Year = {1997}}
3253
3254@article{Even1976,
3255	Author = {Even, S. and Itai, A. and Shamir, A.},
3256	Journal = {SIAM Jounal of Computing},
3257	Month = {dec},
3258	Number = {4},
3259	Pages = {691--703},
3260	Title = {{On the complexity of timetable and multicommodity flow problems}},
3261	Volume = {5},
3262	Year = {1976}}
3263
3264@article{Marcotte2014,
3265	Author = {Marcotte, Mounira Groiez; Guy Desaulniers; Odile},
3266	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},
3267	Journal = {INFOR: Information Systems and Operational Research},
3268	Number = {4},
3269	Pages = {185--196},
3270	Title = {{Valid Inequalities and Separation Algorithms for the Set Partitioning Problem}},
3271	Volume = {52},
3272	Year = {2014}}
3273
3274@inproceedings{Lin2009,
3275	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.},
3276	Address = {Austin, Texas},
3277	Author = {Lin, Edward and Cheng, Clark},
3278	Booktitle = {{Winter Simulation Conference}},
3279	Pages = {2532--2541},
3280	Publisher = {Winter Simulation Conference},
3281	Title = {{YardSim: a rail yard simulation framework and its implementation in a major railroad in the U.S.}},
3282	Url = {http://dl.acm.org/citation.cfm?id=1995456.1995801},
3283	Year = {2009},
3284	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=1995456.1995801}}
3285
3286@article{Gutin2000-2,
3287	Author = {Gutin, G and Zverovich, A},
3288	Journal = {submitted for publication},
3289	Title = {{Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP}},
3290	Url = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf},
3291	Year = {2000},
3292	Bdsk-Url-1 = {http://digirep.rhul.ac.uk/file/f600e3ec-5e8c-5846-dee0-39a19b2d962b/4/gutin-evaluation.pdf}}
3293
3294@article{Bilal2014-2,
3295	Author = {Bilal, Nehme and Galinier, Philippe and Guibault, Francois},
3296	Doi = {10.1007/s10732-013-9235-9},
3297	Isbn = {1073201392},
3298	Issn = {1381-1231},
3299	Journal = {Journal of Heuristics},
3300	Keywords = {hybrid heuristics, iterated local search, partial covering, profit maximization, set covering, tabu search},
3301	Month = {jan},
3302	Number = {2},
3303	Pages = {143--164},
3304	Title = {{An iterated-tabu-search heuristic for a variant of the partial set covering problem}},
3305	Url = {http://link.springer.com/10.1007/s10732-013-9235-9 http://link.springer.com/article/10.1007/s10732-013-9235-9},
3306	Volume = {20},
3307	Year = {2014},
3308	Bdsk-Url-1 = {http://link.springer.com/10.1007/s10732-013-9235-9%20http://link.springer.com/article/10.1007/s10732-013-9235-9},
3309	Bdsk-Url-2 = {https://doi.org/10.1007/s10732-013-9235-9}}
3310
3311@inproceedings{Zauk2010,
3312	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},
3313	Booktitle = {{XVIII Congresso Brasileiro de Autom{\{}{\'a}{\}}tica}},
3314	Number = {1995},
3315	Pages = {4538--4544},
3316	Title = {{Programa{\{}{\c c}{\}}{\{}{\~a}{\}}o Inteira Bin{\{}{\'a}{\}}ria Aplicada ao Processamento de Alarmes em Sistemas El{\{}{\'e}{\}}tricos de Pot{\{}{\^e}{\}}ncia}},
3317	Year = {2010}}
3318
3319@article{Fernandez1998,
3320	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.},
3321	Author = {Fernandez, A.A. and Armacost, R.L. and Pet-Edwards, J.J.},
3322	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},
3323	Isbn = {9780769533360},
3324	Issn = {10429247},
3325	Journal = {EMJ - Engineering Management Journal},
3326	Number = {4},
3327	Pages = {5--13},
3328	Title = {{Understanding simulation solutions to resource constrained project scheduling problems with stochastic task durations}},
3329	Volume = {10},
3330	Year = {1998}}
3331
3332@article{Kim2002,
3333	Author = {Kim, Dong-Won and Kim, Kyong-Hee and Jang, Wooseung and {Frank Chen}, F},
3334	Doi = {10.1016/S0736-5845(02)00013-3},
3335	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},
3336	Issn = {07365845},
3337	Journal = {Robotics and Computer-Integrated Manufacturing},
3338	Keywords = {parallel machine scheduling, simulated annealing, total tardiness},
3339	Month = {jun},
3340	Number = {3-4},
3341	Pages = {223--231},
3342	Title = {{Unrelated parallel machine scheduling with setup times using simulated annealing}},
3343	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0736584502000133},
3344	Volume = {18},
3345	Year = {2002},
3346	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0736584502000133},
3347	Bdsk-Url-2 = {https://doi.org/10.1016/S0736-5845(02)00013-3}}
3348
3349@article{Kowalczyk2017,
3350	Author = {Kowalczyk, D. and Leus, R.},
3351	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},
3352	Journal = {Journal of Scheduling},
3353	Keywords = {Branch and price, Coloring, Combinatorial optimization, Parallel machines, Scheduling},
3354	Number = {4},
3355	Pages = {355--372},
3356	Publisher = {Springer US},
3357	Title = {{An exact algorithm for parallel machine scheduling with conflicts}},
3358	Volume = {20},
3359	Year = {2017}}
3360
3361@article{Miller1960,
3362	Author = {Miller, C. E. and Tucker, A. W. and Zemlin, R. A.},
3363	File = {:home/haroldo/Documentos/IntegerProgramming/apps/Integer Programming Formulations of Traveling Salesman Problems.pdf:pdf},
3364	Issn = {1557735X},
3365	Journal = {Journal of the ACM (JACM)},
3366	Number = {4},
3367	Pages = {326--329},
3368	Title = {{Integer Programming Formulation of Traveling Salesman Problems}},
3369	Volume = {7},
3370	Year = {1960}}
3371
3372@article{Hansen2006,
3373	Author = {Hansen, P. and Mladenovi{\'c}, Nenad. and Urosevi{\'c}, D.},
3374	Issn = {0305-0548},
3375	Journal = {Comput. Oper. Res.},
3376	Number = {10},
3377	Pages = {3034--3045},
3378	Title = {{Variable neighborhood search and local branching}},
3379	Volume = {33},
3380	Year = {2006}}
3381
3382@article{Talbot1978,
3383	Author = {Talbot, F. Brian and Patterson, James H.},
3384	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},
3385	Journal = {Management Science},
3386	Number = {11},
3387	Pages = {1163--1174},
3388	Title = {{An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems}},
3389	Url = {http://www.jstor.org/stable/10.2307/2630633},
3390	Volume = {24},
3391	Year = {1978},
3392	Bdsk-Url-1 = {http://www.jstor.org/stable/10.2307/2630633}}
3393
3394@article{Arnaout2009-2,
3395	Author = {Arnaout, Jean-Paul and Rabadi, Ghaith and Musa, Rami},
3396	Doi = {10.1007/s10845-009-0246-1},
3397	Issn = {0956-5515},
3398	Journal = {Journal of Intelligent Manufacturing},
3399	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},
3400	Number = {6},
3401	Pages = {693--701},
3402	Title = {{A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times}},
3403	Url = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
3404	Volume = {21},
3405	Year = {2009},
3406	Bdsk-Url-1 = {http://www.springerlink.com/index/10.1007/s10845-009-0246-1},
3407	Bdsk-Url-2 = {https://doi.org/10.1007/s10845-009-0246-1}}
3408
3409@article{Burke2007,
3410	Author = {Burke, E. K. and McCollum, B. and Meisels, A. and Petrovic, S. and Qu, R.},
3411	Journal = {European Journal of Operational Research},
3412	Month = {jan},
3413	Number = {1},
3414	Pages = {177--192},
3415	Title = {{A graph-based hyper-heuristic for educational timetabling problems}},
3416	Url = {http://ideas.repec.org/a/eee/ejores/v176y2007i1p177-192.html},
3417	Volume = {176},
3418	Year = {2007},
3419	Bdsk-Url-1 = {http://ideas.repec.org/a/eee/ejores/v176y2007i1p177-192.html}}
3420
3421@incollection{Hoos2005,
3422	Author = {Hoos, H. H. and St{\"u}tzle, T.},
3423	Pages = {149--201},
3424	Publisher = {Morgan Kaufmann},
3425	Title = {{Stochastic Local Search: Foundations and Applications}},
3426	Year = {2005}}
3427
3428@article{Balas2008,
3429	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.},
3430	Author = {Balas, Egon and Saxena, Anureet},
3431	Doi = {10.1007/s10107-006-0049-5},
3432	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Balas, Saxena - 2008 - Optimizing over the split closure.pdf:pdf},
3433	Issn = {00255610},
3434	Journal = {Mathematical Programming},
3435	Number = {2},
3436	Pages = {219--240},
3437	Title = {{Optimizing over the split closure}},
3438	Volume = {113},
3439	Year = {2008},
3440	Bdsk-Url-1 = {https://doi.org/10.1007/s10107-006-0049-5}}
3441
3442@article{doi:10.1002/cpe.4967,
3443	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.},
3444	Annote = {e4967 cpe.4967},
3445	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},
3446	Doi = {10.1002/cpe.4967},
3447	Journal = {Concurrency and Computation: Practice and Experience},
3448	Keywords = {Java, distributed computing, distributed shared memory, middleware, parallel computing, task-oriented},
3449	Number = {0},
3450	Pages = {e4967},
3451	Title = {{A general-purpose distributed computing Java middleware}},
3452	Url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4967},
3453	Volume = {0},
3454	Bdsk-Url-1 = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4967},
3455	Bdsk-Url-2 = {https://doi.org/10.1002/cpe.4967}}
3456
3457@article{Ceschia2012,
3458	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.},
3459	Archiveprefix = {arXiv},
3460	Arxivid = {arXiv:1104.2518v1},
3461	Author = {Ceschia, Sara and Gaspero, Luca Di and Schaerf, Andrea},
3462	Eprint = {arXiv:1104.2518v1},
3463	Journal = {Computers {\&} Operations Research},
3464	Keywords = {course timetabling, metaheuristics, simulated annealing},
3465	Number = {7},
3466	Pages = {1615--1624},
3467	Title = {{Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem}},
3468	Volume = {39},
3469	Year = {2012}}
3470
3471@phdthesis{Souza2000-2,
3472	Address = {Rio de Janeiro, Brasil},
3473	Author = {Souza, M.J.F.},
3474	Title = {{Programa$\backslash$cc{\~a}o de Hor{\'a}rios em Escolas: Uma Aproxima$\backslash$cc{\~a}o por Metaheur{\'\i}sticas}},
3475	Year = {2000}}
3476
3477@article{Sadykov2013,
3478	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.},
3479	Author = {Sadykov, Ruslan and Vanderbeck, Fran??ois},
3480	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},
3481	Isbn = {1091-9856},
3482	Issn = {10919856},
3483	Journal = {INFORMS Journal on Computing},
3484	Keywords = {Bin packing, Branch and price, Conflict graphs, Interval graphs, Knapsack},
3485	Number = {2},
3486	Pages = {244--255},
3487	Title = {{Bin packing with conflicts: A generic branch-and-price algorithm}},
3488	Volume = {25},
3489	Year = {2013}}
3490
3491@article{Johnson1991,
3492	Author = {Johnson, David S. and Aragon, Cecilia R. and McGeoch, Lyle a. and Schevon, Catherine},
3493	Doi = {10.1287/opre.39.3.378},
3494	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},
3495	Issn = {0030-364X},
3496	Journal = {Operations Research},
3497	Month = {jun},
3498	Number = {3},
3499	Pages = {378--406},
3500	Title = {{Optimization by Simulated Annealing: An Experimental Evaluation Part II, Graph Coloring and Number Partitioning}},
3501	Url = {http://pubsonline.informs.org/doi/abs/10.1287/opre.39.3.378},
3502	Volume = {39},
3503	Year = {1991},
3504	Bdsk-Url-1 = {http://pubsonline.informs.org/doi/abs/10.1287/opre.39.3.378},
3505	Bdsk-Url-2 = {https://doi.org/10.1287/opre.39.3.378}}
3506
3507@inproceedings{Rosa2009,
3508	Address = {Cuiab{\'a}},
3509	Author = {Rosa, Bruno F and Souza, Marcone J F and {S{\'e}rgio R. de Souza}},
3510	Booktitle = {{Anais do XXXII CNMAC}},
3511	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},
3512	Pages = {930--936},
3513	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}},
3514	Year = {2009}}
3515
3516@article{Feige1996,
3517	Author = {Feige, U. and Kilian, J.},
3518	Journal = {Journal of Computer and System Sciences},
3519	Number = {2},
3520	Pages = {278--287},
3521	Title = {{Zero Knowledge and the Chromatic Number}},
3522	Volume = {57},
3523	Year = {1996}}
3524
3525@article{Drexl2007,
3526	Author = {Drexl, A. and Knust, S.},
3527	Doi = {10.1016/j.omega.2005.08.002},
3528	Issn = {0305-0483},
3529	Journal = {Omega},
3530	Keywords = {Scheduling},
3531	Mendeley-Tags = {Scheduling},
3532	Number = {5},
3533	Pages = {465--471},
3534	Title = {{Sports league scheduling: Graph- and resource-based models}},
3535	Volume = {35},
3536	Year = {2007},
3537	Bdsk-Url-1 = {https://doi.org/10.1016/j.omega.2005.08.002}}
3538
3539@inproceedings{Bykov2013,
3540	Address = {Gent, Belgium},
3541	Author = {Bykov, Yuri and Petrovic, Sanja},
3542	Booktitle = {{MISTA 2013: Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications}},
3543	Editor = {Kendall, Graham and Berghe, Greet Vanden and McCollum, Barry},
3544	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},
3545	Pages = {691--693},
3546	Title = {{An initial study of a novel Step Counting Hill Climbing heuristic applied to timetabling problems}},
3547	Year = {2013}}
3548
3549@article{Zhang2007,
3550	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.},
3551	Author = {Zhang, Min Ling and Zhou, Zhi Hua},
3552	Doi = {10.1016/j.patcog.2006.12.019},
3553	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},
3554	Isbn = {0031-3203},
3555	Issn = {00313203},
3556	Journal = {Pattern Recognition},
3557	Keywords = {Functional genomics, K-nearest neighbor, Lazy learning, Machine learning, Multi-label learning, Natural scene classification, Text categorization},
3558	Number = {7},
3559	Pages = {2038--2048},
3560	Title = {{ML-KNN: A lazy learning approach to multi-label learning}},
3561	Volume = {40},
3562	Year = {2007},
3563	Bdsk-Url-1 = {https://doi.org/10.1016/j.patcog.2006.12.019}}
3564
3565@inproceedings{Marecek2008,
3566	Author = {Marecek, J. and Burke, E. K. and J., Parkes A. and Rudova, H.},
3567	Title = {{A Branch-and-Cut Procedure for the Udine Course Timetabling Problem}},
3568	Year = {2008}}
3569
3570@book{Applegate2006,
3571	Author = {Applegate, D. L. and Bixby, R. E. and Chvatal, V. and Cook, W. J.},
3572	Publisher = {Princeton University Press},
3573	Title = {{The Traveling Salesman Problem: A Computational Study}},
3574	Year = {2006}}
3575
3576@article{Lazic2010,
3577	Author = {Lazi{\'c}, Jasmina and Hanafi, Sa{\"\i}d and Mladenovi{\'c}, Nenad and Uro{\v s}evi{\'c}, Dragan},
3578	Doi = {10.1016/j.cor.2009.09.010},
3579	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},
3580	Issn = {03050548},
3581	Journal = {Computers {\&} Operations Research},
3582	Keywords = {0, 1 mixed integer programming},
3583	Month = {jun},
3584	Number = {6},
3585	Pages = {1055--1067},
3586	Title = {{Variable neighbourhood decomposition search for 0--1 mixed integer programs}},
3587	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002287},
3588	Volume = {37},
3589	Year = {2010},
3590	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809002287},
3591	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2009.09.010}}
3592
3593@book{Wright1997,
3594	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.},
3595	Author = {Wright, Paul H. and Ashford, Norman J. and Stammer, Robert J.},
3596	Edition = {4},
3597	Isbn = {0471173967},
3598	Pages = {688},
3599	Publisher = {Wiley},
3600	Title = {{Transportation engineering: planning and design}},
3601	Year = {1997}}
3602
3603@article{Artigues2013a,
3604	Author = {Artigues, C. and Leus, R. and Nobibon, F. T.},
3605	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},
3606	Journal = {Flexible Services and Manufacturing Journal},
3607	Pages = {175--205},
3608	Title = {{Robust optimization for resource-constrained project scheduling with uncertain activity durations}},
3609	Volume = {25},
3610	Year = {2013}}
3611
3612@inproceedings{Zauk2010-2,
3613	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},
3614	Booktitle = {{XVIII Congresso Brasileiro de Autom{\'a}tica}},
3615	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},
3616	Number = {1995},
3617	Pages = {4538--4544},
3618	Title = {{Programa{\c c}{\~a}o Inteira Bin{\'a}ria Aplicada ao Processamento de Alarmes em Sistemas El{\'e}tricos de Pot{\^e}ncia}},
3619	Year = {2010}}
3620
3621@inproceedings{Fonseca2012,
3622	Address = {Oslo},
3623	Author = {Fonseca, George Henrique Godim and Santos, Haroldo Gambini and Toffolo, T{\'u}lio {\^A}ngelo Machado and Brito, Samuel Souza},
3624	Booktitle = {{Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling}},
3625	Pages = {493--496},
3626	Publisher = {SINTEF},
3627	Title = {{A SA-ILS approach for the High School Timetabling Problem}},
3628	Year = {2012}}
3629
3630@inproceedings{Rosa2009-2,
3631	Address = {Cuiab{\{}{\'a}{\}}},
3632	Author = {Rosa, Bruno F and Souza, Marcone J F and {S{\'e}rgio R. de Souza}},
3633	Booktitle = {{Anais do XXXII CNMAC}},
3634	Pages = {930--936},
3635	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}},
3636	Year = {2009}}
3637
3638@article{Bruni2017,
3639	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.},
3640	Author = {Bruni, M. E. and Pugliese, L.P. and Beraldi, P. and Guerriero, F.},
3641	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},
3642	Journal = {Omega},
3643	Keywords = {Benders decomposition, Project scheduling, Resource constraints, Robust optimization},
3644	Pages = {66--84},
3645	Title = {{An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations}},
3646	Volume = {71},
3647	Year = {2017}}
3648
3649@article{Goncalves2008,
3650	Author = {Gon{\c c}alves, J.F. and Mendes, J.J.M. and Resende, M.G.C.},
3651	Doi = {10.1016/j.ejor.2006.06.074},
3652	Issn = {03772217},
3653	Journal = {European Journal of Operational Research},
3654	Keywords = {genetic algorithm, metaheuristics, project management, scheduling},
3655	Month = {sep},
3656	Number = {3},
3657	Pages = {1171--1190},
3658	Title = {{A genetic algorithm for the resource constrained multi-project scheduling problem}},
3659	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221707005929},
3660	Volume = {189},
3661	Year = {2008},
3662	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221707005929},
3663	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2006.06.074}}
3664
3665@incollection{Orman2007,
3666	Author = {Orman, A.J. and Williams, H.P.},
3667	Pages = {91--104},
3668	Publisher = {Springer Berlin Heidelberg},
3669	Title = {{Optimisation, Econometric and Financial Analysis}},
3670	Year = {2007}}
3671
3672@article{Lancia2004,
3673	Author = {Lancia, Giuseppe},
3674	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Lancia - 2004 - Integer programming models for computational biology problems.pdf:pdf},
3675	Journal = {Journal of Computer Science and Technology},
3676	Number = {1},
3677	Pages = {60--77},
3678	Title = {{Integer programming models for computational biology problems}},
3679	Volume = {19},
3680	Year = {2004}}
3681
3682@article{Papoutsis2003,
3683	Author = {Papoutsis, K. and Valouxis, C. and Housos, E.},
3684	Journal = {Journal of the Operational Research Society},
3685	Pages = {230--238},
3686	Title = {{A column generation approach for the timetabling problem of Greek high schools}},
3687	Volume = {54},
3688	Year = {2003}}
3689
3690@article{Fischetti2000,
3691	Author = {Fischetti, M. and C., Lepschy and Minerva, G. and G., Romanin-Jacur and Toto, E.},
3692	Journal = {European Journal of Operational Research},
3693	Pages = {241--255},
3694	Title = {{Frequency assignment in mobile radio systems using branch-and-cut techniques}},
3695	Volume = {123},
3696	Year = {2000}}
3697
3698@article{Santos2016,
3699	Author = {Santos, Haroldo G. and Toffolo, T{\'u}lio A.M. and Silva, Cristiano L.T.F. and {Vanden Berghe}, Greet},
3700	Doi = {10.1111/itor.12316},
3701	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},
3702	Isbn = {09696016 (ISSN)},
3703	Issn = {09696016},
3704	Journal = {International Transactions in Operational Research},
3705	Keywords = {heuristics, local search, metaheuristics, scheduling},
3706	Month = {jun},
3707	Pages = {1--18},
3708	Title = {{Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem}},
3709	Url = {http://doi.wiley.com/10.1111/itor.12316},
3710	Volume = {00},
3711	Year = {2016},
3712	Bdsk-Url-1 = {http://doi.wiley.com/10.1111/itor.12316},
3713	Bdsk-Url-2 = {https://doi.org/10.1111/itor.12316}}
3714
3715@inproceedings{DiStefano2001,
3716	Address = {London, UK},
3717	Author = {{Di Stefano}, C. and Tettamanzi, A.},
3718	Editor = {{Et al.}, E. Boers},
3719	Pages = {452--462},
3720	Publisher = {Springer-Verlag},
3721	Title = {{An Evolutionary Algorithm for Solving the School Time-Tabling Problem}},
3722	Volume = {2037},
3723	Year = {2001}}
3724
3725@article{Davis1962,
3726	Author = {Davis, Martin and Loveland, Donald},
3727	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Davis, Loveland - 1962 - A Machine Program for Theorem-Provingt.pdf:pdf},
3728	Journal = {Communications of the ACM},
3729	Number = {7},
3730	Pages = {394--397},
3731	Title = {{A Machine Program for Theorem-Provingt}},
3732	Volume = {5},
3733	Year = {1962}}
3734
3735@book{Maniezzo2010,
3736	Author = {Maniezzo, V. and St{\"u}tzle, T. and Voss, S.},
3737	Publisher = {Springer},
3738	Title = {{Matheuristics: Hybridizing Metaheuristics and Mathematical Programming}},
3739	Year = {2010}}
3740
3741@article{Csima1964,
3742	Author = {Csima, J. and Gotlieb, C.C.},
3743	Journal = {Communications of the ACM},
3744	Number = {3},
3745	Pages = {160--163},
3746	Title = {{Tests on a computer method for constructing school timetables}},
3747	Volume = {7},
3748	Year = {1964}}
3749
3750@article{Muter2010-2,
3751	Author = {Muter, I and Birbil, S I and Sahin, G},
3752	Doi = {10.1287/ijoc.1090.0376},
3753	Issn = {1091-9856},
3754	Journal = {INFORMS Journal on Computing},
3755	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},
3756	Number = {4},
3757	Pages = {603--619},
3758	Title = {{Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems}},
3759	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
3760	Volume = {22},
3761	Year = {2010},
3762	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1090.0376},
3763	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1090.0376}}
3764
3765@article{Beasley1987-2,
3766	Author = {Beasley, J E},
3767	Doi = {10.1016/0377-2217(87)90141-X},
3768	Issn = {03772217},
3769	Journal = {European Journal of Operational Research},
3770	Keywords = {optimisation, set covering},
3771	Month = {jul},
3772	Number = {1},
3773	Pages = {85--93},
3774	Title = {{An algorithm for set covering problem}},
3775	Url = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
3776	Volume = {31},
3777	Year = {1987},
3778	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/037722178790141X},
3779	Bdsk-Url-2 = {https://doi.org/10.1016/0377-2217(87)90141-X}}
3780
3781@article{Rasmussen2009,
3782	Author = {Rasmussen, R. V. and Trick, M.A.},
3783	Journal = {Annals of Operations Research},
3784	Pages = {45--59},
3785	Title = {{The timetable constrained distance minimization problem}},
3786	Volume = {171},
3787	Year = {2009}}
3788
3789@inproceedings{Danna2003,
3790	Author = {Danna, E. and Rothberg, E. and {Le Pape}, C.},
3791	Title = {{Integrating Mixed Integer Programming and Local Search: A Case Study on Job-Shop Scheduling Problems}},
3792	Year = {2003}}
3793
3794@article{Chakrabortty2017,
3795	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.},
3796	Author = {Chakrabortty, R.K. and Sarker, R.A. and Essam, D.L.},
3797	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},
3798	Journal = {Computers and Industrial Engineering},
3799	Keywords = {Branch and cut algorithm, Heuristics, RCPSP, Robust optimization, SRCPSP},
3800	Pages = {537--550},
3801	Title = {{Resource constrained project scheduling with uncertain activity durations}},
3802	Volume = {112},
3803	Year = {2017}}
3804
3805@article{Alvarez-Valdes1996,
3806	Author = {Alvarez-Vald{\'e}s, R. and Martin, G. and Tamarit, M.},
3807	Journal = {Journal of the Operational Research Society},
3808	Pages = {1203--1215},
3809	Title = {{Constructing good solutions for the Spanish school timetabling problem}},
3810	Volume = {47},
3811	Year = {1996}}
3812
3813@book{DeMarco2011,
3814	Author = {{De Marco}, Alberto},
3815	Pages = {189},
3816	Publisher = {Springer},
3817	Title = {{Project Management for Facility Construction}},
3818	Year = {2011}}
3819
3820@article{Jonker1987-2,
3821	Author = {Jonker, R and Volgenant, A},
3822	Journal = {Computing},
3823	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},
3824	Pages = {325--340},
3825	Title = {{A shortest augmenting path algorithm for dense and sparse linear assignment problems}},
3826	Url = {http://www.springerlink.com/index/7003M6N54004M004.pdf},
3827	Volume = {340},
3828	Year = {1987},
3829	Bdsk-Url-1 = {http://www.springerlink.com/index/7003M6N54004M004.pdf}}
3830
3831@book{Santos2004,
3832	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.},
3833	Author = {Santos, H.G. and Ochi, L.S. and Souza, M.J.F.},
3834	Booktitle = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
3835	Pages = {468--481},
3836	Title = {{An efficient tabu search heuristic for the school timetabling problem}},
3837	Volume = {3059},
3838	Year = {2004}}
3839
3840@article{Bron1973,
3841	Author = {Bron, C. and Kerbosch, J.},
3842	Doi = {10.1145/362342.362367},
3843	Issn = {0001-0782},
3844	Journal = {Commun. ACM},
3845	Keywords = {backtracking algorithm, branch and bound technique, cliques, clusters, maximal complete subgraphs, recursion},
3846	Mendeley-Tags = {backtracking algorithm,branch and bound technique,cliques,clusters,maximal complete subgraphs,recursion},
3847	Month = {sep},
3848	Number = {9},
3849	Pages = {575--577},
3850	Title = {{Algorithm 457: finding all cliques of an undirected graph}},
3851	Url = {http://doi.acm.org/10.1145/362342.362367},
3852	Volume = {16},
3853	Year = {1973},
3854	Bdsk-Url-1 = {http://doi.acm.org/10.1145/362342.362367},
3855	Bdsk-Url-2 = {https://doi.org/10.1145/362342.362367}}
3856
3857@article{Abramson1991,
3858	Author = {Abramson, D.},
3859	Journal = {Management Science},
3860	Pages = {98--113},
3861	Title = {{Constructing school timetables using simulated annealing: sequential and parallel algorithms}},
3862	Volume = {37},
3863	Year = {1991}}
3864
3865@article{year,
3866	Author = {{J{\"u}nger, M. and Mutzel}, P.},
3867	Journal = {Algorithmica},
3868	Pages = {33--59},
3869	Title = {{Maximum planar subgraphs and nice embeddings: Practical layout tools}},
3870	Volume = {16},
3871	Year = {1996}}
3872
3873@article{Lewis2008,
3874	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.},
3875	Author = {Lewis, Mark and Kochenberger, Gary and Alidaee, Bahram},
3876	Doi = {10.1016/j.cor.2006.04.002},
3877	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},
3878	Issn = {03050548},
3879	Journal = {Computers and Operations Research},
3880	Keywords = {Combinatorial problems, Metaheuristics, Set partitioning},
3881	Number = {3},
3882	Pages = {807--813},
3883	Title = {{A new modeling and solution approach for the set-partitioning problem}},
3884	Volume = {35},
3885	Year = {2008},
3886	Bdsk-Url-1 = {https://doi.org/10.1016/j.cor.2006.04.002}}
3887
3888@article{Fukasawa2006,
3889	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.},
3890	Journal = {Mathematical Programming},
3891	Pages = {491--511},
3892	Title = {{Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem}},
3893	Volume = {106},
3894	Year = {2006}}
3895
3896@article{Brito2015,
3897	Author = {Brito, S.S. and Santos, H.G. and Poggi, M.},
3898	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},
3899	Journal = {Electronic Notes in Discrete Mathematics},
3900	Keywords = {Cliques, Conflict graphs, Cutting planes, Integer programming, Odd-holes},
3901	Pages = {355--360},
3902	Title = {{A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming}},
3903	Volume = {50},
3904	Year = {2015}}
3905
3906@book{Pochet2006,
3907	Author = {Pochet, Y. and Wolsey, L. A.},
3908	Publisher = {Springer},
3909	Title = {{Production Planning by Mixed Integer Programming}},
3910	Year = {2006}}
3911
3912@article{DeGans1981,
3913	Author = {{De Gans}, O.B.},
3914	Journal = {European Journal of Operational Research},
3915	Pages = {175--182},
3916	Title = {{A computer timetabling system for secondary schools in the Netherlands}},
3917	Volume = {7},
3918	Year = {1981}}
3919
3920@article{Drexl1997,
3921	Author = {Drexl, A. and Salewski, F.},
3922	Journal = {European Journal of Operational Research},
3923	Month = {oct},
3924	Number = {1},
3925	Pages = {193--214},
3926	Title = {{Distribution requirements and compactness constraints in school timetabling}},
3927	Volume = {102},
3928	Year = {1997}}
3929
3930@inproceedings{Artigues2013,
3931	Author = {Artigues, C. and Hebrard, E.},
3932	Booktitle = {{MISTA 2013}},
3933	Pages = {815--819},
3934	Title = {{MIP Relaxation and Large Neighborhood Search for a Multi-Mode Resource-Constrained Multi-Project Scheduling Problem}},
3935	Year = {2013}}
3936
3937@article{Barnhart1998,
3938	Author = {Barnhart, C. and Johnson, E. L. and Nemhauser, G. L. and Savelsbergh, M. W. P. and Vance, P. H.},
3939	Journal = {Operations Research},
3940	Pages = {316--329},
3941	Title = {{Branch-and-price: column generation for solving huge integer programs}},
3942	Url = {http://citeseer.ist.psu.edu/barnhart96branchprice.html},
3943	Volume = {46},
3944	Year = {1998},
3945	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/barnhart96branchprice.html}}
3946
3947@inproceedings{Gotlieb1963,
3948	Address = {Amnsterdam},
3949	Author = {Gotlieb, C.C.},
3950	Editor = {Popplewell, C. M.},
3951	Pages = {73--77},
3952	Title = {{The construction of class-teacher timetables}},
3953	Year = {1963}}
3954
3955@incollection{Dash2006,
3956	Annote = {From Duplicate 2 (Valid Inequalities Based on Simple Mixed-Integer Sets - Dash, S; G{\"u}nl{\"u}k, O) NULL},
3957	Author = {Dash, S and G{\"u}nl{\"u}k, O},
3958	Booktitle = {{Integer Programming and Combinatorial Optimization}},
3959	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},
3960	Pages = {33--45},
3961	Title = {{Valid Inequalities Based on Simple Mixed-Integer Sets}},
3962	Volume = {3064},
3963	Year = {2004}}
3964
3965@article{Lorenzoni2006,
3966	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.},
3967	Author = {Lorenzoni, L.L. and Ahonen, H. and Alvarenga, A.G.},
3968	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},
3969	Journal = {Computers and Industrial Engineering},
3970	Keywords = {Attending ships, Differential evolution algorithm, Layday period, Local search, Multi-mode resource-constrained scheduling, Port operations},
3971	Number = {1-2},
3972	Pages = {55--65},
3973	Title = {{A multi-mode resource-constrained scheduling problem in the context of port operations}},
3974	Volume = {50},
3975	Year = {2006}}
3976
3977@book{Bertsekas1999,
3978	Author = {Bertsekas, D. P.},
3979	Publisher = {Athena Scientific},
3980	Title = {{Nonlinear Programming}},
3981	Year = {1999}}
3982
3983@inproceedings{Cambazard2008,
3984	Author = {Cambazard, H. and E., Hebrard and O'Sullivan, B. and Papadopoulos, A.},
3985	Title = {{Local Search and Constraint Programming for the Post Enrolment-based Course Timetabling Problem}},
3986	Year = {2008}}
3987
3988@article{Dantzig54,
3989	Author = {{G. Dantzig}, R. Fulkerson and Johnson, S.},
3990	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/G. Dantzig - 1954 - Solution of a Large-Scale Traveling-Salesman Problem.pdf:pdf},
3991	Journal = {Journal of the Operations Research Society of America},
3992	Number = {4},
3993	Pages = {393--410},
3994	Title = {{Solution of a Large-Scale Traveling-Salesman Problem}},
3995	Volume = {2},
3996	Year = {1954}}
3997
3998@phdthesis{Borndorfer1998,
3999	Author = {Borndorfer, R.},
4000	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Borndorfer - 1998 - Aspects of Set Packing, Partitioning, and Covering.pdf:pdf},
4001	Title = {{Aspects of Set Packing, Partitioning, and Covering}},
4002	Year = {1998}}
4003
4004@article{Fayyad1996,
4005	Author = {Fayyad, Usama and Piatetsky-Shapiro, Gregory and Smyth, Padhraic},
4006	Journal = {AI Magazine},
4007	Number = {3},
4008	Pages = {37--54},
4009	Title = {{From Data Mining to Knowledge Discovery in Databases}},
4010	Volume = {17},
4011	Year = {1996}}
4012
4013@incollection{Araujo2016,
4014	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.},
4015	Address = {Cham},
4016	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},
4017	Booktitle = {{Hybrid Metaheuristics: 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings}},
4018	Doi = {10.1007/978-3-319-39636-1_9},
4019	Editor = {Blesa, J Maria and Blum, Christian and Cangelosi, Angelo and Cutello, Vincenzo and {DI NUOVO}, ALESSANDRO and Pavone, Mario and Talbi, El-Ghazali},
4020	Isbn = {978-3-319-39636-1},
4021	Issn = {16113349},
4022	Keywords = {Learning, Multineigh borhood search, Online and offline tuning, Project scheduling, Stochastic local search},
4023	Pages = {118--130},
4024	Publisher = {Springer International Publishing},
4025	Title = {{Neighborhood Composition Strategies in Stochastic Local Search}},
4026	Url = {http://dx.doi.org/10.1007/978-3-319-39636-1{\_}9},
4027	Volume = {9668},
4028	Year = {2016},
4029	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-319-39636-1%7B%5C_%7D9},
4030	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-3-319-39636-1_9}}
4031
4032@article{Jepsen2006,
4033	Author = {Jepsen, Mads and Spoorendonk, Simon and Pisinger, David},
4034	Doi = {10.1287/xxxx.0000.0000},
4035	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},
4036	Journal = {Operations Research},
4037	Number = {2},
4038	Pages = {497--511},
4039	Title = {{Introducing Subset Row Inequalities in a Branch-and-Cut-and-Price Algorithm for the Vehicle Routing Problem with Time Windows}},
4040	Volume = {56},
4041	Year = {2006},
4042	Bdsk-Url-1 = {https://doi.org/10.1287/xxxx.0000.0000}}
4043
4044@article{Marchand2002,
4045	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.},
4046	Author = {Marchand, Hugues and Martin, Alexander and Weismantel, Robert and Wolsey, Laurence},
4047	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},
4048	Journal = {Discrete Applied Mathematics},
4049	Keywords = {Cutting planes, Mixed integer programming},
4050	Pages = {397--446},
4051	Title = {{Cutting planes in integer and mixed integer programming}},
4052	Volume = {123},
4053	Year = {2002}}
4054
4055@article{Chvatal1973,
4056	Author = {Chv{\'a}tal, V.},
4057	Journal = {Discrete Mathematics},
4058	Pages = {305--337},
4059	Title = {{Edmonds polytopes and a hierarchy of combinatorial problems}},
4060	Volume = {4},
4061	Year = {1973}}
4062
4063@article{Gendreau1994,
4064	Author = {Gendreau, M. and Hertz, A. and Laporte, G.},
4065	Journal = {Management Science},
4066	Month = {oct},
4067	Number = {10},
4068	Pages = {1276--1290},
4069	Title = {{A tabu search heuristic for the vehicle routing problem}},
4070	Volume = {40},
4071	Year = {1994}}
4072
4073@article{Hoffman1993,
4074	Author = {Hoffman, K.L. and Padberg, M.},
4075	Journal = {Management Science},
4076	Number = {6},
4077	Pages = {657--682},
4078	Title = {{Solving airline crew scheduling problems by branch-and-cut}},
4079	Volume = {39},
4080	Year = {1993}}
4081
4082@article{Sprecher1998,
4083	Author = {Sprecher, Arno and Drexl, Andreas},
4084	Doi = {10.1016/S0377-2217(97)00348-2},
4085	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},
4086	Issn = {03772217},
4087	Journal = {European Journal of Operational Research},
4088	Keywords = {branch-and-bound, computational, heuristic, multiple modes, project scheduling, resource constraints},
4089	Month = {jun},
4090	Number = {2},
4091	Pages = {431--450},
4092	Title = {{Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm}},
4093	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221797003482},
4094	Volume = {107},
4095	Year = {1998},
4096	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221797003482},
4097	Bdsk-Url-2 = {https://doi.org/10.1016/S0377-2217(97)00348-2}}
4098
4099@inproceedings{Gomes2013,
4100	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.},
4101	Author = {Gomes, T.M. Thiago M. and Santos, Haroldo Gambini H.G. and Souza, M.J.F. Marcone J F},
4102	Booktitle = {{Hybrid Metaheuristics}},
4103	Doi = {10.1007/978-3-642-38516-2_1},
4104	Editor = {Blesa, Maria J. and Blum, Christian and Festa, Paola and Roli, Andrea and Sampels, Michael},
4105	Isbn = {9783642385155},
4106	Issn = {03029743 16113349},
4107	Pages = {1--11},
4108	Publisher = {Springer},
4109	Title = {{A Pre-processing Aware RINS Based MIP Heuristic}},
4110	Volume = {7919 LNCS},
4111	Year = {2013},
4112	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-38516-2_1}}
4113
4114@article{Fischetti2007a-2,
4115	Annote = {From Duplicate 1 (MIPping closures: An instant survey - Fischetti, Matteo; Lodi, Andrea) NULL},
4116	Author = {Fischetti, Matteo and Lodi, Andrea},
4117	Doi = {10.1007/s00373-007-0711-6},
4118	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - MIPping closures An instant survey.pdf:pdf},
4119	Issn = {09110119},
4120	Journal = {Graphs and Combinatorics},
4121	Keywords = {Cutting plane methods, Mixed integer programs, Separation problems},
4122	Number = {SUPPL. 1},
4123	Pages = {233--243},
4124	Title = {{MIPping closures: An instant survey}},
4125	Volume = {23},
4126	Year = {2007},
4127	Bdsk-Url-1 = {https://doi.org/10.1007/s00373-007-0711-6}}
4128
4129@article{Wauters2016,
4130	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.},
4131	Author = {Wauters, T. and Kinable, J. and Smet, P. and Vancroonenburg, W. and {Vanden Berghe}, G. and Verstichel, J.},
4132	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},
4133	Journal = {Journal of Scheduling},
4134	Keywords = {Competition, Heuristics, Multi-mode, Multi-project, Project scheduling},
4135	Number = {3},
4136	Pages = {271--283},
4137	Publisher = {Springer US},
4138	Title = {{The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem: The MISTA 2013 challenge}},
4139	Volume = {19},
4140	Year = {2016}}
4141
4142@incollection{Fischetti2011,
4143	Author = {Fischetti, M. and Lodi, A.},
4144	Booktitle = {{Wiley Encyclopedia of Operations Research and Management Science}},
4145	Editor = {Cochran, James J},
4146	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2011 - Heuristics in Mixed Integer Programming.pdf:pdf},
4147	Pages = {738--747},
4148	Publisher = {John Wiley {\&} Sons},
4149	Title = {{Heuristics in Mixed Integer Programming}},
4150	Year = {2011}}
4151
4152@article{Fischetti2004,
4153	Author = {Fischetti, M. and Polo, C. and Scantamburlo, M.},
4154	Journal = {Networks},
4155	Month = {jul},
4156	Number = {2},
4157	Pages = {61--72},
4158	Title = {{A Local Branching Heuristic for Mixed-Integer Programs with 2-Level Variables}},
4159	Volume = {44},
4160	Year = {2004}}
4161
4162@article{Karp1972,
4163	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.},
4164	Author = {Karp, Richard M.},
4165	Journal = {Complexity of Computer Computations},
4166	Pages = {85--103},
4167	Title = {{Reducibility Among Combinatorial Problems}},
4168	Year = {1972}}
4169
4170@article{Breiman2001,
4171	Archiveprefix = {arXiv},
4172	Arxivid = {http://dx.doi.org/10.1023{\%}2FA{\%}3A1010933404324},
4173	Author = {Breiman, L.},
4174	Eprint = {/dx.doi.org/10.1023{\%}2FA{\%}3A1010933404324},
4175	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Breiman - 2001 - Random forests.pdf:pdf},
4176	Journal = {Machine Learning},
4177	Number = {1},
4178	Pages = {5--32},
4179	Primaryclass = {http:},
4180	Title = {{Random forests}},
4181	Volume = {45},
4182	Year = {2001}}
4183
4184@article{Pataki2003,
4185	Author = {Pataki, G.},
4186	Journal = {SIAM Review},
4187	Pages = {116--123},
4188	Title = {{Teaching Integer Programming Formulations Using the Traveling Salesman Problem}},
4189	Volume = {45},
4190	Year = {2003}}
4191
4192@article{Demassey2005,
4193	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.},
4194	Author = {Demassey, Sophie and Artigues, Christian and Michelon, Philippe},
4195	Doi = {10.1287/ijoc.1030.0043},
4196	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},
4197	Isbn = {1091-9856},
4198	Issn = {1091-9856},
4199	Journal = {INFORMS Journal on Computing},
4200	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},
4201	Number = {1},
4202	Pages = {52--65},
4203	Title = {{Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem}},
4204	Url = {http://pubsonline.informs.org/doi/10.1287/ijoc.1030.0043},
4205	Volume = {17},
4206	Year = {2005},
4207	Bdsk-Url-1 = {http://pubsonline.informs.org/doi/10.1287/ijoc.1030.0043},
4208	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1030.0043}}
4209
4210@article{Burke2010,
4211	Author = {Burke, E.K. and Mare$\backslash$vcek, J. and Parkes, A.J. and Rudov{\'a}, H.},
4212	Journal = {Comput. Oper. Res.},
4213	Number = {1},
4214	Pages = {582--597},
4215	Title = {{Decomposition, Reformulation, and Diving in University Course Timetabling}},
4216	Volume = {37},
4217	Year = {2010}}
4218
4219@article{Fischetti2007-2,
4220	Author = {Fischetti, M. and Lodi, A.},
4221	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Lodi - 2007 - Optimizing over the first Chv{\`{a}}tal closure.pdf:pdf},
4222	Journal = {Mathematical Programming B},
4223	Number = {1},
4224	Pages = {3--20},
4225	Title = {{Optimizing over the first Chv{\`a}tal closure}},
4226	Volume = {110},
4227	Year = {2007}}
4228
4229@article{Frangioni2005-2,
4230	Author = {Frangioni, Antonio},
4231	Journal = {Annals of Operations Research},
4232	Keywords = {integer linear programs, lagrangian dual},
4233	Pages = {163--193},
4234	Title = {{About Lagrangian methods in integer optimization}},
4235	Url = {http://link.springer.com/article/10.1007/s10479-005-3447-9},
4236	Year = {2005},
4237	Bdsk-Url-1 = {http://link.springer.com/article/10.1007/s10479-005-3447-9}}
4238
4239@article{McCollum2010,
4240	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.},
4241	Doi = {10.1287/ijoc.1090.0320},
4242	Issn = {1526-5528},
4243	Journal = {INFORMS J. on Computing},
4244	Number = {1},
4245	Pages = {120--130},
4246	Title = {{Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition}},
4247	Volume = {22},
4248	Year = {2010},
4249	Bdsk-Url-1 = {https://doi.org/10.1287/ijoc.1090.0320}}
4250
4251@inproceedings{Pigatti2005,
4252	Address = {Amsterdam, Holanda},
4253	Author = {Pigatti, A. and {Poggi de Arag{\~a}o}, M. and Uchoa, E.},
4254	Pages = {385--395},
4255	Publisher = {Elsevier Science},
4256	Title = {{Stabilized branch-and-cut-and-price for the generalized assigment problem}},
4257	Volume = {19},
4258	Year = {2005}}
4259
4260@article{Kirkpatrick1983,
4261	Author = {Kirkpatrick, S. and Gelatt, C. D. and Vecchi, M. P.},
4262	Journal = {Science},
4263	Pages = {671--680},
4264	Title = {{Optimization by Simulated Annealing}},
4265	Volume = {220},
4266	Year = {1983}}
4267
4268@incollection{Ross1995,
4269	Address = {Berlin},
4270	Author = {Ross, P. and Corne, D. and H., Fang},
4271	Editor = {Eiben, A. E. and Manderick, B. and Z., Ruttkay},
4272	Publisher = {Springer},
4273	Title = {{Successful Lecture Timetabling with Evolutionary Algorithms}},
4274	Year = {1995}}
4275
4276@article{Colorni1998,
4277	Author = {Colorni, A. and Dorigo, M. and Maniezzo, V.},
4278	Journal = {Computational Optimization and Applications},
4279	Number = {3},
4280	Pages = {277--298},
4281	Title = {{Metaheuristics for High-School Timetabling}},
4282	Volume = {9},
4283	Year = {1998}}
4284
4285@book{Junger2010,
4286	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},
4287	Archiveprefix = {arXiv},
4288	Arxivid = {arXiv:1011.1669v3},
4289	Doi = {10.1017/CBO9781107415324.004},
4290	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.},
4291	Eprint = {arXiv:1011.1669v3},
4292	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - 2010 - 50 Years of Integer Programming 1958--2008.pdf:pdf},
4293	Isbn = {9788578110796},
4294	Issn = {1098-6596},
4295	Pmid = {25246403},
4296	Publisher = {Springer},
4297	Title = {{50 Years of Integer Programming}},
4298	Year = {2013},
4299	Bdsk-Url-1 = {https://doi.org/10.1017/CBO9781107415324.004}}
4300
4301@book{Glover1997a,
4302	Address = {Boston},
4303	Author = {Glover, F. and Laguna, M.},
4304	Publisher = {Kluwer},
4305	Title = {{Tabu Search}},
4306	Year = {1997}}
4307
4308@article{Adida2009,
4309	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.},
4310	Author = {Adida, E. and Joshi, P.},
4311	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},
4312	Journal = {International Journal of Services Operations and Informatics},
4313	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},
4314	Number = {2},
4315	Pages = {169},
4316	Title = {{A robust optimisation approach to project scheduling and resource allocation}},
4317	Volume = {4},
4318	Year = {2009}}
4319
4320@article{Lopez-Ibanez2014,
4321	Author = {L{\'o}pez-Ib{\'a}{\~n}ez, Manuel and St{\"u}tzle, Thomas},
4322	Doi = {10.1016/j.ejor.2013.10.043},
4323	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},
4324	Issn = {03772217},
4325	Journal = {European Journal of Operational Research},
4326	Month = {jun},
4327	Number = {3},
4328	Pages = {569--582},
4329	Title = {{Automatically improving the anytime behaviour of optimisation algorithms}},
4330	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0377221713008667},
4331	Volume = {235},
4332	Year = {2014},
4333	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221713008667},
4334	Bdsk-Url-2 = {https://doi.org/10.1016/j.ejor.2013.10.043}}
4335
4336@article{Muller2018,
4337	Author = {M{\"u}ller, T. and Rudov{\'a}, H. and M{\"u}llerov{\'a}, Z.},
4338	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},
4339	Journal = {Proceedings of the 12th International Conference on the Practice ant Theory of Automated Timetabling},
4340	Keywords = {Competition {\textcdot}, Real-world problems, University course timetabling {\textcdot}},
4341	Pages = {5--31},
4342	Title = {{University course timetabling and International Timetabling Competition 2019}},
4343	Url = {http://www.itc2019.org.},
4344	Year = {2018},
4345	Bdsk-Url-1 = {http://www.itc2019.org.}}
4346
4347@article{Zonghao98,
4348	Author = {Gu, Zonghao and Nemhauser, George L. and Savelsbergh, Martin W. P.},
4349	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},
4350	Journal = {INFORMS Journal on Computing},
4351	Number = {4},
4352	Pages = {427--437},
4353	Title = {{Lifted Cover Inequalities for 0-1 Integer Programs: Computation}},
4354	Volume = {10},
4355	Year = {1998}}
4356
4357@book{Griffith2002,
4358	Author = {Griffith, A.},
4359	Publisher = {McGraw-Hill},
4360	Title = {{GCC: The Complete Reference}},
4361	Year = {2002}}
4362
4363@misc{Martin2013,
4364	Author = {Martin, Kipp},
4365	Title = {{COIN-OR Technical Leadership Council Home Page}},
4366	Url = {https://projects.coin-or.org/CoinTLC},
4367	Year = {2013},
4368	Bdsk-Url-1 = {https://projects.coin-or.org/CoinTLC}}
4369
4370@article{Kone2011,
4371	Annote = {From Duplicate 1 (Event-based MILP models for resource-constrained project scheduling problems - Kon{\'e}, Oumar; Artigues, Christian; Lopez, Pierre; Mongeau, Marcel) NULL},
4372	Author = {Kon{\'e}, Oumar and Artigues, Christian and Lopez, Pierre and Mongeau, Marcel},
4373	Doi = {10.1016/j.cor.2009.12.011},
4374	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},
4375	Issn = {03050548},
4376	Journal = {Computers {\&} Operations Research},
4377	Keywords = {mixed integer linear programming, resource-constrained project scheduling},
4378	Month = {jan},
4379	Number = {1},
4380	Pages = {3--13},
4381	Title = {{Event-based MILP models for resource-constrained project scheduling problems}},
4382	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809003360},
4383	Volume = {38},
4384	Year = {2011},
4385	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054809003360},
4386	Bdsk-Url-2 = {https://doi.org/10.1016/j.cor.2009.12.011}}
4387
4388@book{Demeulemeester2002,
4389	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.},
4390	Author = {Demeulemeester, Erik L. and Herroelen, Willy S.},
4391	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Demeulemeester, Herroelen - 2002 - Project Scheduling A Research Handbook.pdf:pdf},
4392	Language = {Ingl{\^e}s},
4393	Pages = {685},
4394	Publisher = {Kluwer Academic Publishers},
4395	Title = {{Project Scheduling: A Research Handbook}},
4396	Year = {2002}}
4397
4398@article{Lancia2008,
4399	Author = {Lancia, G. and Serafini, P.},
4400	Doi = {10.1287/ijoc.1080.0285},
4401	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},
4402	Issn = {1091-9856},
4403	Journal = {INFORMS Journal on Computing},
4404	Month = {sep},
4405	Number = {1},
4406	Pages = {151--166},
4407	Title = {{A Set-Covering Approach with Column Generation for Parsimony Haplotyping}},
4408	Url = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1080.0285},
4409	Volume = {21},
4410	Year = {2008},
4411	Bdsk-Url-1 = {http://joc.journal.informs.org/cgi/doi/10.1287/ijoc.1080.0285},
4412	Bdsk-Url-2 = {https://doi.org/10.1287/ijoc.1080.0285}}
4413
4414@article{Bertsimas2018,
4415	Author = {Bertsimas, D. and Dunn, J. and Pawlowski, C. and Zhuo, Y.D.},
4416	Doi = {10.1287/ijoo.2018.0001},
4417	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Bertsimas et al. - 2018 - Robust Classification.pdf:pdf},
4418	Isbn = {0000000327817},
4419	Issn = {2575-1484},
4420	Journal = {INFORMS Journal on Optimization},
4421	Keywords = {classification problems, machine learning, robust optimization},
4422	Number = {1},
4423	Pages = {2--34},
4424	Title = {{Robust Classification}},
4425	Volume = {1},
4426	Year = {2018},
4427	Bdsk-Url-1 = {https://doi.org/10.1287/ijoo.2018.0001}}
4428
4429@article{Alfandari2014-2,
4430	Author = {Alfandari, Laurent and Monnot, J{\'e}r{\^o}me},
4431	Doi = {10.1016/j.dam.2011.11.030},
4432	Issn = {0166218X},
4433	Journal = {Discrete Applied Mathematics},
4434	Pages = {13--19},
4435	Title = {{A note on the Clustered Set Covering Problem}},
4436	Url = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
4437	Volume = {164},
4438	Year = {2014},
4439	Bdsk-Url-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0166218X11004847},
4440	Bdsk-Url-2 = {https://doi.org/10.1016/j.dam.2011.11.030}}
4441
4442@book{Finger2002-2,
4443	Author = {Finger, Markus and St{\"u}tzle, T and Louren{\c c}o, H},
4444	Pages = {61--71},
4445	Title = {{Exploiting fitness distance correlation of set covering problems}},
4446	Url = {http://link.springer.com/chapter/10.1007/3-540-46004-7{\_}7},
4447	Year = {2002},
4448	Bdsk-Url-1 = {http://link.springer.com/chapter/10.1007/3-540-46004-7%7B%5C_%7D7}}
4449
4450@article{Coll2002,
4451	Author = {Coll, P. and Marenco, J. and {M{\'e}ndez D{\'\i}az}, I. and Zabala, P.},
4452	Journal = {Annals of Operations Research},
4453	Pages = {79--90},
4454	Title = {{Facets of the Graph Coloring Polytope}},
4455	Volume = {116},
4456	Year = {2002}}
4457
4458@article{Koch2011,
4459	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},
4460	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.},
4461	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Koch et al. - 2011 - MIPLIB 2010.pdf:pdf},
4462	Issn = {1867-2949},
4463	Journal = {Mathematical Programming Computation},
4464	Keywords = {Mathematics, Statistics, and},
4465	Mendeley-Tags = {Mathematics,Statistics,and},
4466	Number = {2},
4467	Pages = {103--163},
4468	Title = {{MIPLIB 2010}},
4469	Url = {http://dx.doi.org/10.1007/s12532-011-0025-9},
4470	Volume = {3},
4471	Year = {2011},
4472	Bdsk-Url-1 = {http://dx.doi.org/10.1007/s12532-011-0025-9}}
4473
4474@article{Neumann2017-2,
4475	Author = {Neumann, Christoph and Stein, Oliver and Nathan, Sudermann-Merx},
4476	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},
4477	Keywords = {2000, 2017, 90c10, 90c11, consistency, granularity, inner parallel set, mathematics subject classification, preliminary citation optimization online, preprint id 2017-12-6367, rounding},
4478	Title = {{A feasible rounding approach for mixed-integer optimization problems}},
4479	Year = {2017}}
4480
4481@article{Fischetti2009-2,
4482	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.},
4483	Author = {Fischetti, Matteo and Salvagnin, Domenico},
4484	Doi = {10.1007/s12532-009-0007-3},
4485	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Fischetti, Salvagnin - 2009 - Feasibility pump 2.0.pdf:pdf},
4486	Isbn = {1867-2949},
4487	Issn = {18672949},
4488	Journal = {Mathematical Programming Computation},
4489	Keywords = {Constraint programming, Constraint propagation, Mixed-integer programming, Primal heuristics},
4490	Number = {2-3},
4491	Pages = {201--222},
4492	Title = {{Feasibility pump 2.0}},
4493	Volume = {1},
4494	Year = {2009},
4495	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-009-0007-3}}
4496
4497@article{Fischetti2005-2,
4498	Author = {Fischetti, M. and Glover, F. and Lodi, A.},
4499	Journal = {Mathematical Programming},
4500	Pages = {91--104},
4501	Title = {{The feasibility pump}},
4502	Volume = {104},
4503	Year = {2005}}
4504
4505@incollection{Gamrath2016-2,
4506	Author = {Gamrath, Gerald and Berthold, Timo and Heinz, Stefan and Winkler, Michael},
4507	Booktitle = {{Optimization in the Real World: Toward Solving Real-World Optimization Problems}},
4508	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Gamrath et al. - 2016 - Structure-Based Primal Heuristics forMixed Integer Programming.pdf:pdf},
4509	Keywords = {domain propagation, large neighborhood search, primal heuristics},
4510	Pages = {37--53},
4511	Title = {{Structure-Based Primal Heuristics forMixed Integer Programming}},
4512	Year = {2016}}
4513
4514@article{Boland2014-2,
4515	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.},
4516	Author = {Boland, Natashia L. and Eberhard, Andrew C. and Engineer, Faramroze G. and Fischetti, Matteo and Savelsbergh, Martin W.P. and Tsoukalas, Angelos},
4517	Doi = {10.1007/s12532-014-0068-9},
4518	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Boland et al. - 2014 - Boosting the feasibility pump.pdf:pdf},
4519	Issn = {18672957},
4520	Journal = {Mathematical Programming Computation},
4521	Keywords = {65K05, 90C10, 90C11},
4522	Number = {3},
4523	Pages = {255--279},
4524	Title = {{Boosting the feasibility pump}},
4525	Volume = {6},
4526	Year = {2014},
4527	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-014-0068-9}}
4528
4529@misc{Hill2009-2,
4530	Author = {Hill, H.},
4531	Booktitle = {{Phi Delta Kappan}},
4532	Doi = {10.1177/0964663912467814},
4533	Issn = {09646639},
4534	Pages = {470--476},
4535	Title = {{Fixing Teacher Professional Development}},
4536	Volume = {90},
4537	Year = {2009},
4538	Bdsk-Url-1 = {https://doi.org/10.1177/0964663912467814}}
4539
4540@article{Andrade2017-2,
4541	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.},
4542	Author = {Andrade, Carlos E. and Ahmed, Shabbir and Nemhauser, George L. and Shao, Yufen},
4543	Doi = {10.1016/j.ejor.2017.05.003},
4544	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},
4545	Issn = {03772217},
4546	Journal = {European Journal of Operational Research},
4547	Keywords = {Feasibility, Integer programming, Primal heuristics},
4548	Number = {1},
4549	Pages = {62--71},
4550	Publisher = {Elsevier B.V.},
4551	Title = {{A hybrid primal heuristic for finding feasible solutions to mixed integer programs}},
4552	Volume = {263},
4553	Year = {2017},
4554	Bdsk-Url-1 = {https://doi.org/10.1016/j.ejor.2017.05.003}}
4555
4556@article{Berthold2017-2,
4557	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.},
4558	Author = {Berthold, Timo and Lodi, Andrea and Salvagnin, Domenico},
4559	File = {:home/haroldo/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Berthold, Lodi, Salvagnin - 2017 - Ten years of Feasibility Pump, and counting.pdf:pdf},
4560	Title = {{Ten years of Feasibility Pump, and counting}},
4561	Url = {http://www.dei.unipd.it/{~}salvagni/pdf/10yearsFP.pdf},
4562	Year = {2017},
4563	Bdsk-Url-1 = {http://www.dei.unipd.it/%7B~%7Dsalvagni/pdf/10yearsFP.pdf}}
4564
4565@article{Lucena2006-2,
4566	Author = {Lucena, Abilio},
4567	Journal = {Handbook of Optimization in Telecommunications},
4568	Keywords = {cutting planes, knapsack problem, lagrangian relaxation, relax-and-cut},
4569	Number = {1994},
4570	Pages = {129--145},
4571	Title = {{Lagrangian Relax-and-Cut Algorithms}},
4572	Year = {2006}}
4573
4574@article{Johnson2000-2,
4575	Author = {Johnson, E.L. and Nemhauser, G. and Savelsbergh, W.P.},
4576	Journal = {INFORMS Journal on Computing},
4577	Title = {{Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition}},
4578	Volume = {12},
4579	Year = {2000}}
4580
4581@article{Fischetti2011a-2,
4582	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.},
4583	Author = {Fischetti, Matteo and Salvagnin, Domenico},
4584	Doi = {10.1007/s12532-011-0024-x},
4585	Isbn = {3642135196},
4586	Issn = {18672949},
4587	Journal = {Mathematical Programming Computation},
4588	Keywords = {Gomory cuts, Lagrangian relaxation, Mixed-integer programming, Relax-and-cut},
4589	Number = {2},
4590	Pages = {79--102},
4591	Title = {{A relax-and-cut framework for gomory mixed-integer cuts}},
4592	Volume = {3},
4593	Year = {2011},
4594	Bdsk-Url-1 = {https://doi.org/10.1007/s12532-011-0024-x}}
4595
4596@book{Junger2010-2,
4597	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.},
4598	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},
4599	Archiveprefix = {arXiv},
4600	Arxivid = {arXiv:1011.1669v3},
4601	Author = {Fallis, A.G},
4602	Booktitle = {{Journal of Chemical Information and Modeling}},
4603	Doi = {10.1017/CBO9781107415324.004},
4604	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.},
4605	Eprint = {arXiv:1011.1669v3},
4606	Isbn = {9788578110796},
4607	Issn = {1098-6596},
4608	Keywords = {icle},
4609	Number = {9},
4610	Pages = {1689--1699},
4611	Pmid = {25246403},
4612	Publisher = {Springer},
4613	Title = {{50 Years of Integer Programming}},
4614	Volume = {53},
4615	Year = {2013},
4616	Bdsk-Url-1 = {https://doi.org/10.1017/CBO9781107415324.004}}
4617
4618@book{Junger2010-3,
4619	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.},
4620	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},
4621	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.},
4622	Isbn = {9783540682745},
4623	Pages = {803},
4624	Publisher = {Springer},
4625	Title = {{50 Years of Integer Programming 1958--2008}},
4626	Year = {2010}}
4627
4628@article{Burke2017,
4629	Author = {Burke, E. K. and Bykov, Y.},
4630	Journal = {European Journal of Operational Research},
4631	Localfile = {../../../../Documentos/optimization/metaheuristics/lahc/The late acceptance Hill-Climbing heuristic.pdf},
4632	Pages = {70--78},
4633	Title = {{The late acceptance Hill-Climbing heuristic}},
4634	Volume = {258},
4635	Year = {2017}}
4636
4637@techreport{Reinelt95,
4638	Author = {Reinelt, G.},
4639	Institution = {Universit{\"a}t Heidelberg},
4640	Number = {D-69120},
4641	Title = {{TSPLIB 95}},
4642	Year = {1995}}
4643
4644@article{Tange2011,
4645	Author = {Tange, O.},
4646	Journal = {The USENIX Magazine},
4647	Number = {1},
4648	Pages = {43--47},
4649	Title = {{{G}{N}{U} parallel-the command-line power tool}},
4650	Volume = {36},
4651	Year = {2011}}
4652
4653@inbook{Cook2019,
4654	Author = {Cook, W.},
4655	Booktitle = {{Computing and Software Science: State of the Art and Perspectives}},
4656	Editor = {Steffen, B. and Woeginger, G.},
4657	Pages = {27--47},
4658	Publisher = {Springer International Publishing},
4659	Title = {{Computing in Combinatorial Optimization}},
4660	Year = {2019}}
4661