{"id":"W2019780010","doi":"10.1007/s00186-013-0431-z","title":"Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cutting-plane method; Mathematical optimization; Relaxation (psychology); Set (abstract data type); Conic section; Cluster analysis; Constraint (computer-aided design); Computer science; Point (geometry); Plane (geometry); Interior point method; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Integer programming; Geometry","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":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01184599,0.0002054437,0.0006053358,0.0006098182,0.0003626965,0.0001241646,0.0006083011,0.0001797978,0.001061521],"category_scores_gemma":[0.03235557,0.0001503425,0.0001510586,0.001647064,0.0004750855,0.0003685023,0.0003608526,0.0007718619,0.00001259366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002302861,"about_ca_system_score_gemma":0.0003741363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001558007,"about_ca_topic_score_gemma":0.000117567,"domain_scores_codex":[0.9945477,0.002136554,0.00143455,0.0004112374,0.0008539581,0.0006160396],"domain_scores_gemma":[0.9860305,0.01064777,0.0001963301,0.00056905,0.002428026,0.0001283672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006964518,0.0008139088,0.0001019684,0.002307385,0.0001574296,6.131833e-7,0.007475853,0.01583584,0.1986801,0.747321,0.001406818,0.02582936],"study_design_scores_gemma":[0.0005475807,0.0001427894,0.00002490022,0.0003126698,0.00001582554,0.00001597925,0.002296149,0.5869949,0.05987005,0.3495944,0.00005651252,0.0001283258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004970145,0.00002163943,0.9877483,0.001417088,0.00003810756,0.004343608,0.00004126554,0.00003561287,0.001384205],"genre_scores_gemma":[0.01202881,0.000009827105,0.9846953,0.00001479335,0.00002591554,0.001769274,0.000006616453,0.0000522519,0.001397261],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.571159,"threshold_uncertainty_score":0.9998516,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1633956873692615,"score_gpt":0.5237032706965733,"score_spread":0.3603075833273118,"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."}}