default search action
Brian Rodrigues
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j39]Mahmut Parlar, Brian Rodrigues, Moosa Sharafali:
Event-based allocation of airline check-in counters: a simple dynamic optimization method supported by empirical data. Int. Trans. Oper. Res. 25(5): 1553-1582 (2018) - [j38]Jie Sun
, Li-Zhi Liao, Brian Rodrigues:
Quadratic two-stage stochastic optimization with coherent measures of risk. Math. Program. 168(1-2): 599-613 (2018) - 2017
- [j37]Zhou Xu
An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem. Eur. J. Oper. Res. 257(3): 735-745 (2017) - 2015
- [j36]Zhou Xu
A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots. INFORMS J. Comput. 27(4): 636-645 (2015) - 2011
- [j35]Andrew Lim
New concepts for activity float in resource-constrained project management. Comput. Oper. Res. 38(6): 917-930 (2011) - [j34]Zhou Xu
An analysis of the extended Christofides heuristic for the k-depot TSP. Oper. Res. Lett. 39(3): 218-223 (2011) - 2010
- [c28]Zhou Xu
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem. SWAT 2010: 127-138
2000 – 2009
- 2009
- [j33]Yanzhi Li
Note - Pricing and Inventory Control for a Perishable Product. Manuf. Serv. Oper. Manag. 11(3): 538-542 (2009) - [c27]Linda L. Zhang, Brian Rodrigues:
A Petri Net Model of Process Platform-based Production Configuration. ICEIS (3) 2009: 5-12 - 2008
- [j32]Yunsong Guo, Yanzhi Li
Tariff concessions in production sourcing. Eur. J. Oper. Res. 187(2): 543-555 (2008) - [j31]Andrew Lim
Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees. Oper. Res. 56(3): 758-771 (2008) - [c26]Lianfeng Zhang, Brian Rodrigues, Jannes Slomp, Gerard J. C. Gaalman:
Production Configuration of Product Families - An Approach based on Petri Nets. ICEIS (3-2) 2008: 5-11 - 2007
- [j30]Gaofeng Huang, Andrew Lim
A local search using solution fragments for the 2-machine bicriteria scheduling problem. Comput. Optim. Appl. 37(2): 219-229 (2007) - [j29]Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Yang:
Minimizing the makespan for Unrelated Parallel Machines. Int. J. Artif. Intell. Tools 16(3): 399-415 (2007) - [j28]Andrew Lim
A Fast Algorithm for Bandwidth Minimization. Int. J. Artif. Intell. Tools 16(3): 537-544 (2007) - [j27]Zhaohui Fu, Yanzhi Li
Port space allocation with a time dimension. J. Oper. Res. Soc. 58(6): 797-807 (2007) - [j26]Yunsong Guo, Andrew Lim
Machine scheduling performance with maintenance and failure. Math. Comput. Model. 45(9-10): 1067-1080 (2007) - 2006
- [j25]Andrew Lim
Ant colony optimization with hill climbing for the bandwidth minimization problem. Appl. Soft Comput. 6(2): 180-188 (2006) - [j24]Ping Chen, Yunsong Guo, Andrew Lim
Multiple crossdocks with inventory and time windows. Comput. Oper. Res. 33: 43-63 (2006) - [j23]Yunsong Guo, Andrew Lim
Heuristics for a bidding problem. Comput. Oper. Res. 33: 2179-2188 (2006) - [j22]Andrew Lim
Heuristics for matrix bandwidth reduction. Eur. J. Oper. Res. 174(1): 69-91 (2006) - [j21]Andrew Lim
A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur. J. Oper. Res. 174(3): 1459-1478 (2006) - [j20]Andrew Lim
Scheduling sports competitions at multiple venues - Revisited. Eur. J. Oper. Res. 175(1): 171-186 (2006) - [j19]Yunsong Guo, Andrew Lim
Using a Lagrangian Heuristic for a Combinatorial Auction Problem. Int. J. Artif. Intell. Tools 15(3): 481-489 (2006) - [j18]Yunsong Guo, Andrew Lim
Carrier assignment models in transportation procurement. J. Oper. Res. Soc. 57(12): 1472-1481 (2006) - [j17]Andrew Lim
Two-machine flow shop problems with a single server. J. Sched. 9(6): 515-543 (2006) - [c25]Xi Li, Andrew Lim
Reducing Transportation Costs in Distribution Networks. IEA/AIE 2006: 1138-1148 - 2005
- [j16]Andrew Lim
Airport Gate Scheduling with Time Windows. Artif. Intell. Rev. 24(1): 5-31 (2005) - [j15]Andrew Lim
3-D Container Packing Heuristics. Appl. Intell. 22(2): 125-134 (2005) - [j14]H. Ding, Andrew Lim
The over-constrained airport gate assignment problem. Comput. Oper. Res. 32: 1867-1880 (2005) - [j13]Andrew Lim
A Note on the Optimal EOQ for Announced Price Increases in the Infinite Horizon. Oper. Res. 53(4): 731-732 (2005) - [j12]Andrew Lim
Tabu search embedded simulated annealing for the shortest route cut and fill problem. J. Oper. Res. Soc. 56(7): 816-824 (2005) - [j11]Andrew Lim
k-Center problems with minimum coverage. Theor. Comput. Sci. 332(1-3): 1-17 (2005) - [c24]Yunsong Guo, Yanzhi Li
A Multi-exchange Heuristic for a Production Location Problem. Australian Conference on Artificial Intelligence 2005: 871-874 - [c23]Yunsong Guo, Andrew Lim
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem. HICSS 2005 - [c22]Yunsong Guo, Andrew Lim
Using a Lagrangian Heuristic for a Combinatorial Auction Problem. ICTAI 2005: 99-103 - [c21]Andrew Lim
Heuristic methods for graph coloring problems. SAC 2005: 933-939 - 2004
- [j10]Andrew Lim
A Hybrid Framework for Over-Constrained Generalized. Artif. Intell. Rev. 22(3): 211-243 (2004) - [j9]Yunsong Guo, Andrew Lim
Minimizing total flow time in single machine environment with release time: an experimental analysis. Comput. Ind. Eng. 47(2-3): 123-140 (2004) - [j8]Ping Chen, Zhaohui Fu, Andrew Lim
The Two-Dimensional Packing Problem for Irregular Objects. Int. J. Artif. Intell. Tools 13(3): 429-448 (2004) - [j7]H. Ding, Andrew Lim
New heuristics for over-constrained flight to gate assignments. J. Oper. Res. Soc. 55(7): 760-768 (2004) - [j6]Andrew Lim
Manpower allocation with time windows. J. Oper. Res. Soc. 55(11): 1178-1186 (2004) - [j5]Yanzhi Li
Crossdocking - JIT scheduling with time windows. J. Oper. Res. Soc. 55(12): 1342-1351 (2004) - [j4]Andrew Lim
Metaheuristics with Local Search Techniques for Retail Shelf-Space Optimization. Manag. Sci. 50(1): 117-131 (2004) - [j3]Ping Chen, Zhaohui Fu, Andrew Lim
Port yard storage optimization. IEEE Trans Autom. Sci. Eng. 1(1): 26-37 (2004) - [c20]Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu:
Transshipment Through Crossdocks with Inventory and Time Windows. COCOON 2004: 122-131 - [c19]Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center Problems with Minimum Coverage. COCOON 2004: 349-359 - [c18]Andrew Lim, Brian Rodrigues, Zhou Xu:
Solving the Crane Scheduling Problem Using Intelligent Search Schemes. CP 2004: 747-751 - [c17]H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
Aircraft and Gate Scheduling Optimization at Airports. HICSS 2004 - [c16]Andrew Lim
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem. HICSS 2004 - [c15]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Heuristics for a Brokering Set Packing Problem. AI&M 2004 - [c14]Andrew Lim, Brian Rodrigues, Zhou Xu:
Approximation Schemes for the Crane Scheduling Problem. SWAT 2004: 323-335 - 2003
- [j2]Kai Song Goh, Andrew Lim
Sexual Selection for Genetic Algorithms. Artif. Intell. Rev. 19(2): 123-152 (2003) - [j1]Brenda Cheang
Nurse rostering problems - a bibliographic survey. Eur. J. Oper. Res. 151(3): 447-460 (2003) - [c13]Andrew Lim
Using an evolutionary algorithm for bandwidth minimization. IEEE Congress on Evolutionary Computation 2003: 678-683 - [c12]Zhaohui Fu, Andy Kurnia, Andrew Lim
Shortest path problem with cache dependent path lengths. IEEE Congress on Evolutionary Computation 2003: 2756-2761 - [c11]Andrew Lim, Brian Rodrigues, Fei Xiao:
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem. GECCO 2003: 1594-1595 - [c10]Ping Chen, Zhaohui Fu, Andrew Lim
The General Yard Allocation Problem. GECCO 2003: 1986-1997 - [c9]Ping Chen, Zhaohui Fu, Andrew Lim
Two-Dimensional acking For Irregular Shaped Objects. HICSS 2003: 86 - [c8]Yi Zhu, Andrew Lim, Brian Rodrigues:
Aircraft and Gate Scheduling with Time Windows. ICTAI 2003: 189-193 - [c7]Yunsong Guo, Andrew Lim, Brian Rodrigues:
Transportation Bid Analysis Optimization with Shipper Input. ICTAI 2003: 290- - [c6]Andrew Lim, Brian Rodrigues, Fei Xiao:
A New Node Centroid Algorithm for Bandwidth Minimization. IJCAI 2003: 1544-1545 - [c5]Haibing Li, Andrew Lim, Brian Rodrigues:
A Hybrid AI Approach for Nurse Rostering Problem. SAC 2003: 730-735 - [c4]Andrew Lim, Brian Rodrigues, Lei Song:
Manpower Scheduling with Time Windows. SAC 2003: 741-746 - 2002
- [c3]Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fei Xiao:
Over-Constrained Resource-Constrained Scheduling Problems with Prioritized Activities. FSKD 2002: 672-676 - [c2]Andrew Lim, Brian Rodrigues, Fei Xiao, Yi Zhu:
Crane Scheduling Using Tabu Search. ICTAI 2002: 146-153 - [c1]Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zhang:
Adjusted Network Flow for the Shelf-Space Allocation Problem. ICTAI 2002: 224-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: