{"id":"https://openalex.org/W1563581022","doi":null,"title":"Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions","display_name":"Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions","publication_year":2001,"publication_date":"2001-11-21","ids":{"openalex":"https://openalex.org/W1563581022","mag":"1563581022"},"language":"en","primary_location":{"id":"mag:1563581022","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA54616876","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},"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/A5110594951","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-6480-2614","observed_orcids":["https://orcid.org/0000-0002-6480-2614"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael J\u00fcnger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028886943","display_name":"Denis Naddef","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Denis Naddef","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7081,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.70881226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7666000127792358,"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.7666000127792358,"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.21459999680519104,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.006599999964237213,"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":[{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.847000002861023},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.9490000009536743},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"branch-and-cut","score":0.8949999809265137},{"id":"https://openalex.org/keywords/production-planning","display_name":"production planning","score":0.7450000047683716},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.9909999966621399},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"branch-and-price","score":0.8569999933242798},{"id":"https://openalex.org/keywords/abacus","display_name":"abacus","score":0.7350000143051147},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.5609999895095825},{"id":"https://openalex.org/keywords/mathematical-programming-formulation","display_name":"mathematical programming formulation","score":0.4699999988079071}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7490280866622925},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.727846622467041},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7095819115638733},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6985411643981934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6763485670089722},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5772296190261841},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5664045810699463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5278068780899048},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5103594660758972},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5043987035751343},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.45101550221443176},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42296940088272095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3850182890892029},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1563581022","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA54616876","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/W2309035736","https://openalex.org/W1502497305","https://openalex.org/W7044981248","https://openalex.org/W7095408241","https://openalex.org/W157953303","https://openalex.org/W7101235701","https://openalex.org/W745862904","https://openalex.org/W2039648193","https://openalex.org/W2065577669","https://openalex.org/W3039915549"],"abstract_inverted_index":{"General":[0],"Mixed":[1],"Integer":[2],"Programming:":[3],"Computational":[4],"Issues":[5],"for":[6,20,29],"Branch-and-Cut":[7,27],"Algorithms.-":[8],"Projection":[9],"and":[10,18,32,39,42],"Lifting":[11],"in":[12,35],"Combinatorial":[13,30],"Optimization.-":[14],"Mathematical":[15],"Programming":[16],"Models":[17],"Formulations":[19],"Deterministic":[21],"Production":[22],"Planning":[23],"Problems.-":[24],"Lagrangian":[25],"Relaxation.-":[26],"Algorithms":[28],"Optimization":[31],"Their":[33],"Implementation":[34],"ABACUS.-":[36],"Branch,":[37],"Cut,":[38],"Price:":[40],"Sequential":[41],"Parallel.-":[43],"TSP":[44],"Cuts":[45],"Which":[46],"Do":[47],"Not":[48],"Conform":[49],"to":[50],"the":[51],"Template":[52],"Paradigm.":[53]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}