Extremal bottleneck routing problem with constraints in the form of precedence conditions

DOI10.1134/S0081543808060047zbMath1180.90019MaRDI QIDQ735643

D. Kharzeev

Publication date: 23 October 2009

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

dynamic program; minimax routing; procedure constraints

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization

90C39: Dynamic programming