The following pages link to Youngho Lee (Q218219):
Displaying 20 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
- A splitter location-allocation problem in designing fiber optic access networks (Q531477) (← links)
- Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum (Q732896) (← links)
- A ring-mesh topology design problem for optical transport networks (Q1009188) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (Q1366300) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem (Q2784114) (← links)
- Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting (Q2884489) (← links)
- A new reformulation approach for the generalized partial covering problem (Q3423275) (← links)
- A hub location problem in designing digital data service networks: Lagrangian relaxation approach (Q4228762) (← links)
- A branch-and-cut algorithm for solving an intraring synchronous optical network design problem (Q4488863) (← links)
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes (Q4764349) (← links)
- Scheduling target illuminators in naval battle-group anti-air warfare (Q4862296) (← links)
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem (Q5690260) (← links)
- An ATM switch capacity allocation problem (Q5950377) (← links)
