The following pages link to Kyungsik Lee (Q223530):
Displaying 27 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- Distribution-robust single-period inventory control problem with multiple unreliable suppliers (Q331775) (← links)
- Computing lower bounds on basket option prices by discretizing semi-infinite linear programming (Q518129) (← links)
- The sparse signomial classification and regression model (Q744718) (← links)
- Integral polyhedra related to integer multicommodity flows on a cycle (Q968136) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- Economic spare capacity planning for DCS mesh-restorable networks (Q1303707) (← links)
- Design of local networks using USHRs (Q1854858) (← links)
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
- Norm ball classifier for one-class classification (Q2241193) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops (Q2307010) (← links)
- Distribution-robust loss-averse optimization (Q2361137) (← links)
- Embedded variable selection method using signomial classification (Q2400010) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements (Q3116739) (← links)
- Optimization Problems in the Simulation of Multifactor Portfolio Credit Risk (Q3600163) (← links)
- AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING (Q3635901) (← links)
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations (Q4648257) (← links)
- (Q4700653) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
- A branch-and-price algorithm for a targeting problem (Q5386381) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)
- Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
