Sweet sixteen
暂无分享,去创建一个
[1] Michel Grabisch,et al. A brand new cheating attempt: a case of usurped identity , 2016, 4OR.
[2] Dritan Nace,et al. A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures , 2015, 4OR.
[3] Antonio Frangioni,et al. Large-scale unit commitment under uncertainty: an updated literature survey , 2018, Annals of Operations Research.
[4] Fabio Schoen,et al. Global optimization based on local searches , 2013, 4OR.
[5] David Pisinger,et al. Optimization in liner shipping , 2018, Ann. Oper. Res..
[6] Alberto Del Pia,et al. Relaxations of mixed integer sets from lattice-free polyhedra , 2016, Ann. Oper. Res..
[7] Gara Miranda,et al. Using multi-objective evolutionary algorithms for single-objective optimization , 2013, 4OR.
[8] Denis Bouyssou,et al. A case of plagiarism: Dănuţ Marcu , 2006, 4OR.
[9] Michel Grabisch,et al. Surveys in operations research , 2018, Ann. Oper. Res..
[10] Massimo Pappalardo,et al. Merit functions: a bridge between optimization and equilibria , 2016, Ann. Oper. Res..
[11] Thierry Marchant,et al. Twelve surveys in operations research , 2016, Ann. Oper. Res..
[12] Lakhdar Sais,et al. Learning from conflicts in propositional satisfiability , 2012, 4OR.
[13] Nikolaos V. Sahinidis,et al. Simulation optimization: a review of algorithms and applications , 2014, 4OR.
[14] Matthias Köppe,et al. Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms , 2016, 4OR.
[15] Denis Bouyssou,et al. Eleven surveys in Operations Research , 2007, Ann. Oper. Res..
[16] Thierry Marchant,et al. Eleven surveys in operations research: III , 2013, Ann. Oper. Res..
[17] Massimo Pappalardo,et al. Merit functions: a bridge between optimization and equilibria , 2014, 4OR.
[18] Thierry Marchant,et al. The dirty dozen of 4OR , 2015, 4OR.
[19] Miguel A. Goberna,et al. Recent contributions to linear semi-infinite optimization , 2017, 4OR.
[20] Antonio Mucherino,et al. Assigned and unassigned distance geometry: applications to biological molecules and nanostructures , 2016, 4OR.
[21] Franz Rendl,et al. Semidefinite relaxations for partitioning, assignment and ordering problems , 2012, 4OR.
[22] Antonio Frangioni,et al. Large-scale Unit Commitment under uncertainty , 2014, 4OR.
[23] Martine Labbé. Bilevel Programming and Price Setting Problems , 2006, OR.
[24] Thiago Henrique Nogueira,et al. Mathematical model applied to single-track line scheduling problem in Brazilian railways , 2015, 4OR.
[25] Hans Kellerer,et al. The symmetric quadratic knapsack problem: approximation and scheduling applications , 2012, 4OR.
[26] Matthias Köppe,et al. Light on the Infinite Group Relaxation , 2014, ArXiv.
[27] Nabil Absi,et al. Vehicle routing problems with multiple trips , 2016, 4OR.
[28] Gilbert Laporte,et al. Shared mobility systems , 2015, 4OR.
[29] Gianni Di Pillo,et al. An application of support vector machines to sales forecasting under promotions , 2016, 4OR.
[30] El-Ghazali Talbi,et al. Combining metaheuristics with mathematical programming, constraint programming and machine learning , 2013, 4OR.
[31] Giuseppe Lancia,et al. Deriving compact extended formulations via LP-based separation techniques , 2015, Annals of Operations Research.
[32] Denis Bouyssou,et al. Plagiarism again: Sreenivas and Srinivas, with an update on Marcu , 2009, 4OR.
[33] Philippe Chrétienne. On scheduling with the non-idling constraint , 2014, 4OR.
[34] Vangelis Th. Paschos,et al. When polynomial approximation meets exact computation , 2018, Ann. Oper. Res..
[35] Matthias Köppe,et al. Light on the infinite group relaxation I: foundations and taxonomy , 2014, 4OR.