Jan 02, 2025  
Rensselaer Catalog 2024-2025 
    
Catalog Navigation
  Catalog Home
  Academic Calendar
  Degrees Offered
  Degree Types
  Information Directory
  Rensselaer in Brief
  Core Curriculum
  Educational Programs and Resources
  Research Resources and Centers
  Student Life
  Financial Aid
  Admissions
  Tuition and Fees
  Programs
  Academic Information and Regulations
  Schools
  Departments
  Subject Codes
  Courses
  Administration
  Named Professorships
  The Faculty
  My Portfolio
HELP
Rensselaer Catalog 2024-2025
Add to Portfolio (opens a new window)

MATP 6620 - Integer and Combinatorial Optimization

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, Lagrangian duality, liftings, metaheuristics.

Prerequisites/Corequisites: Prerequisites: MATH 2010  and MATP 4700  or equivalent or permission of instructor.

When Offered: Spring term odd-numbered years.

Cross Listed: ISYE 6760 . Students cannot obtain credit for both this course and ISYE 6760 .

Credit Hours: 4


Add to Portfolio (opens a new window)