作者: Pál Ruján
DOI: 10.1007/978-3-662-04804-7_3
关键词: Travelling salesman problem 、 Convex hull 、 Simple (abstract algebra) 、 Combinatorial optimization 、 Applied mathematics 、 Quadratic programming 、 Bayesian probability 、 Maxima and minima 、 Computer science 、 Bayesian inference
摘要: Combinatorial optimization deals with algorithms for finding extrema of functions subject to a (possibly large) number constraints. Bayesian inference also requires averages over such extrema. In this chapter we show how simple dynamic systems like billiards can be used find solutions problems. The topics covered are linear and quadratic programming, classification, mixture