{"id":"https://openalex.org/W438348346","doi":null,"title":"Approximation de programmes quadratiques en 0-1 soumis a des contraintes lineaires. Application aux problemes de placement et de partition de graphes","display_name":"Approximation de programmes quadratiques en 0-1 soumis a des contraintes lineaires. Application aux problemes de placement et de partition de graphes","alternate_titles":[],"publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W438348346","mag":"438348346"},"language":"fr","primary_location":{"id":"mag:438348346","doi":null,"is_oa":false,"landing_page_url":"http://www.theses.fr/1996CNAM0242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W438348346"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5058178414","display_name":"Fr\u00e9d\u00e9ric Roupin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fr\u00e9d\u00e9ric Roupin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5058178414"],"corresponding_institution_ids":[],"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":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6909000277519226,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6909000277519226,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.2849000096321106,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0044999998062849045,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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-constraints","display_name":"linear constraints","score":0.9100000262260437},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6510000228881836},{"id":"https://openalex.org/keywords/performance-guarantees","display_name":"performance guarantees","score":0.8679999709129333},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.765999972820282},{"id":"https://openalex.org/keywords/continuous-linear-programming","display_name":"continuous linear programming","score":0.7870000004768372},{"id":"https://openalex.org/keywords/epsilon-approximation","display_name":"epsilon-approximation","score":0.7459999918937683},{"id":"https://openalex.org/keywords/k-clusters","display_name":"K-clusters","score":0.6990000009536743},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.9229999780654907},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.6639999747276306},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9079999923706055}],"concepts":[{"id":"https://openalex.org/C15708023","wikidata":"https://www.wikidata.org/wiki/Q80083","display_name":"Humanities","level":1,"score":0.6801927089691162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.489553302526474},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.3461770713329315},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.24445444345474243}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:438348346","doi":null,"is_oa":false,"landing_page_url":"http://www.theses.fr/1996CNAM0242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W594689785","https://openalex.org/W437581330","https://openalex.org/W2740547528","https://openalex.org/W7143308545","https://openalex.org/W2884804765","https://openalex.org/W101336351","https://openalex.org/W2586552965","https://openalex.org/W588657770","https://openalex.org/W1525099127","https://openalex.org/W4301143437"],"abstract_inverted_index":{"Le":[0,41],"probleme":[1,67,149,219],"de":[2,4,12,20,34,48,54,72,89,91,101,108,125,139,150,192,203,205,220,222],"placement":[3,151,221],"taches":[5,223],"dans":[6,51,224],"un":[7,52,148,225],"systeme":[8,226],"distribue":[9],"sans":[10,93,146],"contraintes":[11,71,116,182],"capacite":[13],"sur":[14,45,123],"les":[15,106,160],"processeurs":[16],"et":[17,27,130,163,250],"avec":[18,32,70,133,238],"couts":[19],"communication":[21],"uniformes":[22],"est":[23,43,75,118,121,131,189],"etudie":[24],"en":[25,83,111,197,215],"detail,":[26],"deux":[28,169,228],"nouveaux":[29],"algorithmes":[30,229],"approches":[31],"garanties":[33,90],"performance":[35,92],"sont":[36,184,246],"proposes":[37],"pour":[38,77,105,159,172],"sa":[39],"resolution.":[40],"premier":[42],"fonde":[44],"la":[46,61,126,164,173,193,209],"notion":[47],"coupe":[49],"isolante":[50],"graphe":[53],"stone,":[55],"alors":[56],"que":[57,94,154,243],"le":[58,66,239],"deuxieme":[59],"utilise":[60],"programmation":[62,127],"lineaire":[63,128],"continue.":[64],"Pour":[65],"plus":[68,248],"general":[69],"capacite,":[73],"il":[74],"demontre":[76],"plusieurs":[78,136],"variantes":[79],"qu'aucun":[80],"algorithme":[81],"s'executant":[82],"temps":[84],"polynomial":[85],"ne":[86,152],"peut":[87],"presenter":[88],"p=np.":[95],"Deuxiemement,":[96],"une":[97,190],"nouvelle":[98],"methode":[99],"generale":[100],"construction":[102],"d'algorithmes":[103],"epsilon-approches":[104],"problemes":[107,137],"maximisation":[109],"quadratiques":[110,177],"0-1":[112,216],"soumis":[113,179],"a":[114,135,180],"des":[115,155,175,181,252],"lineaires":[117,183,199],"exposee.":[119],"Elle":[120],"fondee":[122],"l'utilisation":[124],"continue,":[129],"appliquee":[132],"succes":[134],"classiques":[138],"l'optimisation":[140],"combinatoire":[141],"(maximisation":[142],"d'une":[143],"posiforme":[144],"quadratique":[145,195,214],"contraintes,":[147],"comportant":[153],"gains,":[156],"k-max-cut,":[157],"k-cluster":[158],"graphes":[161],"bipartis,":[162],"bipartition":[165],"d'un":[166],"graphe).":[167],"Enfin,":[168],"nouvelles":[170],"heuristiques":[171,245],"resolution":[174],"programmes":[176],"continus":[178],"proposees.":[185],"Leur":[186],"principe":[187],"commun":[188],"reduction":[191],"fonction":[194],"initiale":[196],"fonctions":[198],"par":[200],"fixation":[201],"alternee":[202],"groupes":[204],"variables.":[206],"En":[207],"utilisant":[208],"relaxation":[210],"continue":[211],"du":[212],"programme":[213],"associe":[217],"au":[218],"distribue,":[227],"performants":[230],"ont":[231],"ete":[232],"obtenus.":[233],"Les":[234],"tests":[235],"comparatifs":[236],"effectues":[237],"recuit":[240],"simule":[241],"montrent":[242],"nos":[244],"beaucoup":[247],"rapides":[249],"fournissent":[251],"resultats":[253],"d'aussi":[254],"bonne":[255],"qualite":[256]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W438348346","counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
