Pages that link to "Item:Q5278851"
From MaRDI portal
The following pages link to New variable neighbourhood search based 0-1 MIP heuristics (Q5278851):
Displaying 11 items.
- Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
- Variable neighborhood search variants for min-power symmetric connectivity problem (Q1652130) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- A new variable neighborhood search approach for solving dynamic memory allocation problem (Q4987788) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- Exponential quality function for community detection in complex networks (Q6088242) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
