{"id":21614561,"url":"https://github.com/sproc01/alcuinproblem","last_synced_at":"2025-07-25T13:12:55.083Z","repository":{"id":193014869,"uuid":"607705305","full_name":"Sproc01/AlcuinProblem","owner":"Sproc01","description":"A resolver for a generic Alcuin problem","archived":false,"fork":false,"pushed_at":"2023-09-06T09:01:16.000Z","size":43348,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-18T16:55:35.293Z","etag":null,"topics":["alcuin","cplex","cplex-optimization-solver","graph","matplotlib","mip","networkx","numpy","operations-research","optimization","pandas","pyomo","python","python3","seaborn"],"latest_commit_sha":null,"homepage":"","language":"Shell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Sproc01.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-02-28T14:13:41.000Z","updated_at":"2023-09-06T08:59:21.000Z","dependencies_parsed_at":"2023-09-06T10:59:25.499Z","dependency_job_id":null,"html_url":"https://github.com/Sproc01/AlcuinProblem","commit_stats":null,"previous_names":["sproc01/alcuinproblem"],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/Sproc01/AlcuinProblem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sproc01%2FAlcuinProblem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sproc01%2FAlcuinProblem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sproc01%2FAlcuinProblem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sproc01%2FAlcuinProblem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Sproc01","download_url":"https://codeload.github.com/Sproc01/AlcuinProblem/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sproc01%2FAlcuinProblem/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267011051,"owners_count":24020888,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-25T02:00:09.625Z","response_time":70,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["alcuin","cplex","cplex-optimization-solver","graph","matplotlib","mip","networkx","numpy","operations-research","optimization","pandas","pyomo","python","python3","seaborn"],"created_at":"2024-11-24T22:08:23.957Z","updated_at":"2025-07-25T13:12:55.043Z","avatar_url":"https://github.com/Sproc01.png","language":"Shell","readme":"# AlcuinProblem\nThis project has the goal to study how much time is necessary to find if the generalization of Alcuin river crossing problem is feasible for a given graph and for a given number. This project comprehends different parts:\n- The model definition and resolver (requires CPLEX and Pyomo Python package)\n- The graph generator (requires Networkx Python package)\n- A file that convert the output from the graph generator to a dat file that can be used as input for the MIP resolver\n- A file that execute the model for all the graphs with CPLEX seed=0\n- A file that create SLURM file for all the graphs, each graph has 6 SLURM files because each graph must be resolved with 6 different CPLEX seed\n- A file for elaboration of the result (requires some Python package: Numpy, Matplotlib, Seaborn, Pandas)\n- A simple example of river crossing problem (graph: L-P-C) with the definition of a concrete and an abstract model\n\nThis program also shows some graphs about the time and one about the Alcuin Number of a graph highlighting the dependence between this number and the density of the graph.\n\nThis study is the center of my bachelor's degree thesis at University of Padua.\n\n# Requires\n- Python version 3.9\n- Numpy version 1.24.2\n- Pyomo version 6.5.0\n- CPLEX version 22.1.1 and his Python bindings\n- Networkx version 3.1\n- Matplotlib version 3.7.1\n- Seaborn version 0.12.2\n- Pandas version 2.0.1\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsproc01%2Falcuinproblem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsproc01%2Falcuinproblem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsproc01%2Falcuinproblem/lists"}