☰ Category

Contributions to the Minimum Linear Arrangement Problem


Marketed By :  Südwestdeutscher Verlag für Hochschulschriften   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 5,886

Availability: In stock

  • Product Description

The Minimum Linear Arrangement problem consists in finding an ordering of the nodes of a weighted graph, such that the sum of the weighted edge lengths is minimized. We report on the usefulness of a new model within a branch-and-cut-and-price algorithm for solving Minimum Linear Arrangement problems to optimality. The key idea is to introduce binary variables d_{ijk}, that are equal to 1 if nodes i and j have distance k in the permutation. We present formulations for complete and for sparse graphs and explain the realization of a branch-and-cut-and-price algorithm. Furthermore, its different settings are discussed and evaluated. To the study of the theoretical aspects concerning the Minimum Linear Arrangement problem, we contribute a characterization of a relaxation of the corresponding polyeder.

Product Specifications
SKU :COC16851
AuthorHanna Seitz
Number of Pages160
Publishing Year6/26/2010
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandSüdwestdeutscher Verlag für Hochschulschriften
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-25 00:00:00
0 Review(s)