{"id":"W1636018584","doi":"10.1007/3-540-45578-7_78","title":"Building Negative Reduced Cost Paths Using Constraint Programming","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Constraint programming; Directed acyclic graph; Scheduling (production processes); Shortest path problem; Simple (philosophy); Set (abstract data type); Graph; Theoretical computer science; Algorithm; Mathematics; Stochastic programming; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007013801,0.000537537,0.0004863232,0.000911968,0.0004267521,0.0009613974,0.001503068,0.0003144296,0.00006873558],"category_scores_gemma":[0.0001512911,0.0005434731,0.0001396535,0.0009216199,0.0009857783,0.0008511157,0.0007057618,0.0008124517,0.00001210756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006719218,"about_ca_system_score_gemma":0.0009074471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003658654,"about_ca_topic_score_gemma":0.0000641857,"domain_scores_codex":[0.9963154,0.00004918659,0.0006026737,0.00146766,0.0008415859,0.0007234607],"domain_scores_gemma":[0.997772,0.0003288928,0.0004391465,0.0008323953,0.0003943965,0.0002331718],"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.000002525759,0.00001245534,0.00002165595,0.00001133408,0.000009117258,0.00008003063,0.0005805511,0.07848563,0.0003802216,0.02208134,0.000001990429,0.8983331],"study_design_scores_gemma":[0.0003366586,0.00007433164,0.00004142579,0.0005389192,0.00001161752,0.0003937383,0.000001255987,0.9432465,0.001363562,0.05220203,0.001025814,0.0007641073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001514958,0.0000623229,0.9934833,0.0004484883,0.001618021,0.0007818524,0.000004258916,0.0002525528,0.00319769],"genre_scores_gemma":[0.1053865,0.00002352283,0.8937346,0.0004706734,0.0002718948,0.000009603578,0.000002988058,0.00003034197,0.00006994892],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8975691,"threshold_uncertainty_score":0.9997017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02750072763962378,"score_gpt":0.2770246021649901,"score_spread":0.2495238745253663,"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."}}