Stochastic local search. Foundations and applications.
From MaRDI portal
(Redirected from Publication:5472387)
Recommendations
Cited in
(only showing first 100 items - show all)- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- 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
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments
- Spatiotemporal dynamics of viral hepatitis A in Italy
- General variable neighborhood search for the order batching and sequencing problem
- Swap-vertex based neighborhood for Steiner tree problems
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Revisiting simulated annealing: a component-based analysis
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Quantile and mean value measures of search process complexity
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
- Large neighbourhood search algorithms for the founder sequence reconstruction problem
- Heuristic optimisation in financial modelling
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Using the method of conditional expectations to supply an improved starting point for CCLS
- A landscape-based analysis of fixed temperature and simulated annealing
- A cutoff time strategy based on the coupon collector's problem
- Stagnation detection with randomized local search
- Directed particle swarm optimization with Gaussian-process-based function forecasting
- Metaheuristics ``In the large
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
- Automatically improving the anytime behaviour of optimisation algorithms
- Automatic algorithm design for hybrid flowshop scheduling problems
- Wombit: a portfolio bit-vector solver using word-level propagation
- Analysis of properties of quantum hashing
- Iterative and core-guided maxsat solving: a survey and assessment
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- 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
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Understanding the role of noise in stochastic local search: analysis and experiments
- Lifted discriminative learning of probabilistic logic programs
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- A taxonomy of exact methods for partial Max-SAT
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- 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
- A bi-objective coordination setup problem in a two-stage production system
- 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
- Ant colony optimization theory: a survey
- 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
- Task design in complex crowdsourcing experiments: item assignment optimization
- Learning MAX-SAT from contextual examples for combinatorial optimisation
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998)
- Lévy flight artificial bee colony algorithm
- Real-life curriculum-based timetabling with elective courses and course sections
- A review of chaos-based firefly algorithms: perspectives and research challenges
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- In and out forests on combinatorial landscapes
- Anytime Pareto local search
- An efficient local search heuristic with row weighting for the unicost set covering problem
- New local search methods for partial MaxSAT
- Metaheuristics for Score-and-Search Bayesian Network Structure Learning
- Multi-directional local search
- 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
- Discriminative Structure Learning of Markov Logic Networks
- Meta-heuristics for Grid Scheduling Problems
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
- Convergence of preference functions
- Improving the anytime behavior of two-phase local search
- Algorithm portfolio selection as a bandit problem with unbounded losses
- 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
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
- Analysing the robustness of multiobjectivisation approaches applied to large scale optimisation problems
- Development and analysis of cooperative model-based metaheuristics
- 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
- 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
- Automatic construction of parallel portfolios via algorithm configuration
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
- Fitness landscape analysis for the no-wait flow-shop scheduling problem
- The balanced academic curriculum problem revisited
- Iterative Flattening Search on RCPSP/max Problems: Recent Developments
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- Combinatorial search: from algorithms to systems
- A framework for analyzing sub-optimal performance of local search algorithms
- Constructive-destructive heuristics for the safe set problem
- Shop scheduling in manufacturing environments: a review
This page was built for publication: Stochastic local search. Foundations and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472387)
