Etude et mise en œuvre d'approches polyédriques pour la résolution de programmes en nombres entiers ou mixtes généraux

[1]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[2]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[3]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[4]  Claude-Alain Burdet.  Enumerative inequalities in integer programming , 1972, Math. Program..

[5]  Egon Balas,et al.  Integer programming and convex analysis: Intersection cuts from outer polars , 1972, Math. Program..

[6]  Fred W. Glover.  Cut search methods in integer programming , 1972, Math. Program..

[7]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[8]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[9]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[10]  Eitan Zemel,et al.  Lifting the facets of zero–one polytopes , 1978, Math. Program..

[11]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .

[12]  Alexander Schrijver,et al.  On Cutting Planes , 1980 .

[13]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[14]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[15]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[16]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[17]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[18]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[19]  Laurence A. Wolsey,et al.  Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..

[20]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[21]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[22]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[23]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[24]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[25]  Ellis L. Johnson,et al.  Optimizing nuclear power plant refueling with mixed-integer programming , 1997 .

[26]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[27]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[28]  Egon Balas.  Projection with a Minimal System of Inequalities , 1998, Comput. Optim. Appl..

[29]  Gábor Pataki,et al.  Solving Integer and Disjunctive Programs by Lift and Project , 1998, IPCO.

[30]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..

[31]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[32]  Friedrich Eisenbrand,et al.  NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..

[33]  Modelisation et resolution d'un probleme d'affectation d'equipages en transport aerien , 2001 .

[34]  Ralf Borndörfer,et al.  Discrete relaxations of combinatorial programs , 2001, Discret. Appl. Math..

[35]  Gérard Cornuéjols,et al.  Elementary closures for integer programs , 2001, Oper. Res. Lett..

[36]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[37]  Egon Balas,et al.  Generating Cuts from Multiple-Term Disjunctions , 2001, IPCO.

[38]  Arnaud Knippel.  Modeles et algorithmes de multiflots a cout discontinu pour l'optimisation de reseaux de telecommunications , 2001 .

[39]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[40]  Egon Balas,et al.  Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..

[41]  Eddie Cheng,et al.  Antiweb-wheel inequalities and their separation problems over the stable set polytopes , 2002, Math. Program..

[42]  Egon Balas,et al.  Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..

[43]  Andrea Lodi,et al.  Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..

[44]  Michel Minoux,et al.  A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems , 2002, Oper. Res. Lett..

[45]  Alberto Caprara,et al.  On the separation of split cuts and related inequalities , 2003, Math. Program..

[46]  Gérard Cornuéjols,et al.  K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau , 2003, INFORMS J. Comput..