Adam N. Letchford and Andrea Lodi
Paper (2001)
Document published while its authors were not affiliated with Polytechnique Montréal
An external link is available for this item
| PolyPublie URL: | https://publications.polymtl.ca/27247/ |
|---|---|
| Conference Title: | 5th International Workshop on Combinatorial Optimization |
| Conference Location: | Aussois, France |
| Conference Date(s): | 2001-03-05 - 2001-03-09 |
| Editors: | M. Junger, G. Reinelt and G. Rinaldi |
| Publisher: | Springer |
| DOI: | 10.1007/3-540-36478-1_12 |
| Official URL: | https://doi.org/10.1007/3-540-36478-1_12 |
| Date Deposited: | 18 Apr 2023 15:21 |
| Last Modified: | 25 Sep 2024 16:08 |
| Cite in APA 7: | Letchford, A. N., & Lodi, A. (2001, March). An augment-and-branch-and-cut framework for mixed 0-1 programming [Paper]. 5th International Workshop on Combinatorial Optimization, Aussois, France. https://doi.org/10.1007/3-540-36478-1_12 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
