Narrow your search

Library

KU Leuven (2)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

ULiège (1)

VIVES (1)

VUB (1)


Resource type

book (2)


Language

English (2)


Year
From To Submit

2011 (1)

2006 (1)

Listing 1 - 2 of 2
Sort by
The Traveling Salesman Problem
Authors: --- ---
ISBN: 1283256118 9786613256119 1400841100 9781400841103 0691129932 9780691129938 9781283256117 Year: 2011 Publisher: Princeton, NJ

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Keywords

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).


Book
Information science
Author:
ISBN: 1282608045 9786612608049 1400829283 Year: 2006 Publisher: Princeton ; Oxford : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

From cell phones to Web portals, advances in information and communications technology have thrust society into an information age that is far-reaching, fast-moving, increasingly complex, and yet essential to modern life. Now, renowned scholar and author David Luenberger has produced Information Science, a text that distills and explains the most important concepts and insights at the core of this ongoing revolution. The book represents the material used in a widely acclaimed course offered at Stanford University. Drawing concepts from each of the constituent subfields that collectively comprise information science, Luenberger builds his book around the five "E's" of information: Entropy, Economics, Encryption, Extraction, and Emission. Each area directly impacts modern information products, services, and technology--everything from word processors to digital cash, database systems to decision making, marketing strategy to spread spectrum communication. To study these principles is to learn how English text, music, and pictures can be compressed, how it is possible to construct a digital signature that cannot simply be copied, how beautiful photographs can be sent from distant planets with a tiny battery, how communication networks expand, and how producers of information products can make a profit under difficult market conditions. The book contains vivid examples, illustrations, exercises, and points of historic interest, all of which bring to life the analytic methods presented: Presents a unified approach to the field of information science Emphasizes basic principles Includes a wide range of examples and applications Helps students develop important new skills Suggests exercises with solutions in an instructor's manual

Keywords

Information science. --- Information theory. --- Addition. --- Algorithm. --- Alice and Bob. --- Amplitude. --- Approximation. --- Bandwidth (signal processing). --- Bibliography. --- Binary code. --- Binary number. --- Binary search tree. --- Binary tree. --- Bit. --- Block code. --- Bubble sort. --- Caesar cipher. --- Calculation. --- Channel capacity. --- Cipher. --- Ciphertext. --- Comma code. --- Commodity. --- Common knowledge (logic). --- Competition. --- Computation. --- Computer. --- Conditional entropy. --- Conditional probability. --- Consideration. --- Consumer. --- Cryptanalysis. --- Cryptogram. --- Cryptography. --- Customer. --- Data mining. --- Data structure. --- Database. --- Demand curve. --- Digital signature. --- Discounts and allowances. --- Economic surplus. --- Encryption. --- Estimation. --- Expected value. --- Fourier series. --- Fourier transform. --- Frequency analysis. --- Functional dependency. --- Heapsort. --- Huffman coding. --- Hyperplane. --- Information retrieval. --- Insertion sort. --- Instance (computer science). --- Integer. --- Inverted index. --- Key size. --- Letter frequency. --- Logarithm. --- Marginal cost. --- Measurement. --- Modulation. --- Notation. --- Nyquist–Shannon sampling theorem. --- One-time pad. --- Parity bit. --- Percentage. --- Pricing. --- Probability. --- Public-key cryptography. --- Quantity. --- Quicksort. --- Radio wave. --- Random variable. --- Ranking (information retrieval). --- Requirement. --- Result. --- Run-length encoding. --- Shift register. --- Sine wave. --- Sorting algorithm. --- Special case. --- Spectral density. --- Spreadsheet. --- Standard deviation. --- Subset. --- Substitution cipher. --- Summation. --- Technology. --- Theorem. --- Theory. --- Time complexity. --- Transmitter. --- Transposition cipher. --- Tree (data structure). --- Tuple. --- Uncertainty. --- Value (economics). --- Word (computer architecture).

Listing 1 - 2 of 2
Sort by