<  Back to the Polytechnique Montréal portal

Polynomial-time separation of simple comb inequalities

Adam N. Letchford and Andrea Lodi

Paper (2002)

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/26491/
Conference Title: 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002)
Conference Location: Cambridge, MA, United states
Conference Date(s): 2002-05-27 - 2002-05-29
Editors: William J. Cook and Andreas S. Schulz
Publisher: Springer
DOI: 10.1007/3-540-47867-1_8
Official URL: https://doi.org/10.1007/3-540-47867-1_8
Date Deposited: 18 Apr 2023 15:20
Last Modified: 05 Apr 2024 11:13
Cite in APA 7: Letchford, A. N., & Lodi, A. (2002, May). Polynomial-time separation of simple comb inequalities [Paper]. 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), Cambridge, MA, United states. https://doi.org/10.1007/3-540-47867-1_8

Statistics

Dimensions

Repository Staff Only

View Item View Item