{"id":"W2044393101","doi":"10.2298/yjor0402147c","title":"On some interconnections between combinatorial optimization and extremal graph theory","year":2004,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Maxima and minima; Heuristics; Combinatorial optimization; Extremal graph theory; Extremal optimization; Mathematics; Graph theory; Graph; Optimization problem; Mathematical optimization; Combinatorics; Computer science; Line graph; Voltage graph; Meta-optimization","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.004082447,0.001239925,0.001517858,0.003530878,0.002094905,0.003928159,0.002334026,0.00355912,0.00606954],"category_scores_gemma":[0.01322936,0.0007902093,0.001626382,0.005210557,0.007831735,0.01190847,0.002533909,0.005200099,0.0005769182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002036824,"about_ca_system_score_gemma":0.000623736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028127,"about_ca_topic_score_gemma":0.0009339107,"domain_scores_codex":[0.9971329,0.001622073,0.0001265753,0.0003442359,0.0005728468,0.0002013987],"domain_scores_gemma":[0.985682,0.01210319,0.0005644896,0.0007685745,0.0006522248,0.0002295427],"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.00001244026,0.0000227478,0.0001541068,0.00007434168,0.00001009574,0.00007863595,0.0000730571,0.006168961,0.00008885679,0.9854565,0.001774494,0.006085785],"study_design_scores_gemma":[0.000002920328,0.00000910977,0.0001123492,0.00003575712,0.000003586622,0.00003486328,0.00002981065,0.01038194,0.00004605053,0.9870366,0.002300785,0.000006310436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04031474,0.03297393,0.7611156,0.03404621,0.001166562,0.00008192526,0.0002702981,0.0002830366,0.1297477],"genre_scores_gemma":[0.6578542,0.06420278,0.2433734,0.008544009,0.008399711,0.0004498847,0.0004795139,0.0005163967,0.01618011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00606954,"threshold_uncertainty_score":0.02159029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04528667587623218,"score_gpt":0.3250477698478197,"score_spread":0.2797610939715875,"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."}}