Pages that link to "Item:Q750320"

The following pages link to TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320):

Displayed 17 items.

• TABARIS (Q15073) ‎ (← links)
• Variable neighborhood search for the maximum clique (Q705505) ‎ (← links)
• Finding maximum cliques in arbitrary and in special graphs (Q807639) ‎ (← links)
• Reduction of indefinite quadratic programs to bilinear programs (Q1187369) ‎ (← links)
• Constructing a course schedule by solving a series of assignment type problems (Q1296794) ‎ (← links)
• A fast algorithm for the maximum weight clique problem (Q1316588) ‎ (← links)
• The maximum clique problem (Q1318271) ‎ (← links)
• A multi-KP modeling for the maximum-clique problem (Q1328650) ‎ (← links)
• EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) ‎ (← links)
• Solving transportation problems with nonlinear side constraints with tabu search (Q1892666) ‎ (← links)
• Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) ‎ (← links)
• Metaheuristics: A bibliography (Q1919858) ‎ (← links)
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) ‎ (← links)
• On the Shannon capacity of triangular graphs (Q1953512) ‎ (← links)
• Solving the maximum clique problem using a tabu search approach (Q2367014) ‎ (← links)
• A branch and bound algorithm for the maximum clique problem (Q5899820) ‎ (← links)
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) ‎ (← links)