scientific article
From MaRDI portal
Publication:3074625
zbMath1206.90097MaRDI QIDQ3074625
Publication date: 9 February 2011
Full work available at URL: http://www.science.az/acm/v9n2pdf/162-175.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Nonlinear programming (90C30) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ Temperature field optimization for laser powder bed fusion as a traveling salesperson problem with history ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly ⋮ On one routing problem modeling movement in radiation fields
This page was built for publication:
