The following pages link to Sungsoo Park (Q223531):
Displayed 36 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- ATM VP-based network design (Q596263) (← links)
- Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- Item:Q223531 (redirect page) (← links)
- Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks (Q863572) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- A linear program for the two-hub location problem (Q1278146) (← links)
- Joint price and lot size determination under conditions of permissible delay in payments and quantity discounts for freight cost (Q1278244) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← links)
- Economic spare capacity planning for DCS mesh-restorable networks (Q1303707) (← links)
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Design of local networks using USHRs (Q1854858) (← links)
- Algorithms for the variable sized bin packing problem (Q1869719) (← links)
- Optimal multicast route packing (Q2378485) (← links)
- Embedded variable selection method using signomial classification (Q2400010) (← links)
- Optimality of the Symmetric Workload Allocation in a Single-Server Flow Line System (Q3116649) (← links)
- Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements (Q3116739) (← links)
- AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING (Q3635901) (← links)
- Efficient operation of a surface mounting machine with a multihead turret (Q4230130) (← links)
- An Integer Programming Approach to the Bandwidth Packing Problem (Q4363676) (← links)
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations (Q4648257) (← links)
- Lifting and separation of robust cover inequalities (Q4686680) (← links)
- (Q4700653) (← links)
- (Q4944738) (← links)
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← 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)
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links (Q5954827) (← links)
- A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty (Q6363599) (← links)
- Using the WOWA criterion for two-stage decision making problems (Q6365354) (← links)
- Robust solutions for stochastic and distributionally robust chance-constrained binary knapsack problems (Q6368478) (← links)