{"id":"W2898866180","doi":"10.1287/ijoc.2018.0806","title":"The Meet-in-the-Middle Principle for Cutting and Packing Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Bin packing problem; Dimension (graph theory); Packing problems; Set (abstract data type); Bin; Mathematical optimization; Limit (mathematics); Computation; Mathematics; Integer programming; Integer (computer science); Combinatorial optimization; Branch and cut; Computer science; Linear programming; Branch and bound; Algorithm; 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.003151453,0.002216986,0.001994055,0.001540825,0.001764607,0.003906642,0.003133257,0.002903249,0.01011769],"category_scores_gemma":[0.009247986,0.00141671,0.002812422,0.004485128,0.003018158,0.006876649,0.003505742,0.007074368,0.004176705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001336492,"about_ca_system_score_gemma":0.00236403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001350886,"about_ca_topic_score_gemma":0.001219215,"domain_scores_codex":[0.9957343,0.001254616,0.0002836642,0.0007977394,0.001639824,0.0002898739],"domain_scores_gemma":[0.9978871,0.001175241,0.0002177987,0.0004094482,0.0002040257,0.0001064009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002077365,0.0001547803,0.0005440778,0.0005546818,0.00007001915,0.0002369439,0.0002708427,0.08183903,0.003663707,0.7047108,0.0157844,0.191963],"study_design_scores_gemma":[0.00006898839,0.0002193185,0.0002435017,0.0001423415,0.00003689859,0.0005859666,0.0001050359,0.2488692,0.002571947,0.6973548,0.04974895,0.00005310221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002153855,0.0005509977,0.9867575,0.0003791776,0.0001050253,0.0001202909,0.0001389533,0.0001614366,0.009632789],"genre_scores_gemma":[0.0481864,0.001408239,0.9440781,0.0004050232,0.0002701484,0.0005787725,0.0004583089,0.0002682294,0.004346817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01011769,"threshold_uncertainty_score":0.03384703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03233966605804524,"score_gpt":0.2629264707529498,"score_spread":0.2305868046949046,"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."}}