{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858439,0.001710617,0.001290001,0.001199865,0.001156797,0.001325153,0.002356807,0.001152096,0.01666455],"category_scores_gemma":[0.004783247,0.001259558,0.001654849,0.001481286,0.001491685,0.003356443,0.003002677,0.003136438,0.002607262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009864424,"about_ca_system_score_gemma":0.00175252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003469419,"about_ca_topic_score_gemma":0.006756471,"domain_scores_codex":[0.9990686,0.0002146784,0.00003527205,0.0002252273,0.000334083,0.0001221855],"domain_scores_gemma":[0.9982174,0.0009703296,0.0001157223,0.0003305233,0.0002893507,0.00007660563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001888439,0.0002282962,0.0004139361,0.0006343822,0.00007673049,0.0002443421,0.0002377134,0.4169729,0.006965329,0.3027128,0.01627182,0.255053],"study_design_scores_gemma":[0.00005267859,0.00009485656,0.0001159082,0.00009796091,0.00004539152,0.0001152597,0.0000934165,0.5675419,0.004894579,0.4064978,0.02041806,0.00003219947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01117983,0.0001105855,0.9746878,0.0001830878,0.0000747413,0.0001080844,0.0002719522,0.001052069,0.01233192],"genre_scores_gemma":[0.08542106,0.000254943,0.9000501,0.0001183233,0.00002116708,0.0002592486,0.0008978163,0.0008395951,0.01213779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01666455,"threshold_uncertainty_score":0.0557484,"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."}}