Papers › Multi-Feasibility Variable Selection
Multi-Feasibility Variable Selection
Ali Fathi, Mohammad Rashid, Shayan Ranjbarzadeh, Mojtaba Tefagh
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper is the report of the problem proposed for the !Optimizer 2021 competition, and the solutions of the gold medalist team, i.e., the Panda team. The competition was held in two stages, the research and development stage and a two-week contest stage, consisting of five rounds, and seven teams succeeded in finishing both stages to the end. In this joint report of the winner team Panda and the problem design committee coordinated by Mojtaba Tefagh, we first explain each of the five rounds and then provide the solutions proposed by our team (Panda) to fulfill the required tasks in the fastest and most accurate way. Afterward, some preprocessing and data manipulating ideas used to enhance the algorithms would be presented. All codes are written in the Julia language, which showed a better performance than Python on optimization problems in our comparisons during the R&D stage, and are publicly available in the Github repository: https://github.com/Optimizer-Competition-Panda
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Datasets
Introduced by this paper, per the archive.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections