scientific article; zbMATH DE number 5031086

Publication date: 12 June 2006

Full work available at URL: http://www.sciencedirect.com/science/book/9781558608726

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

SLS algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, On the use of stochastic local search techniques to revise first-order logic theories from examples, A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments, Real-life curriculum-based timetabling with elective courses and course sections, Spatiotemporal dynamics of viral hepatitis A in Italy, A review of chaos-based firefly algorithms: perspectives and research challenges, In and out forests on combinatorial landscapes, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Classification of applied methods of combinatorial optimization, Anytime Pareto local search, An efficient local search heuristic with row weighting for the unicost set covering problem, Statistical regimes across constrainedness regions, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques, New local search methods for partial MaxSAT, Understanding the role of noise in stochastic local search: analysis and experiments, Multi-directional local search, Clause weighting local search for SAT, A landscape-based analysis of fixed temperature and simulated annealing, A review of metrics on permutations for search landscape analysis, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A computational study on ant colony optimization for the traveling salesman problem with dynamic demands, Capping methods for the automatic configuration of optimization algorithms, The multi-story space assignment problem, Convergence of preference functions, A cutoff time strategy based on the coupon collector's problem, Heuristic optimisation in financial modelling, A constraint-based local search backend for MiniZinc, Task design in complex crowdsourcing experiments: item assignment optimization, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Learning MAX-SAT from contextual examples for combinatorial optimisation, Improving the anytime behavior of two-phase local search, Algorithm portfolio selection as a bandit problem with unbounded losses, Lifted discriminative learning of probabilistic logic programs, General variable neighborhood search for the order batching and sequencing problem, Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time, Analysis of an iterated local search algorithm for vertex cover in sparse random graphs, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Swap-vertex based neighborhood for Steiner tree problems, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Local search and lower bounds for the patient admission scheduling problem, Go-MOCE: greedy order method of conditional expectations for Max Sat, A taxonomy of exact methods for partial Max-SAT, Efficient benchmarking of algorithm configurators via model-based surrogates, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT, Development and analysis of cooperative model-based metaheuristics, Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis, Revisiting simulated annealing: a component-based analysis, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, Local search for Boolean satisfiability with configuration checking and subscore, Algorithm runtime prediction: methods \& evaluation, On the tractability of minimal model computation for some CNF theories, Boosting haplotype inference with local search, A discrete gravitational search algorithm for solving combinatorial optimization problems, The configurable SAT solver challenge (CSSC), CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Directed particle swarm optimization with Gaussian-process-based function forecasting, The minimum shift design problem, Local search algorithms for finding the Hamiltonian completion number of line graphs, Multicriteria optimisation and simulation: an industrial application, On local optima in multiobjective combinatorial optimization problems, Memetic particle swarm optimization, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, Metaheuristics ``In the large, Automatic construction of parallel portfolios via algorithm configuration, Fitness landscape analysis for the no-wait flow-shop scheduling problem, The balanced academic curriculum problem revisited, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, Quantile and mean value measures of search process complexity, Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem, Automatically improving the anytime behaviour of optimisation algorithms, A bi-objective coordination setup problem in a two-stage production system, Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems, Large neighbourhood search algorithms for the founder sequence reconstruction problem, A framework for analyzing sub-optimal performance of local search algorithms, Estimation-based metaheuristics for the probabilistic traveling salesman problem, Variable selection and updating in model-based discriminant analysis for high dimensional data with food authenticity applications, Iterated local search for the quadratic assignment problem, Neighborhood portfolio approach for local search applied to timetabling problems, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Automatic algorithm design for hybrid flowshop scheduling problems, Algorithms for a realistic variant of flowshop scheduling, Real-time solving of computationally hard problems using optimal algorithm portfolios, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, A study on meme propagation in multimemetic algorithms, Lévy flight artificial bee colony algorithm, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Wombit: a portfolio bit-vector solver using word-level propagation, Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem, An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, Analysis of properties of quantum hashing, Using the method of conditional expectations to supply an improved starting point for CCLS, Ant colony optimization theory: a survey, Iterative and core-guided maxsat solving: a survey and assessment, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, Constructive-destructive heuristics for the safe set problem, Shop scheduling in manufacturing environments: a review, Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem, A Decision-Making Procedure for Resolution-Based SAT-Solvers, Improvements to Hybrid Incremental SAT Algorithms, Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning, Stochastic local search and parameters recommendation: a case study on flowshop problems, From fitness landscapes evolution to automatic local search algorithm generation, Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems, Local Search For Satisfiability Modulo Integer Arithmetic Theories, Metaheuristics: A Canadian Perspective, Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, Iterative genetic improvement: scaling stochastic program synthesis, Fairer comparisons for travelling salesman problem solutions using hash functions, Discriminative Structure Learning of Markov Logic Networks, Using sequential runtime distributions for the parallel speedup prediction of SAT local search, Metaheuristics for Score-and-Search Bayesian Network Structure Learning, Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives, Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems, Iterative Flattening Search on RCPSP/max Problems: Recent Developments, Meta-heuristics for Grid Scheduling Problems, The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT