This work contains new polyhedral results for the QSAP and analyzes the characteristics of the RLT solutions. A graph structure that causes untight solutions is presented and its minimality is proven. Exploiting these results, the natural stepwise structure of the RLT can be softened up to generate new algorithms for fast lower bound computations. The competitiveness of the approach is demonstrated by means of the real life instances.
KAUFOPTIONEN
38.50 € | ||
auf Lager | ||
Versandkostenfrei innerhalb Deutschlands |
Wollen auch Sie Ihre Dissertation veröffentlichen?