Pages that link to "Item:Q970194"
From MaRDI portal
The following pages link to Variable neighbourhood search: methods and applications (Q970194):
Displaying 17 items.
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows (Q6079872) (← links)
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands (Q6088245) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
- Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat (Q6106989) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
- A new taxonomy of global optimization algorithms (Q6137180) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak (Q6168128) (← links)
- Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem (Q6200378) (← links)
- Maximum-margin polyhedral separation for binary multiple instance learning (Q6491336) (← links)
- A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation (Q6551143) (← links)
- Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories (Q6551153) (← links)
- General variable neighborhood search for the optimization of software quality (Q6561228) (← links)
- Solution algorithms for dock scheduling and truck sequencing in cross-docks: a neural branch-and-price and a metaheuristic (Q6568435) (← links)
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines (Q6609697) (← links)
- Minimization of maximum lateness on parallel machines with a single server and job release dates (Q6614640) (← links)
