Yan Georget

Yan Georget has a degree from Paris-based Ecole Polytechnique and a Ph.D. in computer science from INRIA. He worked several years in the software industry as technical lead and project manager. In 2002, he co-founded Koalog, a software company specialized in Java components for combinatorial optimization.

Articles

Solving Sudokus in Java
Sudoku puzzles are wildly popular, and offer an ideal introduction to constraint programming (CP). Rather than using brute force to find every possible solution, CP allows you to specify what must be true in a problem space, and then efficiently finds an answer. Yan Georget shows how this works. Nov. 29, 2005

Scheduling a Golf Tournament
This article shows how to solve a hard scheduling problem (scheduling a golf tournament), using Koalog Constraint Solver, a Java library for constraint programming. Jan. 19, 2005

java.net RSS Feeds