Section: Software
Application specific solvers
The output of our studies on specific applications typically consists in algorithmic developments and codes that implement the application specific solvers or, in some cases, routines that allow to derive theoretical results (f.i. in graph theory). The algorithms produced this year are:
-
GRWA-BCP: A branch-cut-and-price code for routing traffic in a optical telecommunication network [40] , [40] .
contact: Benoit Vignac
-
BAP-RAD: branch-and-price code for scheduling an airborne radar problem [13] .
contact: Ruslan Sadykov
-
2D-KNAP: a branch-and-bound code for the 2D orthogonal packing problme where feasibility checks are based on graph theory tools [27] .
contact: Cédric Joncour
