The unit capacity pickup and delivery problem on a one-way loop

zbMath0551.90066MaRDI QIDQ800829

P. S. Sundararaghavan

Publication date: 1984

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

travelling salesmanoptimal solutionpolynomial timepickups and deliveriesone-way looprelaxed assignment problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization