Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.

Traveling salesman problem. --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem --- AT&T Labs. --- Accuracy and precision. --- Addition. --- Algorithm. --- Analysis of algorithms. --- Applied mathematics. --- Approximation algorithm. --- Approximation. --- Basic solution (linear programming). --- Best, worst and average case. --- Bifurcation theory. --- Big O notation. --- CPLEX. --- CPU time. --- Calculation. --- Chaos theory. --- Column generation. --- Combinatorial optimization. --- Computation. --- Computational resource. --- Computer. --- Connected component (graph theory). --- Connectivity (graph theory). --- Convex hull. --- Cutting-plane method. --- Delaunay triangulation. --- Determinism. --- Disjoint sets. --- Dynamic programming. --- Ear decomposition. --- Engineering. --- Enumeration. --- Equation. --- Estimation. --- Euclidean distance. --- Euclidean space. --- Family of sets. --- For loop. --- Genetic algorithm. --- George Dantzig. --- Georgia Institute of Technology. --- Greedy algorithm. --- Hamiltonian path. --- Hospitality. --- Hypergraph. --- Implementation. --- Instance (computer science). --- Institute. --- Integer. --- Iteration. --- Linear inequality. --- Linear programming. --- Mathematical optimization. --- Mathematics. --- Model of computation. --- Neuroscience. --- Notation. --- Operations research. --- Optimization problem. --- Order by. --- Pairwise. --- Parameter (computer programming). --- Parity (mathematics). --- Percentage. --- Polyhedron. --- Polytope. --- Pricing. --- Princeton University. --- Processing (programming language). --- Project. --- Quantity. --- Reduced cost. --- Requirement. --- Result. --- Rice University. --- Rutgers University. --- Scientific notation. --- Search algorithm. --- Search tree. --- Self-similarity. --- Simplex algorithm. --- Solution set. --- Solver. --- Source code. --- Special case. --- Stochastic. --- Subroutine. --- Subsequence. --- Subset. --- Summation. --- Test set. --- Theorem. --- Theory. --- Time complexity. --- Trade-off. --- Travelling salesman problem. --- Tree (data structure). --- Upper and lower bounds. --- Variable (computer science). --- Variable (mathematics).

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Extremely popular for statistical inference, Bayesian methods are also becoming popular in machine learning and artificial intelligence problems. Bayesian estimators are often implemented by Monte Carlo methods, such as the Metropolis–Hastings algorithm of the Gibbs sampler. These algorithms target the exact posterior distribution. However, many of the modern models in statistics are simply too complex to use such methodologies. In machine learning, the volume of the data used in practice makes Monte Carlo methods too slow to be useful. On the other hand, these applications often do not require an exact knowledge of the posterior. This has motivated the development of a new generation of algorithms that are fast enough to handle huge datasets but that often target an approximation of the posterior. This book gathers 18 research papers written by Approximate Bayesian Inference specialists and provides an overview of the recent advances in these algorithms. This includes optimization-based methods (such as variational approximations) and simulation-based methods (such as ABC or Monte Carlo algorithms). The theoretical aspects of Approximate Bayesian Inference are covered, specifically the PAC–Bayes bounds and regret analysis. Applications for challenging computational problems in astrophysics, finance, medical data analysis, and computer vision area also presented.

bifurcation --- dynamical systems --- Edward–Sokal coupling --- mean-field --- Kullback–Leibler divergence --- variational inference --- Bayesian statistics --- machine learning --- variational approximations --- PAC-Bayes --- expectation-propagation --- Markov chain Monte Carlo --- Langevin Monte Carlo --- sequential Monte Carlo --- Laplace approximations --- approximate Bayesian computation --- Gibbs posterior --- MCMC --- stochastic gradients --- neural networks --- Approximate Bayesian Computation --- differential evolution --- Markov kernels --- discrete state space --- ergodicity --- Markov chain --- probably approximately correct --- variational Bayes --- Bayesian inference --- Markov Chain Monte Carlo --- Sequential Monte Carlo --- Riemann Manifold Hamiltonian Monte Carlo --- integrated nested laplace approximation --- fixed-form variational Bayes --- stochastic volatility --- network modeling --- network variability --- Stiefel manifold --- MCMC-SAEM --- data imputation --- Bethe free energy --- factor graphs --- message passing --- variational free energy --- variational message passing --- approximate Bayesian computation (ABC) --- differential privacy (DP) --- sparse vector technique (SVT) --- Gaussian --- particle flow --- variable flow --- Langevin dynamics --- Hamilton Monte Carlo --- non-reversible dynamics --- control variates --- thinning --- meta-learning --- hyperparameters --- priors --- online learning --- online optimization --- gradient descent --- statistical learning theory --- PAC–Bayes theory --- deep learning --- generalisation bounds --- Bayesian sampling --- Monte Carlo integration --- PAC-Bayes theory --- no free lunch theorems --- sequential learning --- principal curves --- data streams --- regret bounds --- greedy algorithm --- sleeping experts --- entropy --- robustness --- statistical mechanics --- complex systems