Browsing Sloan School of Management by Subject "0/1-Integer Programming"

Now showing items 1-1 of 1

    • Approximate Local Search in Combinatorial Optimization 

      Orlin, James B.; Punnen, Abraham P.; Schulz, Andreas S. (2003-08-15)
      Local search algorithms for combinatorial optimization problems are in general of pseudopolynomial running time and polynomial-time algorithms are often not known ...