ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2306.14690
  4. Cited By
Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms,
  and Applications

Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications

26 June 2023
Xuanfeng Li
Shengcai Liu
J. Wang
Xiao Chen
Yew-Soon Ong
Jiaheng Zhang
ArXivPDFHTML

Papers citing "Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications"

2 / 2 papers shown
Title
Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem
Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem
Thilina Pathirage Don
Aneta Neumann
Frank Neumann
36
0
0
01 May 2025
How Good Is Neural Combinatorial Optimization? A Systematic Evaluation
  on the Traveling Salesman Problem
How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
Shengcai Liu
Yu Zhang
K. Tang
Xin Yao
69
40
0
22 Sep 2022
1