May 11, 2025  
Rensselaer Catalog 2007-2008 
    
Catalog Navigation
  Catalog Home
  Degrees Offered
  Academic Calendar
  Information Directory
  Rensselaer in Brief
  Educational Programs and Resources
  Research Resources and Centers
  Student Life
  Admissions
  Financial Aid
  Tuition and Fees
  Academic Information and Regulations
  Interdisciplinary Studies
  Schools & Departments
  Schools
  Departments
  Programs
  Subject Codes
  Courses
  Administration
  Named Professorships
  The Faculty
  My Portfolio
HELP
Rensselaer Catalog 2007-2008 [Archived Catalog]

Add to Portfolio (opens a new window)

MATP 6620 - Combinatorial Optimization and Integer Programming

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.

Prerequisites/Corequisites: Prerequisite: MATP 4700 or DSES 4770.

When Offered: Spring term odd-numbered years.



Cross Listed: (Cross listed as DSE 6760. Students cannot obtain credit for both this course and DSES 6760.)

Credit Hours: 4


Add to Portfolio (opens a new window)