Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
type: Item
instance of: scholarly article
title: Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
zbMATH Open document ID: 0915.90213
DOI: 10.1016/0377-2217(95)00240-5
author: Monia Bellalouna
author: C. Murat
author: Vangelis Th. Paschos
published in: European Journal of Operational Research
publication date: 1999-07-05T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1175103
zbMATH Keywords: graph theory
zbMATH Keywords: heuristics
zbMATH Keywords: traveling salesman
zbMATH Keywords: independent set
zbMATH Keywords: probabilistic combinatorial optimization
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00240-5
OpenAlex ID: W2014736580
cites work: A characterization of linear admissible transformations for the m- travelling salesmen problem
cites work: Traveling Salesman Facility Location Problems
cites work: The probabilistic minimum spanning tree problem
cites work: A Priori Optimization
cites work: Q3682518
cites work: Q4198056
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Shortest path problems with node failures
cites work: Q3799802
cites work: Q3677509
cites work: A priori optimization for the probabilistic maximum independent set problem
cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability
description: scientific article; zbMATH DE number 1175103