- Preview Available
- Scholarly Journal
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
Branch-and-cut for combinatorial optimization problems without auxiliary binary variablesDE FARIAS, I R, JR; JOHNSON, E L; NEMHAUSER, G L.
The Knowledge Engineering Review; Cambridge Vol. 16, Iss. 1, (Mar 2001): 25-39.
This is a limited preview of the full PDF
Try and log in through your library or institution to see if they have access.





