Determination of optimal path under approach and exit constraints
type: Item
instance of: scholarly article
title: Determination of optimal path under approach and exit constraints
zbMATH Open document ID: 0998.90512
DOI: 10.1016/S0377-2217(98)00263-X
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1829882
zbMATH Keywords: combinatorial analysis
zbMATH Keywords: probabilistic programming
zbMATH Keywords: production
zbMATH Keywords: routing
zbMATH Keywords: traveling salesman
MaRDI profile type: Publication
cites work: The Traveling Salesman Problem: A Survey
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Approximate Traveling Salesman Algorithms
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Optimization by Simulated Annealing
cites work: Q5187226
cites work: Convergence of an annealing algorithm
cites work: Equation of State Calculations by Fast Computing Machines
full work available at URL: s0377-2217(98)00263-x
OpenAlex ID: W2053729728
description: scientific article; zbMATH DE number 1829882