The goal is to maximize the value of items placed in a knapsack without exceeding its weight capacity. This problem has many variations, but the most common are: 0/1 Knapsack Problem: Each item can either be included or excluded. Fractional Knapsack Problem: Items can be divided to maximize...
aaniv module to compute unbiased IV regression tssc install aaniv aaplot module for scatter plot with linear and/or quadratic fit, automatically annotated" tssc install aaplot abar module to perform Arellano-Bond test for autocorrelation tssc install abar abg module to implement the Alpha-...
_gwtmean module containing extensions to generate to implement weighted mean tssc install _gwtmean _gzanthro tssc install _gzanthro _peers module to allow egen to compute the average characteristics of peers in a given unit (school, firm, etc.) specified by by()" tssc install _peers a2reg...
heterarchy.pi: Heterarchy (simple semantic net, port from a Prolog program) implement_the_hyperfactorial.pi: Implement the hyperfactorial (code golf) impossible_house_number_and_age_puzzle.pi: Impossible house number and age puzzle (MindYourDecisions) init_fail2.pi: init_fail2(N) and fa...
aaniv module to compute unbiased IV regression tssc install aaniv aaplot module for scatter plot with linear and/or quadratic fit, automatically annotated" tssc install aaplot abar module to perform Arellano-Bond test for autocorrelation tssc install abar abg module to implement the Alpha-Beta...
_grprod module to extend generate to produce row products tssc install _grprod _gslope module to compute simple regression slope tssc install _gslope _gsoundex module to implement soundex algorithm tssc install _gsoundex _gvreldif module to compute relative difference between successive obs...