Searching for combinatorial problems : 4 results found | RSS Feed for this search

Description

This course offers an introduction to optimization problems, algorithms, and their complexity, emphasizing basic methodologies and the underlying mathematical structures. The main topics covered include: Theory and algorithms for linear programming Network flow problems and algorithms Introduction to integer programming and combinatorial problems This course offers an introduction to optimization problems, algorithms, and their complexity, emphasizing basic methodologies and the underlying mathematical structures. The main topics covered include: Theory and algorithms for linear programming Network flow problems and algorithms Introduction to integer programming and combinatorial problems

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

Click to get HTML | Click to get attribution | Click to get URL

Description

Imagine you are a salesman needing to visit 100 cities connected by a set of roads. Can you do it while stopping in each city only once? Even a supercomputer working at 1 trillion operations per second would take longer than the age of the universe to find a solution when considering each possibility in turn. In 1994, Leonard Adleman published a paper in which he described a solution, using the tools of molecular biology, for a smaller 7-city example of this problem. His paper generated enormous scientific and public interest, and kick-started the field of Biological Computing, the main subject of this discussion based seminar course. Students will analyze the Adleman paper, and the papers that preceded and followed it, with an eye for identifying the engineering and scientific aspects of Imagine you are a salesman needing to visit 100 cities connected by a set of roads. Can you do it while stopping in each city only once? Even a supercomputer working at 1 trillion operations per second would take longer than the age of the universe to find a solution when considering each possibility in turn. In 1994, Leonard Adleman published a paper in which he described a solution, using the tools of molecular biology, for a smaller 7-city example of this problem. His paper generated enormous scientific and public interest, and kick-started the field of Biological Computing, the main subject of this discussion based seminar course. Students will analyze the Adleman paper, and the papers that preceded and followed it, with an eye for identifying the engineering and scientific aspects of

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

Click to get HTML | Click to get attribution | Click to get URL

Description

This course offers an introduction to optimization problems, algorithms, and their complexity, emphasizing basic methodologies and the underlying mathematical structures. The main topics covered include: Theory and algorithms for linear programming Network flow problems and algorithms Introduction to integer programming and combinatorial problems

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

Click to get HTML | Click to get attribution | Click to get URL

Description

Imagine you are a salesman needing to visit 100 cities connected by a set of roads. Can you do it while stopping in each city only once? Even a supercomputer working at 1 trillion operations per second would take longer than the age of the universe to find a solution when considering each possibility in turn. In 1994, Leonard Adleman published a paper in which he described a solution, using the tools of molecular biology, for a smaller 7-city example of this problem. His paper generated enormous scientific and public interest, and kick-started the field of Biological Computing, the main subject of this discussion based seminar course. Students will analyze the Adleman paper, and the papers that preceded and followed it, with an eye for identifying the engineering and scientific aspects of

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from