A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem

DOI10.1007/s10255-008-8811-5zbMath1191.68336OpenAlexW1982197415MaRDI QIDQ2267269

Xi Xia, Jin-Chuan Cui

Publication date: 1 March 2010

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-008-8811-5

zbMATH Keywords

permutationscombinatorial optimizationcomplexity of computation\(N\)-vehicle probleminverse order

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Multitask \(n\)-vehicle exploration problem: complexity and algorithm ⋮ A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit ⋮ Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem ⋮ The efficient computation of aircraft range problem ⋮ A linear mixed integer programming model for \(N\)-vehicle exploration problem

Cites Work

• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
• A general heuristic for vehicle routing problems
• The vehicle routing problem. Latest advances and new challenges.
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Unnamed Item
• Unnamed Item

This page was built for publication: A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem