{"id":"W2035828426","doi":"10.1057/jors.2014.98","title":"An algorithm and upper bounds for the weighted maximal planar graph problem","year":2014,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Integer programming; Planarity testing; Cutting-plane method; Algorithm; Theory of computation; Planar graph; Linear programming; Heuristic; Upper and lower bounds; Constructive; Mathematics; Computer science; Graph; Mathematical optimization; Combinatorics","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.002457149,0.002672283,0.00157899,0.002544994,0.001409276,0.003911749,0.004552897,0.002442886,0.01118708],"category_scores_gemma":[0.01076082,0.001099524,0.002485108,0.003859737,0.00145482,0.006963575,0.003457701,0.004729125,0.002673924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002684087,"about_ca_system_score_gemma":0.003226274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003287792,"about_ca_topic_score_gemma":0.003821997,"domain_scores_codex":[0.9968401,0.0007326326,0.0001526438,0.0006433607,0.001034152,0.0005969295],"domain_scores_gemma":[0.9944298,0.00372725,0.0004600937,0.000633401,0.0005637804,0.0001856847],"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.0002795492,0.0004681828,0.0008390577,0.0007902476,0.0001266376,0.0002429632,0.0001707363,0.6424007,0.005003035,0.1249169,0.02253483,0.2022272],"study_design_scores_gemma":[0.00009049629,0.0001148916,0.0001787335,0.0000819877,0.00005260275,0.0001893801,0.00007987382,0.8961823,0.002959935,0.08773586,0.01230312,0.00003084925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006856166,0.0007283401,0.9756001,0.0007756579,0.0001249069,0.0003013178,0.0003142048,0.0009670426,0.01433219],"genre_scores_gemma":[0.06337167,0.00106656,0.929222,0.000353856,0.0001678389,0.0005987473,0.001460183,0.0004681964,0.003290865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01118708,"threshold_uncertainty_score":0.0374245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02267424350815574,"score_gpt":0.303632595344079,"score_spread":0.2809583518359233,"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."}}