{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289002,0.0007643281,0.0008781085,0.0005775385,0.000375469,0.001030248,0.001187646,0.0008654111,0.001600799],"category_scores_gemma":[0.002273537,0.000473654,0.0007062309,0.0008214281,0.0006019922,0.001220812,0.000667862,0.001070933,0.0002032118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008583111,"about_ca_system_score_gemma":0.001073253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005323785,"about_ca_topic_score_gemma":0.003407512,"domain_scores_codex":[0.9993773,0.0002850579,0.00002610738,0.00006903798,0.0001769577,0.00006565204],"domain_scores_gemma":[0.9993207,0.0004413694,0.00008930556,0.00002347132,0.00009633055,0.00002869569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001188998,0.00001314455,0.00009381564,0.00001154007,0.000009804243,0.00001995116,0.00001586766,0.974898,0.000166949,0.01914527,0.0002077471,0.005405985],"study_design_scores_gemma":[0.000003030594,0.000003992898,0.00001404103,8.704436e-7,0.000001179028,0.00000313838,0.00000147419,0.996353,0.0000272494,0.003511092,0.00007937392,0.000001505326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01049532,0.0001021213,0.9870772,0.0001273845,0.00001339681,0.00001873158,0.00001558494,0.00006883848,0.002081316],"genre_scores_gemma":[0.7395433,0.0004779747,0.2539635,0.0001383054,0.0000617064,0.0004222554,0.0001536912,0.00007178405,0.005167414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005323785,"threshold_uncertainty_score":0.01058561,"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."}}