Skip to main content
Log in

Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We present a few comments on the paper “Attacking the market split problem with lattice point enumeration” by A. Wasserman, published in Journal of Combinatorial Optimization, vol. 6, pp. 5–16, 2002.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • K. Aardal, R.E. Bixby, C.A.J. Hurkens, A.K. Lenstra, and J.W. Smeltink, “Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances,” INFORMS Journal on Computing, vol. 12, pp. 192–202, 2000a. Preliminary version appeared in Integer Programming and Combinatorial Optimization: 7th International IPCO Conference, Proceedings, G. Cornuéjols, R.E. Burkard, and G.J. Woeginger (Eds.), Lecture Notes in Computer Science, vol. 1610, pp. 1–16, 1999.

    Google Scholar 

  • K. Aardal, C.A.J. Hurkens, and A.K. Lenstra, “Solving a linear diophantine equation with lower and upper bounds on the variables,” in Integer Programming and Combinatorial Optimization: 6th International IPCO Conference, Proceedings, R. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado (Eds.), Lecture Notes in Computer Science, vol. 1412, pp. 229–242, 1998.

  • K. Aardal, C.A.J. Hurkens, and A.K. Lenstra, “Solving a system of diophantine equations with lower and upper bounds on the variables,” Mathematics of Operations Research, vol. 25, pp. 427–442, 2000b.

    Google Scholar 

  • G. Cornuéjols and M. Dawande, “A class of hard small 0–1 programs,” in Integer Programming and Combinatorial Optimization: 6th International IPCO Conference, Proceedings, R. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado (Eds.), Lecture Notes in Computer Science, vol. 1412, 1998, pp. 284–293.

  • A. Wassermann, “Attacking the market split problem with lattice point enumeration,” Journal of Combinatorial Optimization, vol. 6, pp. 65–16, 2002.

    Google Scholar 

  • H.P. Williams, Model Building in Mathematical Programming, Wiley: Chichester, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aardal, K. Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. Journal of Combinatorial Optimization 8, 147–149 (2004). https://doi.org/10.1023/B:JOCO.0000031416.70875.00

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOCO.0000031416.70875.00

Navigation