The computational complexity of the relative robust shortest path problem with interval data
Article Abstract:
The relative robust shortest path problem in a directed graph, where arc lengths are specified as interval numbers is examined. As the complexity status of the problem is unknown, the problem is shown as N-P hard.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
Poland, Combinatorial analysis, Robust statistics, Robustness (Statistics)
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
Reductions, completeness and the hardness of approximability
Article Abstract:
Various types of approximation preserving reductions are analyzed with reference to computational complexity.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Methods, Approximation theory, Approximation
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
A hybrid genetic algorithm for the three-index assignment problem
Article Abstract:
A solution for the three-index assignment problem (AP3), using genetic algorithm, is presented.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Europe, Genetic algorithms
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Research, Usage, Computational complexity, Computational complexity (Machine theory)
Similar abstracts:
- Abstracts: On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study. Genetic local search with distance preserving recombination operator for a vehicle routing problem
- Abstracts: Estimation and determination of shortest path length in a road network with obstacles. Ambulance location and relocation models
- Abstracts: Models, applications and linear programming relaxation. Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Abstracts: Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. Flight test data cycle map optimization
- Abstracts: Project review and learning in the construction industry: embedding a problem structuring methods within a partnership context. part 2
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.