Skip to main content
SpringerLink
Log in

Two-commodity cut-packing problem

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Reference

  1. D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (2) (1971) 168–194.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Research Center, University of Wisconsin, 53706, Madison, Wisc., USA

    T. C. Hu

Authors
  1. T. C. Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Sponsored by the United States Army under Contract No. DA-31-124-ARO-D-462 and National Science Foundation Grant G.J. 28339.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, T.C. Two-commodity cut-packing problem. Mathematical Programming 4, 108–109 (1973). https://doi.org/10.1007/BF01584649

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584649

Keywords

Search

Navigation