All Stories

  1. Maximum probability shortest path problem
  2. Stochastic maximum weight forests
  3. Generating cutting planes for the semidefinite relaxation of quadratic programs
  4. Chance constrained 0–1 quadratic programs using copulas
  5. A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks
  6. Archimedean Copulas in Joint Chance-Constrained Programming
  7. A Sampling Method to Chance-constrained Semidefinite Optimization
  8. Comparison of Stochastic Programming Approaches for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts
  9. An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
  10. A chance constrained approach for uplink wireless OFDMA networks
  11. Distributionally Robust Stochastic Knapsack Problem
  12. Stochastic Resource Allocation for Uplink Wireless Multi-cell OFDMA Networks
  13. A completely positive representation of 0–1 linear programs with joint probabilistic constraints
  14. A polynomial formulation for the stochastic maximum weight forest problem
  15. Distributionally robust stochastic shortest path problem
  16. Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
  17. Bandwidth, Vertex Separators, and Eigenvalue Optimization
  18. Stochastic Frequency Assignment Problem
  19. A second-order cone programming approach for linear programs with joint probabilistic constraints
  20. Stochastic nuclear outages semidefinite relaxations
  21. A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs
  22. Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program
  23. Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
  24. A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
  25. On a stochastic bilevel programming problem
  26. Multi-service multi-facility network design under uncertainty
  27. Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
  28. On two-stage stochastic knapsack problems
  29. A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks
  30. Computing Upper Bounds for a LBPP with and without Probabilistic Constraints
  31. Stochastic Quadratic Knapsack with Recourse
  32. Semidefinite and Conic Programming for Robust wireless OFDMA networks
  33. Stochastic Shortest Path Problem with Delay Excess Penalty
  34. Knapsack problem with probability constraints
  35. Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
  36. Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA
  37. Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models
  38. B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty
  39. Telecommunication Network Capacity Design for Uncertain Demand
  40. Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems
  41. Graph partitioning using linear and semidefinite programming
  42. Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
  43. Column Generation Method for Network Design
  44. Nonoriented Multicommodity Flow Problems
  45. Nonoriented Multicommodity Flow Problems
  46. Multicommodity Flow Problems and Decomposition in Telecommunications Networks