default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th LION 2018: Kalamata, Greece
- Roberto Battiti, Mauro Brunato, Ilias S. Kotsireas, Panos M. Pardalos:
Learning and Intelligent Optimization - 12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11353, Springer 2019, ISBN 978-3-030-05347-5 - Akshita Bhandari, Chandramani Singh:
Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning. 1-15 - Wenbao Qiao
, Jean-Charles Créput:
Spiral Search Method to GPU Parallel Euclidean Minimum Spanning Tree Problem. 16-30 - Eduardo Lalla-Ruiz, Eduardo Segredo, Stefan Voß:
A Cooperative Learning Approach for the Quadratic Knapsack Problem. 31-35 - Linlin Jia, Laisheng Xiang, Xiyu Liu:
An Improved BTK Algorithm Based on Cell-Like P System with Active Membranes. 36-48 - Lefteris M. Kirousis, John Livieratos:
A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma. 49-63 - Georg E. A. Froehlich, Guenter Kiechle, Karl F. Doerner:
Creating a Multi-iterative-Priority-Rule for the Job Shop Scheduling Problem with Focus on Tardy Jobs via Genetic Programming. 64-77 - Victor Gergel, Konstantin Barkalov, Ilya Lebedev:
A Global Optimization Algorithm for Non-Convex Mixed-Integer Problems. 78-81 - Wenbao Qiao, Jean-Charles Créput:
Massive 2-opt and 3-opt Moves with High Performance GPU Local Search to Large-Scale Traveling Salesman Problem. 82-97 - Teck-Hou Teng, Hoong Chuin Lau, Aldy Gunawan:
Instance-Specific Selection of AOS Methods for Solving Combinatorial Optimisation Problems via Neural Networks. 98-114 - Andre Biedenkapp, Joshua Marben, Marius Lindauer, Frank Hutter:
CAVE: Configuration Assessment, Visualization and Evaluation. 115-130 - Adil I. Erzin, Roman V. Plotnikov:
The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles. 131-140 - Júlio C. S. N. Pinheiro, José Elias C. Arroyo, Ricardo G. Tavares:
An Effective Heuristic for a Single-Machine Scheduling Problem with Family Setups and Resource Constraints. 141-153 - Andrew J. Parkes, Neema Beglou, Ender Özcan:
Learning the Quality of Dispatch Heuristics Generated by Automated Programming. 154-158 - Jeroen Corstjens, An Caris, Benoît Depaire:
Explaining Heuristic Performance Differences for Vehicle Routing Problems with Time windows. 159-174 - David Gaudrie, Rodolphe Le Riche, Victor Picheny, Benoit Enaux, Vincent Herbert:
Targeting Well-Balanced Solutions in Multi-Objective Bayesian Optimization Under a Restricted Budget. 175-179 - Renato De Leone, Giovanni Fasano, Massimo Roma, Yaroslav D. Sergeyev:
How Grossone Can Be Helpful to Iteratively Compute Negative Curvature Directions. 180-183 - Jakob Bossek, Christian Grimme:
Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. 184-198 - Marko Djukanovic, Günther R. Raidl, Christian Blum:
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. 199-214 - Jakob Bossek, Heike Trautmann:
Multi-objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. 215-219 - Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle:
Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers. 220-224 - Anne-Lise Bedenel, Laetitia Jourdan, Christophe Biernacki:
Probability Estimation by an Adapted Genetic Algorithm in Web Insurance. 225-240 - Aymeric Blot, Marie-Eléonore Kessaci, Laetitia Jourdan, Patrick De Causmaecker:
Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem. 241-256 - I. Ilkay Boduroglu:
Portfolio Optimization via a Surrogate Risk Measure: Conditional Desirability Value at Risk (CDVaR). 257-270 - Louis Faury, Flavian Vasile:
Rover Descent: Learning to Optimize by Learning to Navigate on Prototypical Loss Surfaces. 271-287 - Nguyen Dang, Patrick De Causmaecker:
Analysis of Algorithm Components and Parameters: Some Case Studies. 288-303 - Valeriy A. Kalyagin, Alexander P. Koldanov, Petr A. Koldanov, Panos M. Pardalos:
Optimality of Multiple Decision Statistical Procedure for Gaussian Graphical Model Selection. 304-308 - Carlos Ansótegui, Britta Heymann, Josep Pon, Meinolf Sellmann, Kevin Tierney:
Hyper-Reactive Tabu Search for MaxSAT. 309-325 - Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin:
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence. 326-336 - Anton V. Eremeev:
A Restarting Rule Based on the Schnabel Census for Genetic Algorithms. 337-351 - Antonio Candelieri, Riccardo Perego, Francesco Archetti:
Intelligent Pump Scheduling Optimization in Water Distribution Networks. 352-369 - Dimitris Souravlias, Sandra Huber:
Detecting Patterns in Benchmark Instances of the Swap-Body Vehicle Routing Problem. 370-385 - Andrés Camero, Jamal Toutouh, Daniel H. Stolfi, Enrique Alba:
Evolutionary Deep Learning for Car Park Occupancy Prediction in Smart Cities. 386-401 - Edward Kh. Gimadi, O. Yu. Tsidulko:
Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space. 402-410 - Jamal Toutouh, Diego Rossit, Sergio Nesmachnow:
Computational Intelligence for Locating Garbage Accumulation Points in Urban Scenarios. 411-426 - Artem Baklanov, Michael Yu. Khachay, Maxim Pasynkov:
Fully Convolutional Neural Networks for Mapping Oil Palm Plantations in Kalimantan. 427-432 - Armando Di Nardo, Michele Di Natale, Anna Di Mauro, Giovanni Francesco Santonastaso, Andrea Palomba, Stefano Locoratolo:
Calibration of a Water Distribution Network with Limited Field Measures: The Case Study of Castellammare di Stabia (Naples, Italy). 433-436 - Dimitris E. Simos, Ludwig Kampel, Murat Ozcan:
Combinatorial Methods for Testing Communication Protocols in Smart Cities. 437-440 - Michael Yu. Khachay, Katherine Neznakhina:
Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters. 441-446 - Konstantin Kobylkin:
Constant Factor Approximation for Intersecting Line Segments with Disks. 447-454 - Yuwei Sun, Xiaofei Qian, Siwen Liu:
Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm. 455-472
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-02 20:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
