Titlebook: Integer Programming and Combinatorial Optimization; 11th International I Michael Jünger,Volker Kaibel Conference proceedings 2005 Springer-

Heart-Rate

On the Inefficiency of Equilibria in Congestion Games,ich the equilibrium travel times are within reasonable limits of the free-flow travel times. These tighter bounds help to explain empirical observations in vehicular traffic networks. Our analysis holds in the more general context of congestion games, which provides the framework in which we describe this work.

善辯

painkillers

Mixed-Integer Cuts from Cyclic Groups,m the individual rows of an optimal LP tableau, thus approximating the optimization over the so-called Gomory’s Corner polyhedron. The computed bound is compared with that obtained when only Gomory mixed-integer cuts are used, on a large test-bed of MIPLIB instances.

沙漠

Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials,it refines the hierarchy of Lovász and Schrijver, and de Klerk and Pasechnik conjecture that their hierarchy also finds the stability number after .(.) steps. We prove this conjecture for graphs with stability number at most 8 and we show that the hierarchy of Lasserre refines the hierarchy of de Klerk and Pasechnik.