{"id":"https://openalex.org/W2886549927","doi":"https://doi.org/10.1007/978-3-319-97571-9_28","title":"The Algorithm for Constrained Shortest Path Problem Based on Incremental Lagrangian Dual Solution","display_name":"The Algorithm for Constrained Shortest Path Problem Based on Incremental Lagrangian Dual Solution","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2886549927","doi":"https://doi.org/10.1007/978-3-319-97571-9_28","mag":"2886549927"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-97571-9_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-97571-9_28","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5011127779","display_name":"Boris Novikov","orcid":"https://orcid.org/0000-0003-4657-0757"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Boris Novikov","raw_affiliation_strings":["Saint Petersburg State University, Universitetskaya emb. 7/9, 199034, Saint-Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0003-4657-0757","affiliations":[{"raw_affiliation_string":"Saint Petersburg State University, Universitetskaya emb. 7/9, 199034, Saint-Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067798868","display_name":"Roman Guralnik","orcid":"https://orcid.org/0000-0003-1250-7178"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Roman Guralnik","raw_affiliation_strings":["Saint Petersburg State University, Universitetskaya emb. 7/9, 199034, Saint-Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0003-1250-7178","affiliations":[{"raw_affiliation_string":"Saint Petersburg State University, Universitetskaya emb. 7/9, 199034, Saint-Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13263065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"360","last_page":"375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8169863224029541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5914345383644104},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5728697776794434},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5639183521270752},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.56265789270401},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5132250785827637},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.506046712398529},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5001542568206787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4656347334384918},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4354058504104614},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.433938592672348},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28763240575790405},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.28762710094451904},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23940283060073853}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8169863224029541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5914345383644104},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5728697776794434},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5639183521270752},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.56265789270401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5132250785827637},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.506046712398529},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5001542568206787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4656347334384918},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4354058504104614},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.433938592672348},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28763240575790405},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.28762710094451904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23940283060073853},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-97571-9_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-97571-9_28","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1491580860","https://openalex.org/W1568032077","https://openalex.org/W1573144638","https://openalex.org/W1601919219","https://openalex.org/W1829285201","https://openalex.org/W1969675191","https://openalex.org/W1990043277","https://openalex.org/W2003066927","https://openalex.org/W2010619023","https://openalex.org/W2029706450","https://openalex.org/W2036900823","https://openalex.org/W2048815087","https://openalex.org/W2058978916","https://openalex.org/W2067773876","https://openalex.org/W2098074159","https://openalex.org/W2106841911","https://openalex.org/W2115760878","https://openalex.org/W2115847261","https://openalex.org/W2121180493","https://openalex.org/W2130679277","https://openalex.org/W2139727043","https://openalex.org/W2769869969","https://openalex.org/W4236261413","https://openalex.org/W4246153096","https://openalex.org/W4247951747"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W4293054712","https://openalex.org/W2597144308","https://openalex.org/W1617152041","https://openalex.org/W2347245430","https://openalex.org/W2354846196","https://openalex.org/W2368964068","https://openalex.org/W2391130892","https://openalex.org/W2100214387","https://openalex.org/W4200172719"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}