A5090790432- Graph Labeling and Dimension Problems
- Vehicle Routing Optimization Methods
- graph theory and CDMA systems
- Advanced Graph Theory Research
- Transportation and Mobility Innovations
- Urban Transport and Accessibility
- Urban and Freight Transport Logistics
- Constraint Satisfaction and Optimization
- Transportation Planning and Optimization
- Educational Games and Gamification
- Optimization and Packing Problems
- Scheduling and Timetabling Solutions
- Psychological and Educational Research Studies
- Outsourcing and Supply Chain Management
- Railway Systems and Energy Efficiency
- Supply Chain Resilience and Risk Management
- Online Learning and Analytics
- Learning Styles and Cognitive Differences
- Law, logistics, and international trade
- Glaucoma and retinal disorders
- Online and Blended Learning
- Problem and Project Based Learning
- Human Mobility and Location-Based Analysis
- Graph theory and applications
- E-Learning and Knowledge Management
National University of Singapore
1999-2019
UNSW Sydney
2019
Advanced Digital Sciences Center
2000
We develop practical operations research models to support decision making in the design and management of public bicycle-sharing systems. a network flow model with proportionality constraints estimate bicycles within number trips supported, given an initial allocation at each station. also examine effectiveness periodic redistribution greater flow, impact on docks needed. conduct our numerical analysis using transit data from train operators Singapore. Given that substantial proportion...
The inventory routing problem is one of important and practical problems in logistics. It involves the integration management vehicle routing, both which are known to be NP-hard. In this paper, we combine local search network flows solve problem, by utilizing minimum cost flow sub-solutions as a guiding measure for search. We then integrate with standard VRPTW solver present experimental results overall based on instances extended from Solomon benchmark problems.
Objective: Training in an inhibitory control task has produced reductions alcohol use among heavy drinkers. However, the longevity of effects remains unknown, and much research used suboptimal conditions. Here, we assess effectiveness “Beer-NoGo” training to reduce consumption up 4 weeks after compared with a “Beer-Go” task, online version Brief Alcohol Intervention (BAI), Oddball condition. Method: Eighty-one regular drinkers were randomized into one four In Beer-NoGo condition,...
Appears in: ICERI2017 Proceedings Publication year: 2017Page: 300 (abstract only)ISBN: 978-84-697-6957-7ISSN: 2340-1095doi: 10.21125/iceri.2017.0127Conference name: 10th annual International Conference of Education, Research and InnovationDates: 16-18 November, 2017Location: Seville, Spain
A tree T is said to be bad, if it the vertex-disjoint union of two stars plus an edge joining center first star end-vertex second star. good, not bad. In this article, we prove a conjecture Alan Hartman that, for any spanning K2m, where m ≥ 4, there exists (2m − 1)-edge-coloring K2m such that all edges receive distinct colors and only good. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 7–17,