"Multiple objective branch and bound for mixed 0-1 linear programming: ..."

Thomas Vincent et al. (2013)

> Home

Details and statistics

DOI: 10.1016/J.COR.2012.08.003

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/VincentSRPG13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/VincentSRPG13
Thomas Vincent, Florian Seipp, Stefan Ruzika, Anthony Przybylski, Xavier Gandibleux:
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case. Comput. Oper. Res. 40(1): 498-509 (2013)

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.