机读格式显示(MARC)

• 000 01270nam2 2200301 4500

• 000 0000276186

• 001 0000224219

• 005 20111127200913.0

• 010 __ |a 978-7-302-24494-3 |d CNY50.00

• 100 __ |a 20111127d2011 em y0chiy50 ea

• 101 0_ |a chi

• 102 __ |a CN |b 110000

• 105 __ |a ak z 000yy

• 106 __ |a r

• 200 1_ |a 车辆路径问题 |A The Vehicle Routing Problem |f （美）托夫主编

• 210 __ |a 北京 |c 清华大学出版社 |d 2011

• 215 __ |a 367页 |c 图 |d 26cm

• 300 __ |a 国际著名数学图书--影印版

• 330 __ |a 《车辆路径问题(影印版)》内容简介：in the field of combinatorial optimization problems, the vehicle routing problem (vrp) is one of the most challenging. defined more than 40 years ago, the problem involves designing the optimal set of routes for fleets of vehicles for the purpose of serving a given set of customers . interest in vrp is motivated by its practical relevance as well as its considerable difficulty.

• 606 0_ |物 流 |x 车辆 |y 运输调度 |j 英文

• 690 __ |a F253.4 |v 4

• 701 _0 |a 托夫 |A tuo fu |4 主编

• 801 _0 |a CN |b |c 20111127

• 905 __ |a DQNU |d F253.4/T94

• 909 __ |a 00972909 |b 平装 |f F253.4/T94 |x YBS |e 001 |j 01

• 991 __

• 995 __ |a DQNU |b 00972909 |f F253.4/T94 |s 1

• 999 __ |t C |A shsd2 |a 20111127 20:01:12 |M shsd2 |m 20111127 20:09:1