The following pages link to (Q5472387):
Displaying 50 items.
- Real-life curriculum-based timetabling with elective courses and course sections (Q284409) (← links)
- A review of chaos-based firefly algorithms: perspectives and research challenges (Q298693) (← links)
- In and out forests on combinatorial landscapes (Q299842) (← links)
- Anytime Pareto local search (Q319099) (← links)
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Multi-directional local search (Q339654) (← links)
- Convergence of preference functions (Q388149) (← links)
- Improving the anytime behavior of two-phase local search (Q408982) (← links)
- Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
- Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time (Q418028) (← links)
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Development and analysis of cooperative model-based metaheuristics (Q466330) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- The balanced academic curriculum problem revisited (Q519088) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
- A study on meme propagation in multimemetic algorithms (Q747522) (← links)
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- Clause weighting local search for SAT (Q862404) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- A constraint-based local search backend for MiniZinc (Q890003) (← links)
- Boosting haplotype inference with local search (Q941674) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Variable selection and updating in model-based discriminant analysis for high dimensional data with food authenticity applications (Q977645) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments (Q1621406) (← links)
- Spatiotemporal dynamics of viral hepatitis A in Italy (Q1630999) (← links)
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
