The following pages link to Sung-Pil Hong (Q408388):
Displaying 19 items.
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- A genetic algorithm for joint replenishment based on the exact inventory cost (Q947954) (← links)
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (Q958076) (← links)
- Optimal search-relocation trade-off in Markovian-target searching (Q1001004) (← links)
- Approximation of the \(k\)-batch consolidation problem (Q1006079) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- A note on the strong polynomiality of convex quadratic programming (Q1804355) (← links)
- Towards real-time optimal VP management for ATM nets (Q1854860) (← links)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017) (← links)
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game (Q2070725) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Polynomiality of sparsest cuts with fixed number of sources (Q2467444) (← links)
- COLUMN GENERATION APPROACH TO LINE PLANNING WITH VARIOUS HALTING PATTERNS — APPLICATION TO THE KOREAN HIGH-SPEED RAILWAY (Q2853407) (← links)
- Approximation of a batch consolidation problem (Q3113503) (← links)
- Two-Server Network Disconnection Problem (Q3600164) (← links)
- On the Complexity of the Production-Transportation Problem (Q4877515) (← links)
- Approximability of the <i>k</i>‐server disconnection problem (Q5434594) (← links)
