On a binary distance model for the minimum linear arrangement problem (Q458974)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a binary distance model for the minimum linear arrangement problem |
scientific article; zbMATH DE number 6352469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a binary distance model for the minimum linear arrangement problem |
scientific article; zbMATH DE number 6352469 |
Statements
On a binary distance model for the minimum linear arrangement problem (English)
0 references
8 October 2014
0 references
linear arrangement problem
0 references
graph layout
0 references
integer programming
0 references
0.89490587
0 references
0.8775543
0 references
0.8729506
0 references
0.8729506
0 references
0.86638224
0 references
0.86184907
0 references
0.8611275
0 references
0 references
