Home PageHome Page
Rensselaer Polytechnic Institute (RPI) * Why not change the world?
Welcome to Rensselaer Polytechnic Institute
Home About RPI Academics & Research Student Life Admission News & Information
*
*
Home > Academics & Research > Courses > DSES > DSES-6760
Academics
Faculty
Undergraduate Majors and Degrees
Graduate Programs and Degrees
Interdisciplinary Programs
Educational Programs and Resources
Education for Working Professionals
Rensselaer Research Libraries
Academic & Research Computing
Catalog
Academic Calendar
*
Research Centers
Rensselaer Faculty
Research Platforms & Resources
Research Priorities
Undergraduate Research Program
Office of the Vice President for Research
*
*
* * *

DSES-6760

Combinatorial Optimization and Integer Programming

Review of exact and heuristic methods for solving discrete problems, including the traveling salesman problem, the knapsack problem, packing and covering problems. Algorithm complexity and NP-completeness, cutting plane methods and polyhedral theory, branch and bound, simulated annealing, tabu search, Lagrangian duality. (Cross listed as MATP-6620. Students cannot obtain credit for both this course and MATP-6620.) Prerequisites: DSES-4770 (MATP-4700). Spring term odd-numbered years.

4 credit hours
* *
* *
*
* RPI Home Feedback Form Privacy Policy Media Policy Copyright Notice *
*
Rensselaer Polytechnic Institute (RPI), 110 8th St., Troy, NY 12180. (518) 276-6000
RPI Copyright © 1996–2005 Rensselaer Polytechnic Institute. All rights reserved worldwide.
Why not change the world?(SM) is a service mark of Rensselaer Polytechnic Institute.