{"id":"https://openalex.org/W2031822344","doi":"https://doi.org/10.1007/s00454-004-2878-4","title":"Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem","display_name":"Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem","publication_year":2004,"publication_date":"2004-05-21","ids":{"openalex":"https://openalex.org/W2031822344","doi":"https://doi.org/10.1007/s00454-004-2878-4","mag":"2031822344"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-004-2878-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-004-2878-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-2878-4.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-2878-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008416129","display_name":"U. Betke","orcid":null},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ulrich Betke","raw_affiliation_strings":["Fachbereich Mathematik, Universit\u00e4t Siegen,\n D-57068 Siegen, Germany","Fachbereich Mathematik, Universit\u00e4t Siegen,#N# D-57068 Siegen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik, Universit\u00e4t Siegen,\n D-57068 Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]},{"raw_affiliation_string":"Fachbereich Mathematik, Universit\u00e4t Siegen,#N# D-57068 Siegen","institution_ids":["https://openalex.org/I206895457"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008416129"],"corresponding_institution_ids":["https://openalex.org/I206895457"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.14223706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7587060332298279},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6142231822013855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5843193531036377},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.553534746170044},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5507607460021973},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.539570152759552},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.4996979236602783},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48222529888153076},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47829562425613403},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44766613841056824},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.4282182455062866},{"id":"https://openalex.org/keywords/unit-sphere","display_name":"Unit sphere","score":0.428059458732605},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.41262930631637573},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4124418795108795},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3418201804161072},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.11785492300987244},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.11237043142318726},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0739554762840271}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7587060332298279},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6142231822013855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5843193531036377},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.553534746170044},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5507607460021973},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.539570152759552},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4996979236602783},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48222529888153076},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47829562425613403},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44766613841056824},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.4282182455062866},{"id":"https://openalex.org/C191948623","wikidata":"https://www.wikidata.org/wiki/Q1307800","display_name":"Unit sphere","level":2,"score":0.428059458732605},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.41262930631637573},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4124418795108795},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3418201804161072},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.11785492300987244},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.11237043142318726},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0739554762840271},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00454-004-2878-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-004-2878-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-2878-4.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.237.1265","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.237.1265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/math/0206125v1.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/s00454-004-2878-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-004-2878-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-2878-4.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2031822344.pdf","grobid_xml":"https://content.openalex.org/works/W2031822344.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1597196612","https://openalex.org/W1971915361","https://openalex.org/W2033040247","https://openalex.org/W2033511209","https://openalex.org/W2071563913","https://openalex.org/W2100440346","https://openalex.org/W2321466613","https://openalex.org/W2329579984","https://openalex.org/W2333501349","https://openalex.org/W2340149117","https://openalex.org/W2611147814","https://openalex.org/W2798909945","https://openalex.org/W4232419289","https://openalex.org/W4245047469","https://openalex.org/W4246983979","https://openalex.org/W4300645277","https://openalex.org/W6830679135"],"related_works":["https://openalex.org/W4388279198","https://openalex.org/W61976518","https://openalex.org/W2114808974","https://openalex.org/W2181661122","https://openalex.org/W2357060777","https://openalex.org/W2030563458","https://openalex.org/W1709621369","https://openalex.org/W2161977250","https://openalex.org/W2350903564","https://openalex.org/W2318926272"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}