{"id":"W1606603715","doi":"10.6000/2371-1647.2015.01.02","title":"A Unified Framework for Integer Programming Formulation of Graph Matching Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Advances in Management Sciences & Information Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Integer programming; Computer science; Matching (statistics); Graph; Mathematical optimization; Theoretical computer science; Mathematics; Algorithm; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051311,0.002720082,0.001787472,0.002170747,0.001003627,0.004090761,0.003557411,0.002129691,0.006926361],"category_scores_gemma":[0.007769574,0.001055846,0.002813802,0.004103225,0.001831422,0.005419174,0.002886059,0.007078704,0.002141513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002492672,"about_ca_system_score_gemma":0.002989604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002972494,"about_ca_topic_score_gemma":0.003754727,"domain_scores_codex":[0.9962889,0.001805801,0.0002233051,0.0004735148,0.0008820061,0.0003265558],"domain_scores_gemma":[0.9977351,0.001379879,0.0002264164,0.0001942936,0.0003554201,0.0001087652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001400935,0.00007776379,0.0001427782,0.0001985166,0.00002661917,0.00009077005,0.0001299483,0.1372553,0.0004908824,0.830065,0.005557567,0.02595097],"study_design_scores_gemma":[0.00002125185,0.00004693381,0.00008244786,0.00008665548,0.00002386007,0.00007934093,0.00007406942,0.5434049,0.0002737621,0.4345243,0.02136192,0.00002060428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000506197,0.0005359257,0.9919519,0.0004860267,0.00007122847,0.00005458709,0.00009306579,0.00006044142,0.006240674],"genre_scores_gemma":[0.05868461,0.003760365,0.9273424,0.0006058004,0.0007057132,0.0009078291,0.0005057991,0.0002504901,0.007236907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006926361,"threshold_uncertainty_score":0.02671421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02932313171098583,"score_gpt":0.3159201788342862,"score_spread":0.2865970471233004,"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."}}