"Branch-and-cut for combinatorial optimization problems without auxiliary ..."

Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser (2001)

> Home

Details and statistics

DOI: 10.1017/S0269888901000030

access: closed

type: Journal Article

metadata version: 2020-08-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ker/FariasJN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ker/FariasJN01
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16(1): 25-39 (2001)

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.