{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360565,0.00006385547,0.00007649168,0.00002470855,0.0005483154,0.0001425329,0.0002132528,0.0000475344,0.000007815952],"category_scores_gemma":[0.00008721315,0.00003384435,0.00007904079,0.0000840842,0.0001214128,0.000184507,0.00001883178,0.0003459794,4.219003e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005361151,"about_ca_system_score_gemma":0.00004687321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003448454,"about_ca_topic_score_gemma":0.000001666369,"domain_scores_codex":[0.9991778,0.00006154666,0.0001565446,0.00006540779,0.0003774906,0.000161181],"domain_scores_gemma":[0.9991117,0.0003721753,0.00003199962,0.0001076465,0.0003201473,0.0000563012],"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.00003242395,0.00004367888,0.00009563579,0.00004314892,0.0001534743,3.191381e-7,0.000785434,0.949635,0.001305955,0.01251852,0.02013895,0.01524747],"study_design_scores_gemma":[0.0004189956,0.0001296523,0.00121541,0.00001840893,0.00001363203,0.00001839082,0.0001813081,0.9525356,0.0009414773,0.02360862,0.0208486,0.00006987019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004575475,0.0002621467,0.9924132,0.002215083,0.0001594673,0.0002085011,0.00001704067,0.00001249267,0.0001366472],"genre_scores_gemma":[0.5449347,0.0008005662,0.4526209,0.0002232027,0.0009442627,0.00003011086,0.00001337564,0.0000332594,0.0003996251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5403593,"threshold_uncertainty_score":0.4217254,"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."}}