{"id":"W1648726702","doi":"10.1007/s10589-015-9779-8","title":"Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Semidefinite programming; Maximum cut; Eigenvalues and eigenvectors; Quadratic programming; Adjacency matrix; Graph partition; Combinatorics; Laplacian matrix; Vertex (graph theory); Quadratic equation; Mathematical optimization; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.002550021,0.001477524,0.001241423,0.0009609189,0.0006782154,0.001992014,0.001353087,0.001857328,0.005823901],"category_scores_gemma":[0.007773377,0.0006978043,0.0009765066,0.001322595,0.001461541,0.002180306,0.001410272,0.003542749,0.0006836483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009921683,"about_ca_system_score_gemma":0.001299078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002163399,"about_ca_topic_score_gemma":0.002748622,"domain_scores_codex":[0.9988253,0.0005522408,0.00004219236,0.0001723928,0.0003157629,0.00009212399],"domain_scores_gemma":[0.9961003,0.00310719,0.0002038966,0.0001482318,0.0003181222,0.0001223223],"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.000209927,0.0002910029,0.0004012538,0.0004355596,0.00006168547,0.0001836202,0.0002094213,0.6729216,0.002905358,0.2463779,0.01392568,0.06207697],"study_design_scores_gemma":[0.00002610723,0.00004628291,0.0001219862,0.00002747703,0.0000105026,0.00006886998,0.00004311438,0.9142911,0.0003418631,0.08339331,0.001615546,0.00001379659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008420896,0.0004007917,0.9815776,0.0007970717,0.00009892722,0.00004995404,0.0001208847,0.00008864557,0.008445292],"genre_scores_gemma":[0.2907649,0.001335819,0.6862729,0.0007151901,0.0004604591,0.0006143929,0.0006089662,0.0005495785,0.01867782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005823901,"threshold_uncertainty_score":0.01948291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02330850243936596,"score_gpt":0.2572272012488267,"score_spread":0.2339186988094607,"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."}}