{"id":"W2090914983","doi":"10.1016/j.disopt.2011.01.001","title":"Valid inequalities and branch-and-cut for the clique pricing problem","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; HEC Montréal","funders":"","keywords":"Branch and cut; Mathematics; Polyhedron; Clique; Integer programming; Mathematical optimization; Inequality; Linear programming; Embedding; Flow network; Cutting-plane method; Combinatorics; Computer science","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.0004555589,0.00007024152,0.0000768738,0.00003753749,0.0005686823,0.00007696164,0.00005722251,0.00006081179,0.00003026329],"category_scores_gemma":[0.00008671486,0.00005437969,0.00002006242,0.0001122358,0.0001216191,0.0002822984,0.000005967252,0.00004125083,3.873102e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001030528,"about_ca_system_score_gemma":0.00003535779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006212598,"about_ca_topic_score_gemma":0.0002902607,"domain_scores_codex":[0.9993992,0.00006743337,0.0001576077,0.0001379061,0.0001046688,0.0001331969],"domain_scores_gemma":[0.9995687,0.0001497428,0.00008816181,0.00006017322,0.00009189454,0.00004133571],"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.0001453422,0.00003158209,0.0268856,0.0001273912,0.00006301232,5.406197e-7,0.2981934,0.2960869,0.00001643196,0.3708266,0.0002567832,0.007366382],"study_design_scores_gemma":[0.004534669,0.000736515,0.06022049,0.0005292789,0.0007396126,0.00000642243,0.09854063,0.7790857,0.0009026443,0.03432583,0.01834946,0.002028748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007962426,0.0001789795,0.9821081,0.0009808035,0.0001025935,0.0006223628,0.00001696101,0.0001022991,0.007925496],"genre_scores_gemma":[0.9434117,0.0006932203,0.0547088,0.0001730322,0.00007039579,0.00007669467,0.00007194981,0.00001484592,0.0007793625],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9354493,"threshold_uncertainty_score":0.4373902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04587999302022705,"score_gpt":0.2986937075859502,"score_spread":0.2528137145657231,"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."}}