Parametric integer linear programming [electronic resource] : a synthesis of branch and bound with cutting planes.

A branch and bound algorithm is designed to solve the general integer linear programing problem with parametric right-hand sides. The right-hand sides have the form b + THETA d, where b and d are conformable vectors, d consists of nonegative constants, and THETA varies from zero to one. The method c...

Full description

Saved in:
Bibliographic Details
Online Access: Online Access
Corporate Author: Sandia National Laboratories (Researcher)
Format: Government Document Electronic eBook
Language:English
Published: Washington, D.C : Oak Ridge, Tenn. : United States. Dept. of Energy ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1980.
Subjects:

Internet

Online Access

Online

Holdings details from Online
Call Number: E 1.99: conf-801126-1
E 1.99: conf-801126-1 Available