pesquisa de livros
livros
Doar
Entrar
Entrar
para acessar mais recursos:
Recomendações pessoais
Telegram bot
Baixar histórico
Enviar para o E-mail ou Kindle
gerenciar as listas de livros
salvar para os favoritos
Pessoal
Pedidos de livro
Explorar
Z-Recomendado
Coleções de livros
Mais populares
Categorias
Contribuição
Doar
Carregamentos
Litera Library
Doe livros de papel
Adicione livros de papel
Search paper books
Meu LITERA Point
Pesquisa de termos
Main
Pesquisa de termos
search
1
The Traveling Salesman Problem: A Computational Study
Princeton University Press
David L. Applegate
,
Robert E. Bixby
,
Vašek Chvátal
,
William J. Cook
tsp
algorithm
september
tspbook
edges
solution
figure
optimal
instances
edge
inequalities
cuts
method
inequality
sets
tours
cutting
search
linear
vertex
programming
branch
subtour
graph
padberg
salesman
vertices
algorithms
traveling
heuristic
integer
kernighan
dual
vector
path
plane
comb
separation
finding
approach
branching
computation
consider
simplex
concorde
relaxation
computational
johnson
convex
solutions
Ano:
2011
Idioma:
english
Arquivo:
PDF, 15.39 MB
As suas tags:
0
/
0
english, 2011
2
The Traveling Salesman Problem: A Computational Study
Princeton University Press
David L. Applegate & Robert E. Bixby & Vasek Chvátal & William J. Cook [Applegate
,
David L. & Bixby
,
Robert E. & Chvátal
,
Vasek & Cook
,
William J.]
tsp
algorithm
september
tspbook
edges
solution
figure
optimal
instances
edge
inequalities
cuts
method
inequality
sets
cutting
tours
search
linear
vertex
programming
branch
subtour
graph
padberg
salesman
vertices
algorithms
kernighan
traveling
heuristic
plane
integer
dual
vector
comb
separation
path
finding
branching
approach
computation
concorde
simplex
consider
johnson
relaxation
solutions
computational
convex
Ano:
2006
Idioma:
english
Arquivo:
EPUB, 1.61 MB
As suas tags:
0
/
0
english, 2006
3
The Traveling Salesman Problem
Princeton University Press
David L. Applegate
,
Robert E. Bixby
,
Vašek Chvátal
,
William J. Cook
tsp
algorithm
september
tspbook
edges
solution
figure
optimal
instances
edge
inequalities
cuts
method
inequality
sets
tours
cutting
search
linear
vertex
programming
branch
subtour
graph
padberg
salesman
vertices
algorithms
traveling
heuristic
integer
kernighan
dual
vector
path
plane
comb
separation
finding
approach
branching
computation
consider
simplex
concorde
computational
relaxation
johnson
convex
solutions
Ano:
2011
Idioma:
english
Arquivo:
PDF, 31.43 MB
As suas tags:
0
/
0
english, 2011
4
The traveling salesman problem: a computational study
Princeton University Press
David L. Applegate
tsp
algorithm
september
tspbook
edges
solution
figure
optimal
instances
edge
inequalities
cuts
method
inequality
sets
tours
cutting
search
linear
vertex
programming
branch
subtour
graph
padberg
salesman
vertices
algorithms
traveling
heuristic
integer
kernighan
dual
vector
path
plane
comb
separation
finding
approach
branching
computation
consider
simplex
concorde
relaxation
computational
johnson
convex
solutions
Ano:
2006
Idioma:
english
Arquivo:
PDF, 31.03 MB
As suas tags:
0
/
0
english, 2006
1
Siga a
este link
ou encontre o bot "@BotFather" no Telegram
2
Send /equipe newbot
3
Indique o nome para o seu chatbot
4
Escolha um nome de usuário para um bot
5
Copia a última mensagem de BotFather e insira-a aqui
×
×