Youngho Lee

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A two-level location-allocation problem in designing local access fiber optic networks Computers & Operations Research	2016-11-10	Paper
Surrogate-RLT cuts for zero-one integer programs Journal of Global Optimization	2016-10-25	Paper
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting INFORMS Journal on Computing	2012-05-30	Paper
A splitter location-allocation problem in designing fiber optic access networks European Journal of Operational Research	2011-04-29	Paper
Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum Computers & Operations Research	2009-10-15	Paper
A ring-mesh topology design problem for optical transport networks Journal of Heuristics	2009-03-31	Paper
A new reformulation approach for the generalized partial covering problem Naval Research Logistics	2007-02-20	Paper
Partial convexification cuts for 0--1 mixed-integer programs European Journal of Operational Research	2005-04-21	Paper
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem Management Science	2002-04-17	Paper
An ATM switch capacity allocation problem Telecommunication Systems	2001-12-10	Paper
New modeling approaches for the design of local access transport area networks European Journal of Operational Research	2000-12-21	Paper
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem	2000-07-09	Paper
A hub location problem in designing digital data service networks: Lagrangian relaxation approach Location Science	2000-01-18	Paper
Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming Computational Optimization and Applications	1997-10-23	Paper
A Branch and Cut Algorithm for a Steiner Tree-Star Problem INFORMS Journal on Computing	1997-01-15	Paper
Tighter representations for set partitioning problems Discrete Applied Mathematics	1996-07-07	Paper
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope Operations Research Letters	1996-04-15	Paper
Scheduling target illuminators in naval battle-group anti-air warfare	1996-02-06	Paper
Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes SIAM Journal on Discrete Mathematics	1995-05-04	Paper
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem Annals of Operations Research	1994-12-01	Paper

Research outcomes over time

This page was built for person: Youngho Lee