The following pages link to General local search methods (Q1268283):
Displaying 30 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy (Q473956) (← links)
- Parameter tuning for local-search-based matheuristic methods (Q680781) (← links)
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
- Comparing simulated annealing and genetic algorithm in learning FCM (Q990488) (← links)
- Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
- Product line selection and pricing under a share-of-surplus choice model. (Q1406498) (← links)
- Using penalty function and tabu search to solve cell formation problems with fixed cell cost. (Q1422379) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works (Q1603329) (← links)
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
- A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
- Application of heuristic methods for conformance test selection (Q1847243) (← links)
- Handling flexibility in a ``generalised job shop'' with a fuzzy approach (Q1869716) (← links)
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study (Q1876139) (← links)
- A two-phased approach to the supply network reconfiguration problem (Q1971987) (← links)
- A queueing framework for routing problems with time-dependent travel times (Q2369970) (← links)
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems (Q2413317) (← links)
- Vehicle routing with dynamic travel times: a queueing approach (Q2426527) (← links)
- Heuristics for urban road network design: lane layout and signal settings (Q2433540) (← links)
- Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
- A columnar competitive model for solving multi-traveling salesman problem (Q2482590) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Parameter-free filled function method for nonlinear integer program (Q2698601) (← links)
- Pareto simulated annealing for the design of experiments: illustrated by a gene expression study (Q2978430) (← links)
- Learning monotone preferences using a majority rule sorting model (Q6066613) (← links)
