Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Gintaras Palubeckis, Dalius Rubliauskas (2012)

> Home

Details and statistics

DOI: 10.1007/S10878-011-9406-2

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/PalubeckisR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/PalubeckisR12
Gintaras Palubeckis, Dalius Rubliauskas:
A branch-and-bound algorithm for the minimum cut linear arrangement problem. J. Comb. Optim. 24(4): 540-563 (2012)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.