"Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets."

Sune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott (2019)

> Home

Details and statistics

DOI: 10.1287/IJOC.2018.0846

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/GadegaardNE19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/GadegaardNE19
Sune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott:
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets. INFORMS J. Comput. 31(4): 790-804 (2019)

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.