{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00453997,0.0002936301,0.0005589712,0.0004478041,0.0006113235,0.0001546576,0.000303441,0.0001760749,0.0002647489],"category_scores_gemma":[0.0001957659,0.0002678051,0.0001944355,0.001748853,0.0003246329,0.0004562388,0.000001543864,0.0003596554,0.00001974535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007312783,"about_ca_system_score_gemma":0.0002394674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004005048,"about_ca_topic_score_gemma":0.006513747,"domain_scores_codex":[0.9945989,0.0003017704,0.002123971,0.0009283838,0.001535698,0.000511315],"domain_scores_gemma":[0.9967879,0.0005944599,0.0004459117,0.0003923916,0.001591475,0.0001878265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001770708,0.000626903,0.008227875,0.001149394,0.00003828861,0.00001296531,0.0007844134,0.01651172,0.0006122703,0.947041,0.01730252,0.007515606],"study_design_scores_gemma":[0.004109193,0.000573014,0.111653,0.0009846527,0.0003505832,0.000002234247,0.0008822588,0.003202346,0.000955846,0.2223746,0.6539124,0.0009999062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1677304,0.01440481,0.7729313,0.01347455,0.001395455,0.01898035,0.009738724,0.0003528816,0.0009915839],"genre_scores_gemma":[0.9769551,0.005666063,0.005373862,0.0001801545,0.0003785219,0.003682095,0.007055487,0.00004560395,0.0006630952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8092247,"threshold_uncertainty_score":0.9999774,"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."}}