The strength of surrogate constraints for the linear zero-one integer programming problem

My Reading Lists:

Create a new list




Download Options

Buy this book

Last edited by CoverBot
May 20, 2020 | History

The strength of surrogate constraints for the linear zero-one integer programming problem

In this report the author discusses the strength of surrogate constraints in general and presents a heuristic procedure for iteratively constructing stronger surrogates beginning with the dual multiplier surrogate.

Publish Date
Language
English
Pages
20

Buy this book

Previews available in: English

Book Details


Edition Notes

"NPS-55-82-008"--Cover.

Cover title.

"February 1982"--Cover.

"Prepared for: Naval Postgraduate School, Monterey, CA 93940."

Includes bibliographical references (p. 19).

"Approved for public release; distribution is unlimited"--Cover.

Technical report; 1982.

ck/ 4/9/09.

Gutted record reput. 12/09/97. dln. Notis number: AAA6552XP

Published in
Monterey, California

The Physical Object

Pagination
20 p. :
Number of pages
20

Edition Identifiers

Open Library
OL25450646M
Internet Archive
strengthofsurrog00gior
OCLC/WorldCat
77630558

Work Identifiers

Work ID
OL16823558W

Source records

Internet Archive item record

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
May 20, 2020 Edited by CoverBot Added new cover
July 23, 2014 Created by ImportBot Imported from Internet Archive item record