{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882198,0.001057659,0.002485543,0.001312739,0.0006643473,0.001304224,0.002091643,0.001866475,0.005321627],"category_scores_gemma":[0.003741961,0.0008432893,0.001073321,0.001764115,0.000902435,0.00170449,0.001251983,0.002508574,0.00199097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005667587,"about_ca_system_score_gemma":0.001458131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871365,"about_ca_topic_score_gemma":0.002586182,"domain_scores_codex":[0.9990916,0.0002531562,0.00003799885,0.00008528015,0.0004781997,0.00005373107],"domain_scores_gemma":[0.9988418,0.0006753478,0.00006193756,0.00009543738,0.0002740207,0.00005151653],"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.0001580733,0.0003241677,0.0004741013,0.0002512508,0.00007777944,0.0001120412,0.0001300971,0.5493877,0.008833712,0.08633695,0.003505153,0.3504089],"study_design_scores_gemma":[0.00001414037,0.0000319025,0.00004961459,0.00001146028,0.00001277459,0.00002798919,0.000004365486,0.9912144,0.0007059639,0.006167457,0.00175282,0.00000714195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001040775,0.00006606267,0.9974359,0.00002821847,0.00003730288,0.00001851543,0.000004953056,0.0001069022,0.001261404],"genre_scores_gemma":[0.03663776,0.0001985536,0.960685,0.00003834581,0.00006108289,0.0001416003,0.000033205,0.0001681983,0.002036248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005321627,"threshold_uncertainty_score":0.0178026,"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."}}