{"id":"W2077497146","doi":"10.1016/j.tre.2005.01.004","title":"A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement","year":2006,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":96,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Column generation; Procurement; Computer science; Combinatorial auction; Truck; Profit (economics); Common value auction; Mathematical optimization; Operations research; Vehicle routing problem; Optimization problem; Selection (genetic algorithm); Lagrangian relaxation; Routing (electronic design automation); Business; Computer network; Microeconomics; Engineering; Economics; Mathematics; Algorithm; Automotive engineering","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.003674296,0.000855158,0.001786286,0.001209588,0.001112086,0.004061777,0.002504356,0.003622107,0.006787569],"category_scores_gemma":[0.007978528,0.0009528628,0.001595362,0.002259487,0.002010675,0.004570045,0.0009854743,0.001682788,0.0004251559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002292883,"about_ca_system_score_gemma":0.002654784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006238728,"about_ca_topic_score_gemma":0.003414611,"domain_scores_codex":[0.9982048,0.001100006,0.00005770249,0.0002068831,0.0002260808,0.000204436],"domain_scores_gemma":[0.9978071,0.001524849,0.00008930765,0.0001678389,0.0002967035,0.0001142342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004901747,0.0002104892,0.0008069007,0.0005477828,0.0001701923,0.0006052607,0.0004243128,0.3875446,0.002244897,0.5314029,0.01011688,0.06543551],"study_design_scores_gemma":[0.0001217507,0.000129373,0.000539271,0.00007861458,0.00009839024,0.0003555668,0.00023195,0.7841349,0.0008182861,0.2058484,0.007581772,0.00006182028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1943254,0.003509622,0.7371255,0.0032429,0.000395835,0.0005587367,0.00052173,0.0002102153,0.06011002],"genre_scores_gemma":[0.8892038,0.001360705,0.09973262,0.0001803245,0.00014294,0.0001879807,0.0002236682,0.00008901369,0.008879025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006787569,"threshold_uncertainty_score":0.02270669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2736077083915088,"score_gpt":0.4657522647440824,"score_spread":0.1921445563525735,"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."}}