{"id":"https://openalex.org/W4311000018","doi":"https://doi.org/10.48550/arxiv.2212.04268","title":"Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming","display_name":"Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4311000018","doi":"https://doi.org/10.48550/arxiv.2212.04268"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2212.04268","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"posted-content","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/2212.04268","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032744759","display_name":"Meijia Han","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Han, Meijia","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100413098","display_name":"Wenxing Zhu","orcid":"https://orcid.org/0000-0002-8698-0024"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhu, Wenxing","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":60},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9817,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9817,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9793,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.69696134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.69185203},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.56057525},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5273997},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4383536},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.428544},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.4260112},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.41849428},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.37918553},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22150394},{"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":[{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2212.04268","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.2212.04268","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2212.04268","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W90125000","https://openalex.org/W4386394964","https://openalex.org/W4245568382","https://openalex.org/W4205348974","https://openalex.org/W3182682721","https://openalex.org/W2368660077","https://openalex.org/W2337360258","https://openalex.org/W2182614003","https://openalex.org/W2080462934","https://openalex.org/W175643398"],"abstract_inverted_index":{"The":[0],"0-1":[1],"linear":[2,35,64],"programming":[3,65],"problem":[4,31,40,60],"with":[5],"nonnegative":[6,74,100,127],"constraint":[7,79],"matrix":[8,80],"and":[9,61,81,95,142],"objective":[10],"vector":[11],"e":[12],"origins":[13],"from":[14,32],"many":[15],"NP-hard":[16],"combinatorial":[17],"optimization":[18,45,59],"problems.":[19],"In":[20,67],"this":[21],"paper,":[22],"we":[23,48,72,86,112,131],"consider":[24,49],"recovering":[25],"an":[26],"optimal":[27,54],"solution":[28,55],"to":[29,69,90,109,124,135],"the":[30,39,50,53,57,62,78,82,99,104,121,126],"a":[33,43,92,114],"weighted":[34,63,83],"programming.We":[36],"first":[37],"formulate":[38],"equivalently":[41],"as":[42],"sparse":[44,58],"problem.":[46,66],"Next,":[47],"consistency":[51],"of":[52,56,77,120],"order":[68],"achieve":[70],"this,":[71],"establish":[73],"partial":[75,101,128],"s-goodness":[76],"vector.":[84],"Further,":[85],"use":[87],"two":[88,105,122],"quantities":[89,106,123],"characterize":[91],"sufficient":[93],"condition":[94,97],"necessary":[96],"for":[98,118],"s-goodness.":[102,129],"However,":[103],"are":[107],"difficult":[108],"calculate,":[110],"therefore,":[111],"provide":[113],"computable":[115],"upper":[116],"bound":[117],"one":[119],"verify":[125],"Finally,":[130],"give":[132],"three":[133],"examples":[134],"illustrate":[136],"that":[137],"our":[138],"theory":[139],"is":[140],"effective":[141],"verifiable.":[143]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4311000018","counts_by_year":[],"updated_date":"2024-12-15T18:54:40.378839","created_date":"2022-12-22"}