{"id":"W2015024493","doi":"10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Cutting-plane method; Column generation; Branch and bound; Bin packing problem; Algorithm; Interior point method; Mathematics; Bin; Mathematical optimization; Branching (polymer chemistry); Point (geometry); Dual (grammatical number); Plane (geometry); Tree (set theory); Computer science; Integer programming; Geometry; Combinatorics","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.0007315122,0.0001236921,0.0001728125,0.00004180088,0.00009284289,0.0001202649,0.0001071786,0.00005974937,0.00001028503],"category_scores_gemma":[0.0001417148,0.00008609775,0.00003473627,0.0001455377,0.00005555286,0.0001338257,0.00002823972,0.0001723761,0.000006223951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002783488,"about_ca_system_score_gemma":0.00000847879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007526978,"about_ca_topic_score_gemma":0.000007782868,"domain_scores_codex":[0.9991521,0.00003727309,0.0003763422,0.0001176883,0.0001356857,0.0001809097],"domain_scores_gemma":[0.999515,0.0001512572,0.00006898249,0.0001593739,0.00003746419,0.00006793807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007816571,0.00005619296,0.000004898748,0.0003657395,0.00005298563,0.000002939484,0.01099408,0.0179323,0.003268261,0.03544141,0.000004366319,0.931869],"study_design_scores_gemma":[0.0004836683,0.0001424102,0.00001105212,0.0004587414,0.00003237633,0.00009300052,0.001338924,0.9308717,0.01923033,0.04673723,0.0003591634,0.0002414514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009144701,0.00008410742,0.9893991,0.00008345889,0.00007808447,0.0002456758,0.00000116866,0.00022511,0.0007386126],"genre_scores_gemma":[0.220061,0.000008423529,0.7798103,0.00001489879,0.00002674175,0.00002679579,0.000004981977,0.00002581825,0.00002096475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9316276,"threshold_uncertainty_score":0.3510964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01704059943685375,"score_gpt":0.275635538636096,"score_spread":0.2585949391992423,"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."}}