Lift-and-project methods and relaxations for Knapsack

Optimisation problems involving polynomials arise in a wide variety of contexts, including operational research, statistics, probability, finance, computer science, structural engineering, statistical physics, combinatorial chemistry, computational biology and algorithmic graph theory. They are however extremely challenging to solve, both in theory and practice. Existing algorithms and software are capable of solving only very small instances to proven optimality, unless they have some amenable structure, such as sparsity or convexity.

Read more at: http://www.newton.ac.uk/programmes/POP/

Optimisation problems involving polynomials arise in a wide variety of contexts, including operational research, statistics, probability, finance, computer science, structural engineering, statistical physics, combinatorial chemistry, computational biology and algorithmic graph theory. They are however extremely challenging to solve, both in theory and practice. Existing algorithms and software are capable of solving only very small instances to proven optimality, unless they have some amenable structure, such as sparsity or convexity. Read more at: http://www.newton.ac.uk/programmes/POP/

Share Lift-and-project methods and relaxations for Knapsack

Sign up to save your podcasts

Lift-and-project methods and relaxations for Knapsack

Lift-and-project methods and relaxations for Knapsack

More shows like Polynomial Optimisation

Philosophy

Public Lectures from the Faculty of Law, University of Cambridge

Faculty of Classics

Mathematics for the Fluid Earth

LCIL International Law Centre Podcast

Medieval History Seminars

Social and Developmental Psychology Seminar Series

Things Seminar

The Fitzwilliam Museum Podcasts

The Stanton Lectures 2012-13