The following pages link to Andrew Lim (Q215216):
Displaying 50 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem (Q299777) (← links)
- Identifying future defaulters: a hierarchical Bayesian method (Q299813) (← links)
- Solving the container relocation problem by an improved greedy look-ahead heuristic (Q300075) (← links)
- (Q319189) (redirect page) (← links)
- On service consistency in multi-period vehicle routing (Q319190) (← links)
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- Two exact algorithms for the traveling umpire problem (Q319246) (← links)
- The multiple container loading problem with preference (Q320625) (← links)
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- The freight allocation problem with lane cost balancing constraint (Q439318) (← links)
- New concepts for activity float in resource-constrained project management (Q622136) (← links)
- The multiple container loading cost minimization problem (Q635154) (← links)
- Conditional value-at-risk in portfolio optimization: coherent but fragile (Q635502) (← links)
- A benchmarking approach to optimal asset allocation for insurers and pension funds (Q659228) (← links)
- Optimal risk transfer for agents with germs (Q661203) (← links)
- Minimum area joining of k compacted cells (Q671255) (← links)
- Separation theorem for linearly constrained LQG optimal control (Q671586) (← links)
- Single jog minimum area joining of compacted cells (Q689614) (← links)
- Example-based learning particle swarm optimization for continuous optimization (Q713081) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Two-machine flow shop problems with a single server (Q880567) (← links)
- Truck dock assignment problem with operational time constraint within crossdocks (Q948655) (← links)
- The algorithmic complexity of colour switching (Q1199936) (← links)
- The berth planning problem (Q1271388) (← links)
- Discrete time LQG controls with control dependent noise (Q1285495) (← links)
- A quasi-separation theorem for LQG optimal control with IQ constraints (Q1390843) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- Nurse rostering problems -- a bibliographic survey. (Q1410304) (← links)
- A path following algorithm for infinite quadratic programming on a Hilbert space (Q1576802) (← links)
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- A greedy aggregation-decomposition method for intermittent demand forecasting in fashion retailing (Q1749490) (← links)
- A feasibility-based heuristic for the container pre-marshalling problem (Q1752173) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- \(k\)-center problems with minimum coverage (Q1770377) (← links)
- Dynamic portfolio selection with market impact costs (Q1785239) (← links)
- Multiple-objective risk-sensitive control and its small noise limit (Q1868064) (← links)
- A reference length approach for the 3D strip packing problem (Q1926699) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem (Q1926951) (← links)
