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

DOI10.1134/S1064230710020097zbMATH Open1308.90211OpenAlexW1983404237MaRDI QIDQ2017557FDOQ2017557

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)

Cites Work

• Title not available (Why is that?)
• Dynamic programming method in the generalized courier problem
• The iterations method in generalized courier problem with singularity in the definition of cost functions
• Title not available (Why is that?)

Cited In (9)

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

This page was built for publication: A generalized Courier problem with the cost function depending on the list of tasks

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