| Record ID | ia:strengthofsurrog00gior |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/strengthofsurrog00gior/strengthofsurrog00gior_marc.xml |
| Download MARC binary | https://www.archive.org/download/strengthofsurrog00gior/strengthofsurrog00gior_meta.mrc |
LEADER: 01559cam 2200373Ia 4500
001 ocm77630558
003 OCoLC
005 20090409135420.0
008 820630s1982 caua b f000 0 eng d
040 $aCMontNP$cAD#$dAD#
037 $aADA115736
086 0 $aD 208.14/2:NPS-55-82-008
088 $aNPS-55-82-008
049 $aAD#A
100 1 $aGiordano, Frank R.
245 14 $aThe strength of surrogate constraints for the linear zero-one integer programming problem /$cby Frank R. Giordano.
260 $aMonterey, California :$bNaval Postgraduate School,$c1982.
300 $a20 p. :$bill.;$c29 cm.
500 $a"NPS-55-82-008"--Cover.
500 $aCover title.
500 $a"February 1982"--Cover.
500 $a"Prepared for: Naval Postgraduate School, Monterey, CA 93940."
504 $aIncludes bibliographical references (p. 19).
506 $a"Approved for public release; distribution is unlimited"--Cover.
513 $aTechnical report; 1982.
520 $aIn 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.
592 $ack/ 4/9/09.
650 0 $aProgramming (Mathematics)
650 0 $aComputer programming.
650 0 $aHeuristic programming.
710 2 $aNaval Postgraduate School (U.S.)
994 $aC0$bAD#
592 $aGutted record reput. 12/09/97. dln. Notis number: AAA6552XP
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-55-82-008$dTECH_RPT$eNEVER$f1