The following pages link to Andrew Lim (Q215216):
Displaying 50 items.
- Space defragmentation for packing problems (Q1926954) (← links)
- A prototype column generation strategy for the multiple container loading problem (Q1926980) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Linear-quadratic control and information relaxations (Q1939706) (← links)
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
- A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
- Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems (Q2253410) (← links)
- An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
- The freight consolidation and containerization problem (Q2256168) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
- A memetic algorithm for the multiperiod vehicle routing problem with profit (Q2355888) (← links)
- Particle swarm optimization and hill climbing for the bandwidth minimization problem (Q2383955) (← links)
- Robust empirical optimization is almost the same as mean-variance optimization (Q2417186) (← links)
- Optimal investment and consumption when regime transitions cause price shocks (Q2447410) (← links)
- Tariff concessions in production sourcing (Q2463506) (← links)
- A critical-shaking neighborhood search for the yard allocation problem (Q2503090) (← links)
- Multiple crossdocks with inventory and time windows (Q2565769) (← links)
- A local search using solution fragments for the 2-machine bicriteria scheduling problem (Q2643628) (← links)
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing (Q2668671) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips (Q2676410) (← links)
- On LQG control of linear stochastic systems with control dependent noise (Q2712230) (← links)
- (Q2741116) (← links)
- Linear-quadratic control of backward stochastic differential equations (Q2753213) (← links)
- A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows (Q2892357) (← links)
- An Investigation of IDA* Algorithms for the Container Relocation Problem (Q3082798) (← links)
- ROBUST ASSET ALLOCATION WITH BENCHMARKED OBJECTIVES (Q3100750) (← links)
- Pricing American-Style Derivatives with European Call Options (Q3115958) (← links)
- Solutions to the combined sensitivity and complementary sensitivity problem in control systems (Q3124475) (← links)
- Crane scheduling with spatial constraints (Q3156730) (← links)
- (Q3160511) (← links)
- (Q3160512) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Relative Entropy, Exponential Utility, and Robust Dynamic Pricing (Q3392069) (← links)
- Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees (Q3392206) (← links)
- The bottleneck problem with minimum quantity commitments (Q3423267) (← links)
- Mean-Variance Hedging When There Are Jumps (Q3427516) (← links)
- Transshipment through crossdocks with inventory and time windows (Q3442911) (← links)
- Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks (Q3600151) (← links)
- (Q4209618) (← links)
- (Q4209644) (← links)
- (Q4221641) (← links)
- (Q4221657) (← links)
- Efficient algorithms to find optimal paths in a public transportation network (Q4338573) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- Offset range problem for two blocks (Q4354101) (← links)
- State-space approach to the combined sensitivity and complementary sensitivity problem (Q4361710) (← links)
