The following pages link to Philippe Galinier (Q336497):
Displaying 21 items.
- A reliable model for global planning of mobile networks (Q336498) (← links)
- Improving constrained pattern mining with first-fail-based heuristics (Q408638) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- An efficient memetic algorithm for the graph partitioning problem (Q763098) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- A general approach for constraint solving by local search (Q1876601) (← links)
- Hybrid evolutionary algorithms for graph coloring (Q1970334) (← links)
- Solving the frequency assignment problem with polarization by local search and tabu (Q2386687) (← links)
- Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
- An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- Tabu search for frequency assignment in mobile radio networks (Q2567856) (← links)
- A tabu search algorithm for difference triangle sets and Golomb rulers (Q2571189) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)
- (Q4495202) (← links)
- Restricted swap-based neighborhood search for the minimum connected dominating set problem (Q4565786) (← links)
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639) (← links)
