Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem

Documenti analoghi

• Heuristic algorithms for the stochastic critical node detection problem
  di: Bayarsaikhan, Tuguldur, et al.
  Pubblicazione: (2025)
• A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
  di: Au, Yu Hin, et al.
  Pubblicazione: (2025)
• The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
  di: Gaar, Elisabeth, et al.
  Pubblicazione: (2024)
• Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
  di: Au, Yu Hin, et al.
  Pubblicazione: (2025)
• Metaheuristic algorithms for the induced P-median problem with upgrades
  di: Salazar, Sergio, et al.
  Pubblicazione: (2026)