{"id":"https://openalex.org/W2038806981","doi":"https://doi.org/10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","title":"The cardinality-constrained shortest path problem in 2-graphs","display_name":"The cardinality-constrained shortest path problem in 2-graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2038806981","doi":"https://doi.org/10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","mag":"2038806981"},"language":"en","primary_location":{"id":"doi:10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","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/A5045756477","display_name":"Geir Dahl","orcid":"https://orcid.org/0000-0002-7481-6382"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Geir Dahl","raw_affiliation_strings":["Department of Mathematics and Department of Informatics, University of Oslo, P.O. Box 1080, Blindern, 0316 Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Department of Informatics, University of Oslo, P.O. Box 1080, Blindern, 0316 Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098545562","display_name":"Bj\ufffdrnar Realfsen","orcid":null},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Bj\ufffdrnar Realfsen","raw_affiliation_strings":["Department of Mathematics and Department of Informatics, University of Oslo, P.O. Box 1080, Blindern, 0316 Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Department of Informatics, University of Oslo, P.O. Box 1080, Blindern, 0316 Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045756477"],"corresponding_institution_ids":["https://openalex.org/I184942183"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1714,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.8176427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"1","first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.6937627792358398},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6551932096481323},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.630258321762085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5506076216697693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5493412613868713},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5366505980491638},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.46699726581573486},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4658929109573364},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45660144090652466},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.4514339566230774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41956573724746704},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3823294937610626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.313946008682251},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2561817765235901}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6937627792358398},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6551932096481323},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.630258321762085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5506076216697693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5493412613868713},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5366505980491638},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.46699726581573486},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4658929109573364},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45660144090652466},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4514339566230774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41956573724746704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3823294937610626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.313946008682251},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2561817765235901},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-b","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W23240032","https://openalex.org/W597976610","https://openalex.org/W1837934624","https://openalex.org/W1968143987","https://openalex.org/W1977545325","https://openalex.org/W2002464916","https://openalex.org/W2009906570","https://openalex.org/W2011039300","https://openalex.org/W2042205666","https://openalex.org/W2120322494","https://openalex.org/W2505968561","https://openalex.org/W6604628800"],"related_works":["https://openalex.org/W34983847","https://openalex.org/W4285598206","https://openalex.org/W3186549454","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,14,22,56],"cardinality-constrained":[3],"shortest":[4],"path":[5],"problem":[6,23],"in":[7,11,13,45],"acyclic":[8],"graphs":[9],"and,":[10],"particular,":[12],"class":[15],"of":[16],"2-graphs":[17],"where":[18,55],"we":[19],"show":[20],"that":[21],"may":[24],"be":[25],"solved":[26],"by":[27],"linear":[28],"programming.":[29],"A":[30],"combinatorial":[31],"algorithm":[32],"is":[33,48],"introduced":[34],"based":[35],"on":[36],"some":[37],"adjacency":[38],"results":[39,52],"for":[40],"associated":[41],"polytopes.":[42],"An":[43],"application":[44],"curve":[46],"approximation":[47],"discussed":[49],"and":[50,64],"computational":[51],"are":[53,59],"given":[54],"mentioned":[57],"algorithms":[58],"compared":[60],"to":[61],"Lagrangian":[62],"relaxation":[63],"dynamic":[65],"programming":[66],"algorithms.":[67],"\u00a9":[68],"2000":[69],"John":[70],"Wiley":[71],"&":[72],"Sons,":[73],"Inc.":[74]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"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":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}