✦ LIBER ✦

On a binary distance model for the minimum linear arrangement problem

✍ Scribed by Gerhard Reinelt, Hanna Seitz

Book ID: 120949783
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 503 KB
Volume: 22
Category: Article
ISSN: 1134-5764
DOI: 10.1007/s11750-012-0263-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved approximation ratio for the

An improved approximation ratio for the minimum linear arrangement problem

✍ Uriel Feige; James R. Lee 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 108 KB

A branch-and-bound algorithm for the min

A branch-and-bound algorithm for the minimum cut linear arrangement problem

✍ Gintaras Palubeckis, Dalius Rubliauskas 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 693 KB

A mixed 0-1 linear programming formulati

A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem

✍ André R. S. Amaral 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 138 KB

On the minimum volume simplex enclosure

On the minimum volume simplex enclosure problem for estimating a linear mixing model

✍ E. M. T. Hendrix, I. García, J. Plaza, A. Plaza 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 576 KB

Evaluating the maximize minimum distance

Evaluating the maximize minimum distance formulation of the linear discriminant problem

✍ Paul A. Rubin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 672 KB

On Bipartite Drawings and the Linear Arr

On Bipartite Drawings and the Linear Arrangement Problem

✍ Shahrokhi, Farhad; Sýkora, Ondrej; Székely, László A.; Vrto, Imrich 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB