Thursday, March 26, 2009

Lunch Today - Chicken Sausage at Canteen 13

Place : Canteen 13, NTU
Menu : Chicken Sausage
Price : S$ 4.50
Comment : Long and big sausage, nice taste and fresh! Only the bread is tough to chew.
Score : 3.5 / 5

Thursday, March 12, 2009

Dinner Today - Tom Yum and Omelet at Canteen 2

Place : Canteen 2, NTU
Menu : Tom yum, omelet, and rice
Price : S$ 4
Comment : It's very hard to find delicious omelet and tom yum in Singapore. But at here! my campus, I found both. Unfortunately, I forgot to zoom the bowl of tom yum :(
Score : 4.5 / 5

Lunch Today - Black Pepper Steak at Canteen 13

Place : Canteen 13, NTU
Menu : Black Pepper Steak (medium)
Price : S$ 5
Comment : It's really medium! The beef is nicely soft. Although the price is quite high for students but it's worthy.
Score : 4 / 5

Wednesday, March 11, 2009

Lunch Today - Crispy Noodle with Seafood

Place : Canteen 4, NTU
Menu : Crispy noodle with seafood (squid & prawn)
Price : S$ 3.5
Comment : Really crispy but I think it lacked something important.
Score : 3 / 5

Tuesday, March 10, 2009

Lunch Today - Korean BBQ Beef Set at Canteen 13

Place : Canteen 13, NTU
Menu : Korean BBQ Beef Set (BBQ + Soup + Rice + Kimchi)
Price : S$ 4.5
Comment : The main course is soft cooked beef & good Taste. But I didn't like the soup and Kimchi.
Score : 3.5 / 5

Monday, March 9, 2009

[Reading] Uncapacitated single and multiple allocation p-hub center problems

Authors: Andreas T. Ernst et. al. , ELSEVIE, 2007

The paper refers to "p-hub" concept using for reducing the total cost of any networks - telecommunication, postal network, and even airline. The idea is to use a set of hubs to consolidate something (e.g., data, passengers, materials, ...). Two kinds of allocations studied by the authors - uncapacitated single allocation p-hub center problem (USApHCP) and uncapacitated multiple allocation p-hub center porblem (UMApHCP). They need to minimize the discounted cost of the largest origin-destination pair path : min max (cost) by using integer programming.