{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460828,0.0001191405,0.0001062786,0.00007532809,0.0007575316,0.0004768411,0.0002070303,0.00004412306,0.00000253737],"category_scores_gemma":[0.0001151535,0.00006846209,0.00004210075,0.000165075,0.00004314732,0.0001470856,0.00003064392,0.0002699123,0.000004896804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008489,"about_ca_system_score_gemma":0.00001605499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001076442,"about_ca_topic_score_gemma":0.000009700359,"domain_scores_codex":[0.999013,0.00001748725,0.0003925888,0.00007434163,0.0001654008,0.0003372002],"domain_scores_gemma":[0.9992937,0.0003490372,0.0001222414,0.0001108744,0.00007560798,0.00004855326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002600803,0.00002020158,0.004529173,0.0001605311,0.00006652983,0.000004853259,0.01572986,0.7807469,0.00006241006,0.01644227,0.0009833792,0.1812279],"study_design_scores_gemma":[0.0006359853,0.0001623245,0.0005662002,0.0004015087,0.000005944833,0.0001542596,0.0005312279,0.8900248,0.0001398963,0.001375495,0.1058185,0.0001837704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7310985,0.0008578488,0.2167047,0.001371202,0.00350364,0.001393882,0.000003350443,0.000404064,0.04466285],"genre_scores_gemma":[0.9952453,0.00004849394,0.003886049,0.000268888,0.0004909181,0.000003798722,7.9694e-7,0.00002108858,0.00003469146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2641468,"threshold_uncertainty_score":0.5826398,"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."}}