Pages that link to "Item:Q1850963"
From MaRDI portal
The following pages link to Variable neighborhood decomposition search (Q1850963):
Displaying 37 items.
- Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
- Categorical data fuzzy clustering: an analysis of local search heuristics (Q2456635) (← links)
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
- A fast swap-based local search procedure for location problems (Q2480210) (← links)
- A unified framework for partial and hybrid search methods in constraint programming (Q2489124) (← links)
- A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Exploiting separators for guiding VNS (Q2840785) (← links)
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility (Q2883646) (← links)
- An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)
- An iterative local search approach applied to the optimal stratification problem (Q3002556) (← links)
- On the integrated charge planning with flexible jobs in primary steelmaking processes (Q3163146) (← links)
- Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
- Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS (Q4921890) (← links)
- An algorithm for minimizing clustering functions (Q5317732) (← links)
- Arbitrary-norm hyperplane separation by variable neighbourhood search (Q5432694) (← links)
- Heuristics for Location Models (Q5506730) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- Affinity propagation and uncapacitated facility location problems (Q5964469) (← links)
- A decision method on yard cranes transformation and deployment in green ports (Q6092517) (← links)
- Metaheuristics: A Canadian Perspective (Q6102854) (← links)
- Aggregation tree construction using hierarchical structures (Q6134051) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem (Q6160231) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- The balanced \(p\)-median problem with unitary demand (Q6164621) (← links)
- General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
- A predictive multistage postdisaster damage assessment framework for drone routing (Q6659099) (← links)