The following pages link to Jin-Kao Hao (Q211247):
Displaying 50 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- 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)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- Breakout local search for maximum clique problems (Q339563) (← links)
- A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Genetic tabu search for robust fixed channel assignment under dynamic traffic data (Q409273) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems (Q537985) (← links)
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (Q537995) (← links)
- The case for strategic oscillation (Q542006) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- List-graph colouring for multiple depot vehicle scheduling (Q843401) (← links)
- (Q944721) (redirect page) (← links)
- Using solution properties within an enumerative search to solve a sports league scheduling problem (Q944722) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- Upper bounds for the SPOT 5 daily photograph scheduling problem (Q1411341) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Lorenz dominance based algorithms to solve a practical multiobjective problem (Q1725590) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- A heuristic approach for antenna positioning in cellular networks (Q1850971) (← links)
- A general approach for constraint solving by local search (Q1876601) (← links)
- A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib) (Q1887059) (← links)
- Hybrid evolutionary algorithms for graph coloring (Q1970334) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
