Cutting planes for integer programs with general integer variables. - Sebastián Ceria; Cécile Cordier; Hugues Marchand; Laurence A. Wolsey (Math. Program., 1998)

A polyhedral study of the mixed knapsack set and its use to solve mixed integer programs. - Hugues Marchand (1998)

bc - opt : a branch-and-cut code for mixed integer programs. - Cécile Cordier; Hugues Marchand; Richard Laundy; Laurence A. Wolsey (Math. Program., 1999)

The 0-1 Knapsack problem with a single continuous variable. - Hugues Marchand; Laurence A. Wolsey (Math. Program., 1999)

Aggregation and Mixed Integer Rounding to Solve MIPs. - Hugues Marchand; Laurence A. Wolsey (Oper. Res., 2001)

Cutting planes in integer and mixed integer programming. - Hugues Marchand; Alexander Martin 001; Robert Weismantel; Laurence A. Wolsey (Discret. Appl. Math., 2002)

Dynamic knapsack sets and capacitated lot-sizing. - Marko Loparic; Hugues Marchand; Laurence A. Wolsey (Math. Program., 2003)