{"id":"W2355281175","doi":"","title":"Hot Steel Rolling PlanOptimization Based on Intelligent Branch-bound Algorithm","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Algorithms and Applications","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Branch and bound; Computer science; Algorithm; Mathematical optimization; Constraint (computer-aided design); 2-opt; Branch and cut; Integer programming; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.00004722508,0.0002205106,0.0001623505,0.0001341787,0.0002006602,0.00008491312,0.0002423305,0.00008074204,0.0000260249],"category_scores_gemma":[2.498434e-7,0.0002387917,0.00007161184,0.0003877337,0.00002374873,0.00009107624,0.00001286401,0.0001796457,0.0001562114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009317791,"about_ca_system_score_gemma":0.00001518728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000148907,"about_ca_topic_score_gemma":8.933204e-7,"domain_scores_codex":[0.9989957,0.000008007577,0.0002854674,0.0003211566,0.0001249775,0.0002646569],"domain_scores_gemma":[0.999391,0.0000491344,0.0000439548,0.0003575874,0.00005616594,0.0001021267],"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.000001308721,0.00007799765,0.000001589023,0.000005559368,0.000006470474,2.701408e-7,0.00002739771,0.5061508,0.002236315,0.0007757651,0.0005455288,0.490171],"study_design_scores_gemma":[0.0002264494,0.00002952034,0.0002172505,0.00001716575,0.00001067769,0.000003263691,0.00000569403,0.7713082,0.00921385,0.001394825,0.217319,0.0002540142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003118305,0.0001226602,0.9965013,0.0002130398,0.00002825513,0.0007256408,0.00005399169,0.0006161775,0.001427149],"genre_scores_gemma":[0.0679982,0.00007844793,0.929399,0.0009594813,0.0004622914,0.0005556824,0.0003635654,0.00005679558,0.0001265772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.489917,"threshold_uncertainty_score":0.9737644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006886317044362978,"score_gpt":0.2212107878901836,"score_spread":0.2143244708458206,"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."}}