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

DOI10.1134/S0081543808060047zbMATH Open1180.90019OpenAlexW1965582140MaRDI QIDQ735643FDOQ735643

D. Kharzeev

Publication date: 23 October 2009

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

Full work available at URL: https://doi.org/10.1134/s0081543808060047

zbMATH Keywords

dynamic programminimax routingprocedure constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)

Cited In (5)

• Elements of dynamic programming in extremal routing problems
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• Dynamic programming method in extremal constrained routing problems
• Dynamic programming method in the generalized courier problem

This page was built for publication: Extremal bottleneck routing problem with constraints in the form of precedence conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735643)