{"id":"W4376863206","doi":"10.1016/j.cor.2023.106267","title":"Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Bin packing problem; Mathematical optimization; Algorithm; Packing problems; Branch and bound; Branch and cut; Integer programming; Heuristic; Clique; Mathematics; Computer science; Hybrid algorithm (constraint satisfaction); Bin; Constraint programming; 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.000905865,0.0009697588,0.002231951,0.001353123,0.0008030598,0.001606908,0.002100679,0.001843746,0.005776768],"category_scores_gemma":[0.001348995,0.0009004145,0.0009558139,0.002888679,0.000474266,0.00202481,0.001277236,0.001367081,0.0007168808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097235,"about_ca_system_score_gemma":0.002546809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009674701,"about_ca_topic_score_gemma":0.007873275,"domain_scores_codex":[0.9993074,0.0001651976,0.00003502089,0.00009663843,0.0002341467,0.0001615804],"domain_scores_gemma":[0.9991966,0.0004528757,0.0000625892,0.00005967305,0.0001368497,0.00009153494],"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.0008282197,0.000458437,0.0006033563,0.0002038411,0.0001379079,0.0001261689,0.00006026636,0.7060557,0.004724095,0.01214768,0.006579555,0.2680748],"study_design_scores_gemma":[0.00005403438,0.00005255584,0.00007764643,0.000004123186,0.00001114475,0.00001793926,0.000005747924,0.9966635,0.0004602707,0.002155872,0.0004913606,0.000005755153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04631322,0.0009917696,0.9453214,0.0003467636,0.0001508609,0.0001433855,0.0001729663,0.001237249,0.005322475],"genre_scores_gemma":[0.3199708,0.0005478262,0.6718926,0.000216951,0.0001295302,0.0003635599,0.0005268172,0.0002916734,0.006060232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009674701,"threshold_uncertainty_score":0.0193252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03246779402847673,"score_gpt":0.2979460689737864,"score_spread":0.2654782749453097,"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."}}