{"id":"W2021216055","doi":"10.5539/cis.v2n1p188","title":"Stochastic Programming Models and Hybrid Intelligent Algorithm for Unbalanced Bidding Problem","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Graduate Education; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Bidding; Computer science; Mathematical optimization; Stochastic programming; Genetic algorithm; Artificial neural network; Genetic programming; Value (mathematics); Order (exchange); Hybrid algorithm (constraint satisfaction); Stochastic optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics; Constraint programming","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002939696,0.0001265929,0.0001800931,0.0005539932,0.0004566961,0.001749502,0.0004630764,0.00002633913,0.000002183976],"category_scores_gemma":[0.0002715737,0.00009487057,0.00003391719,0.0008210797,0.0002907591,0.006634588,0.0001496159,0.0000862801,0.000006534627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002813929,"about_ca_system_score_gemma":0.0001010269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001442534,"about_ca_topic_score_gemma":8.767574e-8,"domain_scores_codex":[0.9979713,0.00001796543,0.0005868281,0.0003153325,0.0007785781,0.0003299751],"domain_scores_gemma":[0.998643,0.0002852121,0.0002207727,0.0002011473,0.0004820434,0.0001678509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003676952,0.000004835306,0.000008799352,0.000003505102,0.000001048524,1.275855e-7,0.001793926,0.01154344,0.00001886579,0.003509004,0.00002822683,0.9830846],"study_design_scores_gemma":[0.0002395347,0.0001457921,0.0002088112,0.00003078657,0.000002326696,0.00004405736,0.0003455234,0.9849972,0.0001836926,0.01234935,0.001323133,0.0001298035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02101822,0.00003762496,0.9774541,0.0002307981,0.0001327888,0.0005527164,0.000005477336,0.00005288755,0.0005153533],"genre_scores_gemma":[0.5973728,0.000006478941,0.4021488,0.0004065373,0.00004257212,0.00001209713,0.000002350976,0.000001778573,0.000006665713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9829547,"threshold_uncertainty_score":0.9992868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06573409781362602,"score_gpt":0.3486509251111805,"score_spread":0.2829168272975545,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}