An Improved Branch-and-Bound Method for Maximum Monomial Agreement
Published Online:17 Jun 2011https://doi.org/10.1287/ijoc.1110.0459
Supplemental Material
ijoc.1110.0459-sm-ec.pdf (141 KB)
- Cited by
- Computers & Operations Research, Vol. 183
- Discrete Optimization, Vol. 50
- Discrete Applied Mathematics, Vol. 324
- 14 May 2019 | INFORMS Journal on Optimization, Vol. 1, No. 2
- SSRN Electronic Journal, Vol. 18
- 23 July 2015 | Mathematical Programming Computation, Vol. 7, No. 4
Volume 24, Issue 2
Spring 2012
Pages 187-341
Article Information
Supplemental Material
Metrics
Information
- Received:October 01, 2009
- Accepted:February 01, 2011
- Published Online:June 17, 2011
Copyright © 2012, INFORMS
Cite as
Jonathan Eckstein, Noam Goldberg, (2011) An Improved Branch-and-Bound Method for Maximum Monomial Agreement. INFORMS Journal on Computing 24(2):328-341.
https://doi.org/10.1287/ijoc.1110.0459
Keywords
