{"id":29165315,"url":"https://github.com/michael-markl/mixed-integer-linear-program","last_synced_at":"2026-02-05T19:33:55.477Z","repository":{"id":79131677,"uuid":"150107999","full_name":"michael-markl/mixed-integer-linear-program","owner":"michael-markl","description":"Obere Schranken für optimale Lösungen gemischt-ganzzahliger Porgramme","archived":false,"fork":false,"pushed_at":"2018-11-13T11:31:01.000Z","size":2320,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-07-01T07:11:47.706Z","etag":null,"topics":["davenport","linear-programming","mixed-integer-program","mixed-integer-programming"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/michael-markl.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2018-09-24T13:36:10.000Z","updated_at":"2018-11-13T11:31:02.000Z","dependencies_parsed_at":"2023-05-23T10:00:35.907Z","dependency_job_id":null,"html_url":"https://github.com/michael-markl/mixed-integer-linear-program","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/michael-markl/mixed-integer-linear-program","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michael-markl%2Fmixed-integer-linear-program","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michael-markl%2Fmixed-integer-linear-program/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michael-markl%2Fmixed-integer-linear-program/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michael-markl%2Fmixed-integer-linear-program/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/michael-markl","download_url":"https://codeload.github.com/michael-markl/mixed-integer-linear-program/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michael-markl%2Fmixed-integer-linear-program/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29130550,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-05T18:55:47.139Z","status":"ssl_error","status_checked_at":"2026-02-05T18:55:04.010Z","response_time":65,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["davenport","linear-programming","mixed-integer-program","mixed-integer-programming"],"created_at":"2025-07-01T07:10:58.914Z","updated_at":"2026-02-05T19:33:55.471Z","avatar_url":"https://github.com/michael-markl.png","language":"TeX","readme":"# Abstände optimaler Lösungen gemischt-ganzzahliger Programme\nObere Schranken für optimale Lösungen gemischt-ganzzahliger Porgramme\n\nThis is a **German-only project**, based on **English sources**, that can be found here: https://link.springer.com/article/10.1007%2Fs10107-018-1323-z\n\n## Einleitung\n\nEin gemischt-ganzzahliges Programm ist ein lineares Optimierungsprogramm, bei dem die Variablen einer bestimmten Indexmenge als ganzzahlig beschränkt sind.\nEs werden bisherige Resultate verstärkt, die eine Abschätzung von Abständen optimaler Lösungen von Programmen, die sich nur in der Indexmenge unterscheiden, anhand der Anzahl an Variablen und Δ geben.\nDie Größe Δ quantifiziert dabei den größten Absolutwert der Determinanten aller quadratischer Untermatrizen.\nEs wird eine Abschätzung gezeigt, die nur die Anzahl ganzzahliger Variablen und Δ verwendet, und die Vermutung diskutiert, dass der Abstand gemischt-ganzzahliger Probleme allein von Δ abhängt, wobei Szenarien untersucht werden, die diese Vermutung bestätigen.\n\n## PDF-Dateien\n\nDie Ausarbeitung ist [hier](seminararbeit.pdf) zu finden; ein dazugehöriger Foliensatz ist [hier](beamer.pdf) und ein Handout [hier](handout.pdf) abrufbar.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichael-markl%2Fmixed-integer-linear-program","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmichael-markl%2Fmixed-integer-linear-program","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichael-markl%2Fmixed-integer-linear-program/lists"}