Choose an application

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

Traveling salesman problem.

Choose an application

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

Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.

Combinatorial optimization --- Traveling-salesman problem --- Optimisation combinatoire --- Problème du voyageur de commerce --- 519.688 --- 681.3*616 --- 681.3*622 --- TSP (Traveling salesman problem) --- Graph theory --- Vehicle routing problem --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- 519.688 Programs and algorithms for computer solution of specific problems --- Programs and algorithms for computer solution of specific problems --- Computerwetenschap--?*616 --- Computerwetenschap--?*622 --- Operational research. Game theory --- Combinatorial optimization. --- Traveling-salesman problem. --- Combinations. --- Mathematical optimization. --- Combinaisons (mathématiques) --- Optimisation mathématique. --- Traveling salesman problem. --- Problème du voyageur de commerce. --- Optimisation combinatoire. --- Problème du voyageur de commerce.

Choose an application

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

The Vehicle Routing Problem (VRP) has been an especially active and fertile area of research. Over the past five to seven years, there have been numerous technological advances and exciting challenges that are of considerable interest to students, teachers, and researchers. The Vehicle Routing Problem: Latest Advances and New Challenges will focus on a host of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and variants. New approaches for solving VRPs have been developed from important methodological advances. These developments have resulted in faster solution algorithms, more accurate techniques, and an improvement in the ability to solve large-scale, complex problems. The book will systematically examine these recent developments in the VRP and provide the following in a unified and carefully developed presentation: Present novel problems that have arisen in the vehicle routing domain and highlight new challenges for the field; Present significant methodological advances or new approaches for solving existing vehicle routing problems; Summarize the most significant research results for the vehicle routing problem and its variants from 2000 to the present. .

Vehicle routing problem. --- Transportation problems (Programming) --- Delivery of goods --- Mathematical models. --- Store delivery services --- Transportation --- Parcel post --- Shipment of goods --- VRP (Vehicle routing problem) --- Combinatorial optimization --- Traveling salesman problem --- Transport problems (Programming) --- Linear programming --- Road traffic --- Operational research. Game theory --- 519.8 --- 681.3*G22 --- 519.8 Operational research --- Operational research --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Operations research. --- Engineering mathematics. --- Mathematics. --- Engineering economy. --- Production management. --- Operations Research/Decision Theory. --- Mathematical and Computational Engineering. --- Applications of Mathematics. --- Operations Research, Management Science. --- Engineering Economics, Organization, Logistics, Marketing. --- Operations Management. --- Manufacturing management --- Industrial management --- Economy, Engineering --- Engineering economics --- Industrial engineering --- Math --- Science --- Engineering --- Engineering analysis --- Mathematical analysis --- Operational analysis --- Management science --- Research --- System theory --- Mathematics --- Decision making. --- Applied mathematics. --- Management science. --- Engineering economics. --- Quantitative business analysis --- Management --- Problem solving --- Operations research --- Statistical decision --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management decisions --- Choice (Psychology) --- Decision making --- Engineering—Data processing. --- Industrial Management. --- Operations Research and Decision Theory. --- Mathematical and Computational Engineering Applications. --- Operations Research, Management Science . --- Business administration --- Business enterprises --- Business management --- Corporate management --- Corporations --- Industrial administration --- Management, Industrial --- Rationalization of industry --- Scientific management --- Business --- Industrial organization

Choose an application

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

The history of mathematics is filled with major breakthroughs resulting from solutions to recreational problems. Problems of interest to gamblers led to the modern theory of probability, for example, and surreal numbers were inspired by the game of Go. Yet even with such groundbreaking findings and a wealth of popular-level books exploring puzzles and brainteasers, research in recreational mathematics has often been neglected. The Mathematics of Various Entertaining Subjects brings together authors from a variety of specialties to present fascinating problems and solutions in recreational mathematics. Contributors to the book show how sophisticated mathematics can help construct mazes that look like famous people, how the analysis of crossword puzzles has much in common with understanding epidemics, and how the theory of electrical circuits is useful in understanding the classic Towers of Hanoi puzzle. The card game SET is related to the theory of error-correcting codes, and simple tic-tac-toe takes on a new life when played on an affine plane. Inspirations for the book's wealth of problems include board games, card tricks, fake coins, flexagons, pencil puzzles, poker, and so much more. Looking at a plethora of eclectic games and puzzles, The Mathematics of Various Entertaining Subjects is sure to entertain, challenge, and inspire academic mathematicians and avid math enthusiasts alike.

Mathematical recreations. --- Mathematical recreations --- Research. --- Mathematical puzzles --- Number games --- Recreational mathematics --- Recreations, Mathematical --- Puzzles --- Scientific recreations --- Games in mathematics education --- Magic squares --- Magic tricks in mathematics education --- Mathematics. --- Mathematic --- Amazing Asteroid. --- Atoll. --- Begird. --- Bernstein's Bijection. --- Chromatic Combat. --- Cookie Monster number. --- Cookie Monster. --- Devious Dice. --- Eluding Execution. --- EndGame. --- Fibonacci sequence. --- Flipping Fun. --- Flush. --- Full House. --- Get the Giraffe. --- Gilbreath numbers. --- Gilbreath permutations. --- Graeco-Latin squares. --- Hamming weight. --- Heartless Poker. --- Hex. --- Knop's puzzle. --- Leonhard Euler. --- Norman Gilbreath. --- SET. --- Sperner's Lemma. --- Straight. --- Super-n-nacci sequence. --- The Game of Y. --- The New York Times. --- Tower of Hanoi. --- Traveling Salesman Problem. --- Tribonacci sequence. --- Zeckendorf representation. --- advanced mathematics. --- affine plane. --- affine planes. --- algorithms. --- baseball. --- card effects. --- card games. --- card moves. --- card tricks. --- chess. --- coding theory. --- coin-weighing puzzles. --- connection games. --- continued fractions. --- cookies. --- coupling. --- crossword networks. --- crossword puzzle difficulty. --- crossword puzzles. --- decomposition. --- delta-to-wye transformation. --- dissection puzzles. --- divination puzzles. --- dualism. --- electrical power distribution. --- epidemics. --- error correction. --- error detection. --- error-correcting codes. --- find-and-label problem. --- flexagons. --- folding puzzles. --- game-theoretic perspective. --- generalizations. --- generator assignment. --- graphical objects. --- group structures. --- ice cream trick. --- infinite families. --- iterative stochastic process. --- just-find problem. --- linear code. --- magic tricks. --- mathematical exhibits. --- mathematical puzzles. --- maze design. --- mazes. --- minimum spanning tree. --- multiple-pans problem. --- museums. --- n-nacci sequence. --- network properties. --- network structure. --- one-move puzzles. --- packing puzzles. --- parallel scales. --- parallel weighing problem. --- period-four move. --- period-four principles. --- phyllotactic mazes. --- playing cards. --- poker. --- probability. --- random graph process. --- random moves. --- random walks. --- rearrangement puzzles. --- recreational mathematics. --- recreational problems. --- seeded stippling. --- simple objects. --- simplex. --- squash. --- surreal numbers. --- symmetries. --- tetraflexagons. --- tic-tac-toe. --- unique solutions. --- vortex tiles. --- weighing puzzles. --- winning strategies.