The following pages link to Variable neighborhood search (Q1374041):
Displaying 50 items.
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach (Q337234) (← links)
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
- Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
- \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS (Q337243) (← links)
- A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife (Q337467) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- An efficient hybrid meta-heuristic for aircraft landing problem (Q339566) (← links)
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A bi-level programming model for protection of hierarchical facilities under imminent attacks (Q342087) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- The multiple team formation problem using sociometry (Q342525) (← links)
- The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- Analysing the scalability of multiobjective evolutionary algorithms when solving the motif discovery problem (Q377760) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Structural learning of Bayesian networks using local algorithms based on the space of orderings (Q416282) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Product line pricing for services with capacity constraints and dynamic substitution (Q439681) (← links)
- Estimating the four parameters of the Burr III distribution using a hybrid method of variable neighborhood search and iterated local search algorithms (Q440940) (← links)
- Similarities between meta-heuristics algorithms and the science of life (Q441019) (← links)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- Biobjective sparse principal component analysis (Q458642) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- A filling function method for unconstrained global optimization (Q493693) (← links)
- Optimization of algorithms with OPAL (Q495935) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations (Q513117) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
