| Record ID | ia:heuristicforcons00gior |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/heuristicforcons00gior/heuristicforcons00gior_marc.xml |
| Download MARC binary | https://www.archive.org/download/heuristicforcons00gior/heuristicforcons00gior_meta.mrc |
LEADER: 01657cam 2200373Ia 4500
001 ocm80905424
003 OCoLC
005 20090409131419.0
008 820630s1982 cau b f000 0 eng d
040 $aCMontNP$cAD#$dAD#
037 $aADA115767
086 0 $aD 208.14/2:NPS-55-82-009
088 $aNPS-55-82-009
049 $aAD#A
100 1 $aGiordano, Frank R.
245 12 $aA heuristic for constructing surrogate constraints for the linear zero-one integer programming problem /$cby Frank R. Giordano.
260 $aMonterey, California :$bNaval Postgraduate School,$c1982.
300 $a19 p. :$c28 cm.
500 $a"NPS-55-82-009"--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 presents a heuristic for constructing surrogate constraints to be used for the solution of the linear zero-one integer problem. Using the heuristic the author was able to build surrogate constraints with strength comparable to the dual multiplier surrogate in one-tenth the time. (Author)
592 $ack/ 4/9/09.
650 0 $aHeuristic programming.
650 0 $aProgramming (Mathematics)
710 2 $aNaval Postgraduate School (U.S.)
994 $aC0$bAD#
035 $a(CStRLIN)CDKG82-B1616
949 $lgen$nL$aT57.84$b.G48$s1$tnorm$u00001$i32768000467062
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-55-82-009$dTECH_RPT$eNEVER$f1