50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art von Jünger, Michael, Liebling, Thomas M, Naddef, Denis, Nemhauser, George L, Pulleyblank, William R

Volltext

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions von Jünger, Michael, Naddef, Denis

Volltext

Greedy approach and multi-criteria simulated annealing for the car sequencing problem von Briant, Olivier, Naddef, Denis, Mounié, Grégory

Volltext

The hirsch conjecture is true for (0, 1)-polytopes von Naddef, Denis

Volltext

The Optimal Diversity Management Problem von Briant, Olivier, Naddef, Denis

Volltext

Greedy approach and multi-criteria simulated annealing for the car sequencing problem : The car sequencing problem von BRIANT, Olivier, NADDEF, Denis, MOUNIE, Grégory

Volltext

Lagrangian Relaxation von Lemaréchal, Claude

Volltext

One-pass batching algorithms for the one-machine problem von Naddef, Denis, Santos, Cipriano

Volltext

The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation von Naddef, Denis, Rinaldi, Giovanni

Volltext

Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation von NADDEF, Denis, THIENEL, Stefan

Volltext

TSP Cuts Which Do Not Conform to the Template Paradigm von Applegate, David, Bixby, Robert, Chvátal, Vašek, Cook, William

Volltext

Traces of the XII Aussois Workshop on Combinatorial Optimization von Jünger, Michael, Liebling, Thomas M., Naddef, Denis, Pulleyblank, William R., Reinelt, Gerhard, Rinaldi, Giovanni, Wolsey, Laurence A.

Volltext

A remark on “Integer linear programming formulation for a Vehicle Routing Problem” by N.R. Achutan and L. Caccetta, or how to use the Clark & Wright savings to write such integer l... von Naddef, Denis

Volltext

The domino inequalities: facets for the symmetric traveling salesman polytope von NADDEF, Denis, WILD, Emmanuel

Volltext

Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities von NADDEF, Denis, THIENEL, Stefan

Volltext

The traveling Salesman problem on a graph and some related integer polyhedra von CORNUEJOLS, G, FONLUPT, J, NADDEF, D

Volltext

Combinatorial optimization: theory and computation : The aussois workshop 2004 von LIEBLING, Thomas M, NADDEF, Denis, WOLSEY, Laurence A

Volltext

The Symmetric Traveling Salesman Polytope Revisited von Naddef, Denis, Pochet, Yves

Volltext

The Hungarian Method for the Assignment Problem von Kuhn, Harold W.

Volltext

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems von Pochet, Yves

Volltext