{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/multi-feasibility-variable-selection","title":"Multi-Feasibility Variable Selection","arxiv_id":"2110.00819","date":"2021-10-02","proceeding":null,"authors":["Ali Fathi","Mohammad Rashid","Shayan Ranjbarzadeh","Mojtaba Tefagh"],"abstract":"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","url_abs":"https://arxiv.org/abs/2110.00819v1","url_pdf":"https://arxiv.org/pdf/2110.00819v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"multi-feasibility-variable-selection","repo_url":"https://github.com/Optimizer-Competition-Pandas/Main","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[{"slug":"optimizer-2021-data","name":"!Optimizer 2021 Data","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Optimizer-Competition-Pandas/Main","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ebf6a596321fa841883b1ef5dc855fd0020dffc0f5018f62df31b93f14bb2ba2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}