The following pages link to Philippe Galinier (Q336497):
Displaying 11 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)
