{"id":950,"date":"2020-02-28T22:42:31","date_gmt":"2020-02-28T21:42:31","guid":{"rendered":"http:\/\/www.evostar.org\/2020\/?page_id=950"},"modified":"2022-04-01T21:41:48","modified_gmt":"2022-04-01T19:41:48","slug":"accepted-papers","status":"publish","type":"page","link":"http:\/\/www.evostar.org\/2022\/accepted-papers\/","title":{"rendered":"EvoCOP Accepted Papers"},"content":{"rendered":"\n<ul><li>Modeling the Costas Array Problem in QUBO for Quantum Annealing<br><em>Philippe Codognet<\/em><\/li><li>Penalty Weights in QUBO formulations of Permutation Problems<br><em>Mayowa Ayodele<\/em><\/li><li>Stagnation Detection meets Fast Mutation<br><em>Benjamin Doerr and Amirhossein Rajabi<\/em><\/li><li>A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation<br><em>Markus Kirchweger, Jonas Mayerhofer, Marc Huber and G\u00fcnther Raidl<\/em><\/li><li>Deep Infeasibility Exploration Method for Vehicle Routing Problems<br><em>Piotr Beling, Piotr Cybula, Andrzej Jaszkiewicz, Przemys\u0142aw Pe\u0142ka, Marek Rogalski and Piotr Sielski<\/em><\/li><li>On Monte Carlo Tree Search for Weighted Vertex Coloring<br><em>Cyril Grelier, Olivier Goudet and Jin-Kao Hao<\/em><\/li><li>Algorithm Selection for the Team Orienteering Problem<br><em>Mustafa Misir, Aldy Gunawan and Pieter Vansteenwegen<\/em><\/li><li>A RNN-based Hyper-heuristic for combinatorial problems<br><em>Emmanuel Kieffer, Gabriel Duflo, Gregoire Danoy, Sebastien Varrette and Pascal Bouvry<\/em><\/li><li>PUBOi: a tunable benchmark with variable importance<br><em>Sara Tari, S\u00e9bastien Verel and Mahmoud Omidvar<\/em><\/li><li>Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances<br><em>Bianca Pascariu, Marcella Sam\u00e0, Paola Pellegrini, Andrea D&#8217;Ariano, Dario Pacciarelli and Joaquin Rodriguez<\/em><\/li><li>Evolutionary Algorithms for the Constrained Two-Level Role Mining Problem<br><em>Simon Anderer, Falk Schrader, Bernd Scheuermann and Sanaz Mostaghim<\/em><\/li><li>Simplifying Dispatching Rules in Genetic Programming for Dynamic Job Shop Scheduling<br><em>Sai Panda, Yi Mei and Mengjie Zhang<\/em><\/li><li>Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems<br><em>Hirad Assimi, Frank Neumann, Markus Wagner and Xiaodong Li<\/em><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Modeling the Costas Array Problem in QUBO for Quantum AnnealingPhilippe Codognet Penalty Weights in QUBO formulations of Permutation ProblemsMayowa Ayodele Stagnation Detection meets Fast MutationBenjamin Doerr and Amirhossein Rajabi A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length CalculationMarkus Kirchweger, Jonas Mayerhofer, Marc Huber and G\u00fcnther Raidl Deep Infeasibility [&hellip;]<\/p>\n","protected":false},"author":4,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/pages\/950"}],"collection":[{"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/comments?post=950"}],"version-history":[{"count":10,"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/pages\/950\/revisions"}],"predecessor-version":[{"id":1897,"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/pages\/950\/revisions\/1897"}],"wp:attachment":[{"href":"http:\/\/www.evostar.org\/2022\/wp-json\/wp\/v2\/media?parent=950"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}