Skip to main content
Log in

On the positive sum property and the computation of Graver test sets

  • Published:
Mathematical Programming Submit manuscript

Abstract.

 In the first part of this paper we discuss the positive sum property, a property inherent to LP, IP, and MIP Graver test sets, and develop, based on that property, a common notational and algorithmic framework for Graver test sets. Moreover, we show how to find an initial feasible solution with the help of universal test sets and deal with termination of the augmentation algorithm that improves this solution to optimality.

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

Author information

Authors and Affiliations

Authors

Additional information

Received: April 30, 2001 / Accepted: May 2002 Published online: March 28, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hemmecke, R. On the positive sum property and the computation of Graver test sets. Math. Program., Ser. B 96, 247–269 (2003). https://doi.org/10.1007/s10107-003-0385-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0385-7

Keywords

Navigation