.png){kind=icon}
.png){kind=icon}
Return
Aggregation approach for the minimum binary cost tension problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2008.07.033.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aggregation technique, dedicated to two-terminal series-parallel graphs (TTSP-graphs) and introduced lately to solve the minimum piecewise linear cost tension problem, is adapted here to solve the minimum binary cost tension problem (BCT problem). Even on TTSP-graphs, the BCT problem has been proved to be NP-complete. As far as we know, the aggregation is the only algorithm, with mixed integer programming (MIP), proposed to solve exactly the BCT problem on TTSP-graphs. A comparison of the efficiency of both methods and a heuristic is presented. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Minimum cost tension
Binary costs
Two-terminal series-parallel graphs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W