"LP and SDP branch-and-cut algorithms for the minimum graph bisection ..."

Michael Armbruster et al. (2012)

> Home

Details and statistics

DOI: 10.1007/S12532-012-0040-5

access: closed

type: Journal Article

metadata version: 2019-12-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mpc/ArmbrusterFHM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mpc/ArmbrusterFHM12
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin:
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4(3): 275-306 (2012)

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.