1.206J/16.77J/ESD.215J The Fleet Assignment Problem Outline Problem Definition and Objective Fleet Assignment Network Representation Fleet Assignment Model Fleet Assignment Solution Branch--bound-and- Results

1.206J/16.77J/FSD215J The Crew Scheduling problem Outline Problem definition Sequential Solution Approach Crew pairing optimization model Branch-and-Price solution Branching strategies

1.206J/16.77J/ESD.215J Airline Schedule Planning: Multi-commodity Flows Outline Applications Problem definition Formulations Solutions Computational results Integer multi-commodity network flow

1.设曲线L是上半圆周x2+y2=2x,则xdl=π L 解法1由于L关于直线x=1对称,所以∫(x-1)dl=0,从而 L xdl=f[(x-1)+1l=f(x-1)dl+fdl=0+π=π L L L =1+ cost, 解法2令L:y=sint (0≤t≤),则 xdl =Jo (+cost)(-sint)2+(cost)dt=. L 解法3设曲线L的质量分布均匀,则其重心的横坐标为x=1又因为 ∫xdl xdl x= d 1么 π 所以∫xdl=π。 L 2.设L是上半椭圆周x2+4y2=1,y≥0,是四分之一椭圆周 x2+4y2=1,x≥0,y≥0,则 (A)(+ y) (+y) (B) Ixydl =2J, xydl () SLx2dl, y2dl (D)(x+y)2dl =2J (x2+y2) [] 答D

选择题 【题3.1】在C语言中(以16位PC机为例),5种基本数据类型的存储空间长度的排列顺 序为 A) char