{"id":"https://openalex.org/W2087574766","doi":"https://doi.org/10.1145/2817460.2817503","title":"Linear programming to approximate quadratic 0-1 maximization problems","display_name":"Linear programming to approximate quadratic 0-1 maximization problems","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2087574766","doi":"https://doi.org/10.1145/2817460.2817503","mag":"2087574766"},"language":"en","primary_location":{"id":"doi:10.1145/2817460.2817503","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2817460.2817503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074508101","display_name":"Alain Billionnet","orcid":"https://orcid.org/0000-0002-0785-7117"},"institutions":[{"id":"https://openalex.org/I4210097372","display_name":"\u00c9cole Nationale Sup\u00e9rieure d\u2019Informatique pour l\u2019Industrie et l\u2019Entreprise","ror":"https://ror.org/00tx98v53","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210097372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alain Billionnet","raw_affiliation_strings":["Institut d'Informatique d'Entreprise, Evry Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut d'Informatique d'Entreprise, Evry Cedex, France","institution_ids":["https://openalex.org/I4210097372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058178414","display_name":"Fr\u00e9d\u00e9ric Roupin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210097372","display_name":"\u00c9cole Nationale Sup\u00e9rieure d\u2019Informatique pour l\u2019Industrie et l\u2019Entreprise","ror":"https://ror.org/00tx98v53","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210097372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Roupin","raw_affiliation_strings":["Institut d'Informatique d'Entreprise, Evry Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut d'Informatique d'Entreprise, Evry Cedex, France","institution_ids":["https://openalex.org/I4210097372"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210097372"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6414942741394043},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6243512034416199},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6083359718322754},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6005091667175293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5875160694122314},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5630502104759216},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5159912109375},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5016846656799316},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4956768751144409},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4626847505569458},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4292074143886566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.309967577457428},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.057132065296173096}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6414942741394043},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6243512034416199},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6083359718322754},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6005091667175293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5875160694122314},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5630502104759216},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5159912109375},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5016846656799316},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4956768751144409},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4626847505569458},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4292074143886566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.309967577457428},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.057132065296173096},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2817460.2817503","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2817460.2817503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1980985059","https://openalex.org/W2005982472","https://openalex.org/W2006278018","https://openalex.org/W2006293258","https://openalex.org/W2027669460","https://openalex.org/W2043896070","https://openalex.org/W2053913299"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2999799752","https://openalex.org/W2372768926","https://openalex.org/W2151412766","https://openalex.org/W2123068254","https://openalex.org/W2370179558","https://openalex.org/W3213429012"],"abstract_inverted_index":{"Many":[0],"authors":[1],"have":[2],"used":[3],"the":[4,26,45,90,108,115],"continuous":[5],"relaxation":[6],"of":[7,10,25,92,122],"linear":[8,17,30,55,74],"formulations":[9],"quadratic":[11,68,95],"0-1":[12,46,69],"optimization":[13],"problems":[14,71,88],"subject":[15,72],"to":[16,21,58,60,73],"constraints":[18],"in":[19],"order":[20],"obtain":[22,81],"a":[23,53,104,120],"bound":[24],"optimal":[27,34],"value":[28],"by":[29],"programming.":[31],"But":[32],"usually,":[33],"solutions":[35],"are":[36,41],"non-integer":[37],"vectors,":[38],"and":[39,114],"thus":[40],"not":[42],"feasible":[43],"for":[44,66,85],"problem.":[47],"In":[48],"this":[49,78],"paper,":[50],"we":[51,80],"propose":[52],"based":[54],"programming":[56],"scheme":[57],"try":[59],"build":[61],"\u03b5-approximate":[62,82],"polynomial":[63],"time":[64],"algorithms":[65,84],"any":[67],"maximization":[70,91],"constraints.":[75],"By":[76],"using":[77],"scheme,":[79],"polynomial-time":[83],"several":[86],"basic":[87],":":[89],"an":[93,97],"unconstrained":[94],"posiform,":[96],"assignment":[98],"problem":[99,110,117],"which":[100],"contains":[101],"k-max-cut":[102],"as":[103],"particular":[105],"case,":[106],"k-max-cut,":[107],"k-cluster":[109],"on":[111],"bipartite":[112],"graphs,":[113],"bipartitioning":[116],"(max-cut":[118],"with":[119],"set":[121],"cardinal":[123],"k).":[124]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}