{"id":"https://openalex.org/W1742521026","doi":"https://doi.org/10.55430/6116v1mb","title":"Optimization: Principles and Algorithms","display_name":"Optimization: Principles and Algorithms","publication_year":2015,"publication_date":"2015-03-09","ids":{"openalex":"https://openalex.org/W1742521026","doi":"https://doi.org/10.55430/6116v1mb","mag":"1742521026"},"language":"en","primary_location":{"id":"doi:10.55430/6116v1mb","doi":"https://doi.org/10.55430/6116v1mb","is_oa":false,"landing_page_url":"https://doi.org/10.55430/6116v1mb","pdf_url":null,"source":{"id":"https://openalex.org/S4306463242","display_name":"EPFL Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"edited-book"},"volume":null,"type":"book","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/211191","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045648021","display_name":"Michel Bierlaire","orcid":"https://orcid.org/0000-0002-5275-7692","observed_orcids":["https://orcid.org/0000-0002-5275-7692"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bierlaire Michel","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-5275-7692","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5045648021"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2698,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.4375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"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.9955999851226807,"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.9955999851226807,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.001500000013038516,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0010000000474974513,"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/optimization","display_name":"optimization","score":0.9070000052452087},{"id":"https://openalex.org/keywords/unconstrained-optimization","display_name":"unconstrained optimization","score":0.9079999923706055},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":0.9990000128746033},{"id":"https://openalex.org/keywords/descent-methods","display_name":"descent methods","score":0.9629999995231628},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"conjugate gradient method","score":0.8330000042915344},{"id":"https://openalex.org/keywords/newton-s-method","display_name":"Newton's method","score":0.8090000152587891},{"id":"https://openalex.org/keywords/quasi-newton-methods","display_name":"quasi-Newton methods","score":0.9990000128746033},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9570000171661377},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.9980000257492065},{"id":"https://openalex.org/keywords/trust-region-method","display_name":"trust region method","score":0.9909999966621399},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":1.0},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"discrete optimization","score":0.9589999914169312},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8840000033378601},{"id":"https://openalex.org/keywords/network-optimization","display_name":"network optimization","score":0.9959999918937683},{"id":"https://openalex.org/keywords/integer-programming","display_name":"integer programming","score":1.0},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.7829999923706055},{"id":"https://openalex.org/keywords/optimization-algorithms","display_name":"optimization algorithms","score":0.7630000114440918}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5538792610168457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5400887131690979},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5151204466819763},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4957674443721771},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.46136894822120667},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.40441441535949707},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.34184080362319946},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3214539587497711},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3120390772819519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3087446093559265},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23825237154960632},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.55430/6116v1mb","doi":"https://doi.org/10.55430/6116v1mb","is_oa":false,"landing_page_url":"https://doi.org/10.55430/6116v1mb","pdf_url":null,"source":{"id":"https://openalex.org/S4306463242","display_name":"EPFL Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"edited-book"},{"id":"pmh:oai:infoscience.epfl.ch:211191","doi":null,"is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/211191","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.tind.io:211191","doi":null,"is_oa":true,"landing_page_url":"http://www.optimizationprinciplesalgorithms.com","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"book"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:211191","doi":null,"is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/211191","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"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/W2622782325","https://openalex.org/W648446685","https://openalex.org/W2807226938","https://openalex.org/W4388136435","https://openalex.org/W2009770514","https://openalex.org/W4253719907","https://openalex.org/W4235944774","https://openalex.org/W4247971148","https://openalex.org/W4230423075","https://openalex.org/W4255767174"],"abstract_inverted_index":{"Every":[0],"engineer":[1],"and":[2,29,55,60,73,91,100,105,111,119,127,150,227,241,267,279],"decision":[3],"scientist":[4],"must":[5],"have":[6],"a":[7,46,52,140,157,193,252],"good":[8],"mastery":[9],"of":[10,49,58,83,117,152,172,180,225,256,260,270],"optimization,":[11,93,124],"an":[12,289],"essential":[13],"element":[14],"in":[15,51,88,251],"their":[16,243],"toolkit.":[17],"Thus,":[18],"this":[19,261],"articulate":[20],"introductory":[21],"textbook":[22],"will":[23],"certainly":[24],"be":[25],"welcomed":[26],"by":[27],"students":[28],"practicing":[30],"professionals":[31],"alike.":[32],"Drawing":[33],"from":[34,78,209],"his":[35,230,239],"vast":[36],"teaching":[37],"experience,":[38],"the":[39,43,64,79,84,106,170,178,248,257,264,271],"author":[40],"skillfully":[41],"leads":[42],"reader":[44],"through":[45],"rich":[47],"choice":[48],"topics":[50],"coherent,":[53],"fluid":[54],"tasteful":[56],"blend":[57],"models":[59],"methods":[61,131],"anchored":[62],"on":[63,195],"underlying":[65],"mathematical":[66,173],"notions":[67],"(only":[68],"prerequisites:":[69],"first":[70],"year":[71],"calculus":[72],"linear":[74,103],"algebra).":[75],"Topics":[76],"range":[77],"classics":[80],"to":[81,177,219,245,297],"some":[82],"most":[85],"recent":[86],"developments":[87],"smooth":[89],"unconstrained":[90],"constrained":[92],"like":[94,122,182],"descent":[95],"methods,":[96,102],"conjugate":[97],"gradients,":[98],"Newton":[99],"quasi-Newton":[101],"programming":[104,126,285],"simplex":[107],"method,":[108],"trust":[109],"region":[110],"interior":[112],"point":[113],"methods.":[114],"Furthermore":[115],"elements":[116],"discrete":[118],"combinatorial":[120],"optimization":[121,138,174],"network":[123],"integer":[125],"heuristic":[128],"local":[129],"search":[130],"are":[132],"also":[133,155],"presented.":[134],"This":[135],"book":[136,262,291],"presents":[137],"as":[139],"modeling":[141],"tool":[142],"that":[143,168,203,292],"beyond":[144],"supporting":[145],"problem":[146],"formulation":[147],"plus":[148],"design":[149],"implementation":[151],"efficient":[153],"algorithms,":[154,273],"is":[156,263,288],"language":[158],"suited":[159],"for":[160],"interdisciplinary":[161],"human":[162],"interaction.":[163],"Readers":[164],"further":[165],"become":[166,192],"aware":[167],"while":[169],"roots":[171],"go":[175],"back":[176],"work":[179],"giants":[181],"Newton,":[183],"Lagrange,":[184],"Cauchy,":[185],"Euler":[186],"or":[187],"Gauss,":[188],"it":[189,217],"did":[190],"not":[191],"discipline":[194],"its":[196,204,210],"own":[197],"until":[198],"World":[199],"War":[200],"Two.":[201],"Also":[202],"present":[205],"momentum":[206],"really":[207],"resulted":[208],"symbiosis":[211],"with":[212,223],"modern":[213],"computers,":[214],"which":[215,274],"made":[216],"possible":[218],"routinely":[220],"solve":[221],"problems":[222],"millions":[224],"variables":[226],"constraints.":[228],"With":[229],"witty,":[231],"entertaining,":[232],"yet":[233],"precise":[234],"style,":[235],"Michel":[236],"Bierlaire":[237],"captivates":[238],"readers":[240],"awakens":[242],"desire":[244],"try":[246],"out":[247],"presented":[249],"material":[250],"creative":[253],"mode.":[254],"One":[255],"outstanding":[258],"assets":[259],"unified,":[265],"clear":[266],"concise":[268],"rendering":[269],"various":[272],"makes":[275],"them":[276],"easily":[277],"readable":[278],"translatable":[280],"into":[281],"any":[282],"high":[283],"level":[284],"language.":[286],"''This":[287],"addictive":[290],"I":[293],"am":[294],"very":[295],"pleased":[296],"recommend.''":[298],"Prof.":[299],"Thomas":[300],"M.":[301],"Liebling":[302]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}