The following pages link to Osman Oguz (Q789317):
Displaying 13 items.
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- Data dependent worst case bound improving techniques in zero-one programming (Q811361) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem (Q879323) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- An integral transformation for integer programming problems (Q1062628) (← links)
- A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134) (← links)
- (Q1317167) (redirect page) (← links)
- A comparative study of computational procedures for the resource constrained project scheduling problem (Q1317169) (← links)
- Large scale linear programs and heuristics for the design of survivable telecommunication networks (Q1417789) (← links)
- Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming (Q3116775) (← links)
- A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms (Q4849260) (← links)
