The following pages link to Variable neighborhood search (Q1374041):
Displaying 18 items.
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
- Ambulance location and relocation problems with time-dependent travel times (Q613443) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (Q1410623) (← links)
- Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm (Q1652273) (← links)
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
- A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem (Q2840754) (← links)
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization (Q4924108) (← links)
