ON SOME MATCHING PROBLEMS ARISING IN VEHICLE SCHEDULING MODELS

被引：168

作者：

BERTOSSI, AA

CARRARESI, P

GALLO, G

机构：

来源：

关键词：

D O I：

10.1002/net.3230170303

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：271 / 281

页数：11

共 7 条

[1] CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].

BODIN, L ;

GOLDEN, B .

CARRARESI, P ;

GALLO, G ;

ROUSSEAU, JM .

[3] NETWORK MODELS FOR VEHICLE AND CREW SCHEDULING [J].

CARRARESI, P ;

GALLO, G .

[4]

Garey MR., 1979, COMPUTERS INTRACTABI

[5] COMPLEXITY OF VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].

LENSTRA, JK ;

KAN, AHGR .

[6] THE COMPLEXITY OF RESTRICTED SPANNING TREE PROBLEMS [J].

PAPADIMITRIOU, CH ;

YANNAKAKIS, M .

[7]

Tarjan R. E., 1983, DATA STRUCTURES NETW, DOI [10.1137/1.9781611970265, DOI 10.1137/1.9781611970265]