The following pages link to Seulgi Joung (Q1728320):
Displaying 9 items.
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Lifting and separation of robust cover inequalities (Q4686680) (← links)
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)
- Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
- A new sequential lifting of robust cover inequalities (Q6492454) (← links)
