The following pages link to (Q5472387):
Displayed 41 items.
- 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)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← 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)
- 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)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178) (← links)
- Understanding the role of noise in stochastic local search: analysis and experiments (Q2389642) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- The minimum shift design problem (Q2468734) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- Multicriteria optimisation and simulation: an industrial application (Q2468761) (← links)
- On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
- Memetic particle swarm optimization (Q2468766) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Neighborhood portfolio approach for local search applied to timetabling problems (Q2506215) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- Ant colony optimization theory: a survey (Q2575081) (← links)
- A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
- Improvements to Hybrid Incremental SAT Algorithms (Q3502706) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- Discriminative Structure Learning of Markov Logic Networks (Q3543270) (← links)
- Meta-heuristics for Grid Scheduling Problems (Q3603106) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- Iterative Flattening Search on RCPSP/max Problems: Recent Developments (Q5191409) (← links)