Algoritmy optimizacii na setjah i grafah /
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Knjiga |
| Jezik: | Russian English |
| Izdano: |
Moskva :
Mir,
1981.
|
| Teme: |
mrežno programiranje
> teorija grafov
> optimizacijski algoritmi
> problem trgovskega potnika
> problem najkrajših poti
> kombinatorična optimzacija
> računske metode
> logistika
network programming
> spanning tree
> maximum branching
> flows in networks
> matching
> covering
> traveling salesman problem
> Chinese postman problem
> elementary exposition
> network flow problems
> location analysis
> project networks
> shortest paths problems
> greedy algorithm
> out-of-kilter algorithm
> branch-and-bound method
> heuristics
> project planning
> CPM
> PERT
> combinatorial optimization
> computational methods
> logistics
|
| Oznake: |
Označite
Brez oznak, prvi označite!
|
| LEADER | 01563nam a2200265 i 4500 | ||
|---|---|---|---|
| 001 | 11474777 | ||
| 003 | SI-MaCOB | ||
| 005 | 20180105000000.0 | ||
| 008 | 020327s1981 ru a |||||||1|| ||rusoc | ||
| 041 | 1 | |a rus |h eng | |
| 080 | |a 519.1 | ||
| 084 | |a 90C35 |a 90-01 |a 05C35 |a 90B10 |a 65K05 |a 90C05 |a 90B35 |a 90B05 |2 MSC 2000 | ||
| 100 | 1 | |a Minieka, Edward. |4 aut | |
| 240 | 1 | 0 | |a Optimization algorithms for networks and graphs |
| 245 | 0 | 0 | |a Algoritmy optimizacii na setjah i grafah / |c È. Majnika ; perevod s anglijskogo M. B. Kacnel'sona i M. I. Rubinštejna ; pod redakciej E. K. Maslovskogo. |
| 246 | 3 | |a Optimization algorithms for networks and graphs | |
| 260 | |a Moskva : |b Mir, |c 1981. | ||
| 300 | |a 323 str. : |b graf. prikazi ; |c 22 cm. | ||
| 500 | |a Cir. | ||
| 500 | |a Prevod dela: Optimization algorithms for networks and graphs. | ||
| 504 | |a Bibliografija: str. 318. | ||
| 504 | |a Kazalo. | ||
| 653 | 0 | |a mrežno programiranje |a teorija grafov |a optimizacijski algoritmi |a problem trgovskega potnika |a problem najkrajših poti |a kombinatorična optimzacija |a računske metode |a logistika | |
| 653 | 0 | |a network programming |a spanning tree |a maximum branching |a flows in networks |a matching |a covering |a traveling salesman problem |a Chinese postman problem |a elementary exposition |a network flow problems |a location analysis |a project networks |a shortest paths problems |a greedy algorithm |a out-of-kilter algorithm |a branch-and-bound method |a heuristics |a project planning |a CPM |a PERT |a combinatorial optimization |a computational methods |a logistics | |
| 040 | |a MAKLJ |b slv |c SI-MaIIZ |d KTFMB |e ppiak | ||