Pages that link to "Item:Q2350189"
From MaRDI portal
The following pages link to Breakout local search for the quadratic assignment problem (Q2350189):
Displayed 23 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Kernel technology to solve discrete optimization problems (Q1699399) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- Solving the quadratic assignment problem (Q2215269) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653) (← links)
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (Q2285657) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Knowledge Discovery in Graphs Through Vertex Separation (Q3305126) (← links)
- The Rank-One Quadratic Assignment Problem (Q5085471) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
- Partial neighborhood local searches (Q6082175) (← links)