"A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem."

Patrick Healy, Nikola S. Nikolov (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-36151-0_10

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/gd/HealyN02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/HealyN02
Patrick Healy, Nikola S. Nikolov:
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. GD 2002: 98-109

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.