The following pages link to (Q2776569):
Displaying 29 items.
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Learning multicriteria fuzzy classification method PROAFTN from data (Q868128) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- General variable neighborhood search for the continuous optimization (Q932193) (← links)
- A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints (Q1677303) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule (Q2464208) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- A new variable neighborhood search approach for solving dynamic memory allocation problem (Q4987788) (← links)
- General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs (Q6066713) (← links)
- The intermittent travelling salesman problem (Q6066722) (← links)
