.png){kind=icon}
Return
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.09.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses multicriteria combinatorial optimization problems involving one cost and several bottleneck objective functions. An algorithm is developed which generates the minimal complete set of Pareto-optimal solutions. This algorithm runs in polynomial time as long as the single objective problem considering only the cost function can be solved polynomially. A reoptimization procedure is used to accelerate the convergence of the algorithm. Applications are given. Computational results on randomly generated instances and planar grid graphs concerning the minimum cost spanning tree and the shortest path problem are presented. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Multicriteria combinatorial optimization
Pareto-optimal solution
Bottleneck function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveOn algorithms for the tricriteria shortest path problem with two bottleneck objective functions
PREAI
ShareSaveShareSaveRisk Factors Analysis for 90-Day Mortality of Adult Patients with Mild Traumatic Brain Injury in an Italian Emergency Department.png)
Geriatrics
OAAI
GeriatricsIF0
OAAIShareSave View more