课程咨询

托福考试网 托福资料下载 托福资讯 0元讲座 水平测试

托福考试练习
新东方在线 > TOEFL > 托福听力 > 正文
托福培训

扫码免费领资料

内含托福全科备考资料

更有免费水平测试及备考规划

托福培训

扫码关注掌握一手留学资讯

回复XDF免费水平测试

录播精讲 直播课HOT

托福听力练习-科学美国人60秒:数学家为裁判员解惑

2017-04-22 09:17:00来源：科学美国人60秒

点击查看>>科学美国人60秒音频：数学家为裁判员解惑

　　科学美国人60秒听力练习：数学家为裁判员解惑

　　科学美国人60秒英文文本

　　The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route. But the traveling salesman's predicament pales in comparison to figuring out the best ways to get four-man crews of umpires to every major league baseball game. A research team attacked the problem for the last few years. Their solution appears in Interfaces. It's a journal of operations research. [Michael Trick, Hakan Yildiz and Tallys Yunes, "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem"]

　　In addition to minimizing travel, here are some of the umpire constraints. Crews should visit each MLB city at least once. They should work each team at home and on the road. They should not work more than 21 days in a row. They should not ump any one team’s games for more than four series all year. There are plenty more.

　　The researchers first had to develop the question, dubbed the "traveling umpire problem." They used brute-force computation and heuristics for their solutions. The result was good enough for Major League Baseball to adopt the last three seasons. Previously, a former umpire made the schedule. That guy is out.

　　—Steve Mirsky

　　中文翻译请点击下一页

本文关键字: 托福听力 科学美国人60秒

上一页 1 2 下一页

托福辅导

关注新东方在线托福

托福机经·Official题目练习

考前重点突破·听说读写海量资料

更多资料

关注新东方在线托福，
回复【XDF】获取大礼包

托福辅导
  • 1.打开手机微信【扫一扫】，识别上方二维码；
  • 2.点击【添加】，回复对应关键字领取学习资料。
更多>>
更多内容

免费获取托福备考大礼包

微信扫描下方二维码 立即领取

托福辅导
更多>>
更多公益讲座>>
更多>>
更多资料
托福TPO 托福听力练习 托福口语练习 托福阅读练习 托福写作练习
我要
反馈 返回
首页
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10