{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006566656,0.0001274276,0.0001298599,0.0002038261,0.0006989782,0.0003673529,0.0001551248,0.00003134399,0.0000326946],"category_scores_gemma":[0.00002146389,0.00009269702,0.00002501027,0.0004697822,0.0001150478,0.0001588973,0.0001096311,0.0002472955,0.0000706862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003690061,"about_ca_system_score_gemma":0.00005983195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002194422,"about_ca_topic_score_gemma":0.00001740036,"domain_scores_codex":[0.9988826,0.00006829652,0.0001584094,0.0002392794,0.0002895879,0.00036181],"domain_scores_gemma":[0.9989409,0.0005408619,0.000007734284,0.00019673,0.000218104,0.00009571268],"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.000005019127,0.000009040941,0.0000190152,0.000028811,0.00005998744,0.000002835652,0.0004211554,0.9581833,0.0004724812,0.0004619904,0.006206934,0.03412946],"study_design_scores_gemma":[0.0005675575,0.00006616695,0.0001773789,0.00005619146,0.000006994237,0.00002320707,0.00001527889,0.9949041,0.0003559034,0.00008052317,0.003619118,0.0001276021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03293707,0.0006401859,0.9572508,0.004356288,0.0003686941,0.002820873,0.00008503233,0.0008108566,0.0007301815],"genre_scores_gemma":[0.7802218,0.0003628287,0.2118042,0.0003621195,0.0007672956,0.001081841,0.0004300152,0.000226982,0.004742933],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7472848,"threshold_uncertainty_score":0.5376046,"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."}}