A generalized Courier problem with the cost function depending on the list of tasks

DOI10.1134/S1064230710020097zbMath1308.90211OpenAlexW1983404237MaRDI QIDQ2017557

Yanyan Li

Publication date: 23 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A model variant of the problem about radiation sources utilization (iterations based on optimization insertions), Dynamic programming method in extremal constrained routing problems, Dynamic programming in the routing problem with constraints and costs depending on a list of tasks, Elements of dynamic programming in extremal routing problems, On an iterative procedure for solving a routing problem with constraints, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, Dynamic programming in the routing problem with complex dependence of costs on the list of jobs

Cites Work

• Dynamic programming method in the generalized courier problem
• The iterations method in generalized courier problem with singularity in the definition of cost functions
• Unnamed Item
• Unnamed Item