{"id":"https://openalex.org/W1553621070","doi":null,"title":"Semidefinite Programming for Combinatorial Optimization","display_name":"Semidefinite Programming for Combinatorial Optimization","publication_year":2000,"publication_date":"2000-10-10","ids":{"openalex":"https://openalex.org/W1553621070","mag":"1553621070"},"language":"en","primary_location":{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-009237037","doi":null,"is_oa":false,"landing_page_url":"http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009237037&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"volume":null,"type":"book","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/A5058749822","display_name":"Christoph Helmberg","orcid":"https://orcid.org/0000-0002-5288-8000","observed_orcids":["https://orcid.org/0000-0002-5288-8000"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Christoph Helmberg","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-5288-8000","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5058749822"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.32,"has_fulltext":false,"cited_by_count":144,"citation_normalized_percentile":{"value":0.71428571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"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.9994999766349792,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.0,"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/semidefinite-programming","display_name":"semidefinite programming","score":1.0},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9860000014305115},{"id":"https://openalex.org/keywords/semidefinite-relaxation","display_name":"semidefinite relaxation","score":0.9169999957084656},{"id":"https://openalex.org/keywords/positive-semidefinite-matrices","display_name":"positive semidefinite matrices","score":0.9120000004768372},{"id":"https://openalex.org/keywords/duality-theory","display_name":"duality theory","score":0.8510000109672546},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.9559999704360962},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.675000011920929},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.7440000176429749},{"id":"https://openalex.org/keywords/large-scale-optimization","display_name":"large-scale optimization","score":0.6589999794960022}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.9402470588684082},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.8338974714279175},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7474725246429443},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6467036008834839},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6456384658813477},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5598085522651672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5552762746810913},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5521525144577026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5421463251113892},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5353866815567017},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.509149968624115},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.47238802909851074},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.45348140597343445},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.45044201612472534},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4238489866256714},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.42021432518959045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33240246772766113},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.19487783312797546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.177853524684906},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.11523327231407166},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"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/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-009237037","doi":null,"is_oa":false,"landing_page_url":"http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009237037&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:1553621070","doi":null,"is_oa":false,"landing_page_url":"https://opus4.kobv.de/opus4-zib/files/602/ZR-00-34.pdf","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W641613623","https://openalex.org/W2792481128","https://openalex.org/W7101118112","https://openalex.org/W2061607408","https://openalex.org/W7095797775","https://openalex.org/W1857841162","https://openalex.org/W4298548415","https://openalex.org/W6889759382","https://openalex.org/W7097838859","https://openalex.org/W2051306216"],"abstract_inverted_index":{"This":[0],"book":[1],"offers":[2],"a":[3],"self-contained":[4],"introduction":[5],"to":[6,59,141,154],"the":[7,23,26,37,52,70,83,101,116,125,143,148],"field":[8],"of":[9,62,115,158],"semidefinite":[10,34,48,60,80,112,156],"programming,":[11,45],"its":[12,18,87],"applications":[13],"in":[14,98,120,152],"combinatorial":[15,63,159],"optimization,":[16],"and":[17,36,50,65,90],"computational":[19,76],"methods.":[20],"We":[21,56,138],"equip":[22],"reader":[24],"with":[25,75,147],"basic":[27],"results":[28],"from":[29,43],"linear":[30,44,122],"algebra":[31],"on":[32],"positive":[33],"matrices":[35],"cone":[38],"spanned":[39],"by":[40,134],"them.":[41],"Starting":[42],"we":[46,73,96],"introduce":[47],"programs":[49],"discuss":[51],"associated":[53],"duality":[54],"theory.":[55],"then":[57],"turn":[58],"relaxations":[61,157],"optimization":[64,160],"illustrate":[66],"their":[67],"interrelation.":[68],"In":[69],"second":[71],"half":[72],"deal":[74],"methods":[77,146],"for":[78,109],"solving":[79],"programs.":[81],"First,":[82],"interior":[84],"point":[85],"approach,":[86],"iteration":[88],"complexity,":[89],"implementational":[91],"issues":[92],"are":[93],"discussed.":[94],"Next,":[95],"explain":[97],"great":[99],"detail":[100],"spectral":[102],"bundle":[103],"method,":[104],"which":[105,129],"is":[106,124],"particularly":[107],"suited":[108],"large":[110],"scale":[111],"programming.":[113],"One":[114],"most":[117],"successful":[118],"techniques":[119],"integer":[121],"programming":[123],"cutting":[126,149],"plane":[127,150],"approach":[128,151],"improves":[130],"an":[131],"initial":[132],"relaxation":[133],"adding":[135],"violated":[136],"inequalities.":[137],"explore":[139],"possibilities":[140],"combine":[142],"two":[144],"solution":[145],"order":[153],"strengthen":[155],"problems.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":13}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}