{"id":"https://openalex.org/W4307038736","doi":"https://doi.org/10.1007/s11590-022-01945-y","title":"Efficient compact linear programs for network revenue management","display_name":"Efficient compact linear programs for network revenue management","publication_year":2022,"publication_date":"2022-10-22","ids":{"openalex":"https://openalex.org/W4307038736","doi":"https://doi.org/10.1007/s11590-022-01945-y"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-022-01945-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-022-01945-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-022-01945-y.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11590-022-01945-y.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014776741","display_name":"Simon Laumer","orcid":"https://orcid.org/0000-0002-8859-459X"},"institutions":[{"id":"https://openalex.org/I197141962","display_name":"Zurich University of Applied Sciences in Business Administration","ror":"https://ror.org/02ejkey04","country_code":"CH","type":"education","lineage":["https://openalex.org/I197141962"]},{"id":"https://openalex.org/I202697423","display_name":"University of Zurich","ror":"https://ror.org/02crff812","country_code":"CH","type":"education","lineage":["https://openalex.org/I202697423"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Simon Laumer","raw_affiliation_strings":["Department of Business Administration, University of Zurich, Plattenstrasse 14, 8032, Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-8859-459X","affiliations":[{"raw_affiliation_string":"Department of Business Administration, University of Zurich, Plattenstrasse 14, 8032, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I197141962","https://openalex.org/I202697423"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014776741"],"corresponding_institution_ids":["https://openalex.org/I197141962","https://openalex.org/I202697423"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16880157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"2","first_page":"437","last_page":"451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7201830148696899},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.6389116048812866},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5327607989311218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5301842093467712},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.49393588304519653},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.48648542165756226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4703528881072998},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43039563298225403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4302799105644226},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16760098934173584}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7201830148696899},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.6389116048812866},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5327607989311218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5301842093467712},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.49393588304519653},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.48648542165756226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4703528881072998},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43039563298225403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4302799105644226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16760098934173584},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s11590-022-01945-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-022-01945-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-022-01945-y.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:www.zora.uzh.ch:221783","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401281","display_name":"Zurich Open Repository and Archive (University of Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I202697423","host_organization_name":"University of Zurich","host_organization_lineage":["https://openalex.org/I202697423"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Laumer, Simon  (2023). Efficient compact linear programs for network revenue management.  Optimization Letters, 17(2):437-451.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.5167/uzh-221783","is_oa":true,"landing_page_url":"https://doi.org/10.5167/uzh-221783","pdf_url":null,"source":{"id":"https://openalex.org/S7407051291","display_name":"Universit\u00e4t Z\u00fcrich, ZORA","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s11590-022-01945-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-022-01945-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-022-01945-y.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323874","display_name":"Universit\u00e4t Z\u00fcrich","ror":"https://ror.org/02crff812"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4307038736.pdf","grobid_xml":"https://content.openalex.org/works/W4307038736.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W74203006","https://openalex.org/W1501613489","https://openalex.org/W1888323485","https://openalex.org/W2020941123","https://openalex.org/W2021630689","https://openalex.org/W2033476359","https://openalex.org/W2040766536","https://openalex.org/W2124897406","https://openalex.org/W2144425834","https://openalex.org/W2154706439","https://openalex.org/W2158479468","https://openalex.org/W2165356874","https://openalex.org/W2191871932","https://openalex.org/W2285741262","https://openalex.org/W2911357856","https://openalex.org/W2960341280"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W3182682721","https://openalex.org/W4386394964","https://openalex.org/W2080462934","https://openalex.org/W2182614003","https://openalex.org/W2007464938","https://openalex.org/W2784100870","https://openalex.org/W2354774539","https://openalex.org/W1972615387","https://openalex.org/W2064873618"],"abstract_inverted_index":{"Abstract":[0],"We":[1,90,146],"are":[2,28,79,130],"concerned":[3],"with":[4],"computing":[5,98],"bid":[6,25,47,54,108],"prices":[7,26,55],"in":[8,173],"network":[9],"revenue":[10],"management":[11],"using":[12,59,87],"approximate":[13,135],"linear":[14,39,62,69,93,128,136,183],"programming.":[15],"It":[16],"is":[17,112],"well-known":[18],"that":[19],"affine":[20,88],"value":[21,63],"function":[22,64],"approximations":[23],"yield":[24],"which":[27],"not":[29],"sensitive":[30],"to":[31,37,86],"remaining":[32,118],"capacity.":[33],"The":[34],"analytic":[35],"reduction":[36],"compact":[38,68,92],"programs":[40,70,94,129],"allows":[41],"the":[42,50,104,133,148,154,157,165,178],"efficient":[43],"computation":[44],"of":[45,106,132,150,160,180],"such":[46],"prices.":[48,109],"On":[49],"other":[51],"hand,":[52],"capacity-dependent":[53],"can":[56],"be":[57],"obtained":[58],"separable":[60],"piecewise":[61],"approximations.":[65],"Even":[66],"though":[67],"have":[71],"been":[72],"derived":[73],"for":[74],"this":[75,171],"case":[76],"also,":[77],"they":[78],"still":[80],"computationally":[81],"much":[82],"more":[83],"expensive":[84],"compared":[85],"functions.":[89],"propose":[91],"requiring":[95],"substantially":[96],"smaller":[97],"times":[99],"while,":[100],"simultaneously,":[101],"significantly":[102],"improving":[103],"performance":[105,159],"capacity-independent":[107],"This":[110],"simplification":[111],"achieved":[113],"by":[114,153],"taking":[115],"into":[116],"account":[117],"capacity":[119],"only":[120],"if":[121],"it":[122],"becomes":[123],"scarce.":[124],"Although":[125],"our":[126,181],"proposed":[127,182],"relaxations":[131],"unreduced":[134],"programs,":[137],"we":[138,176],"conjecture":[139],"equivalence":[140],"and":[141,164],"provide":[142],"according":[143],"numerical":[144,174],"support.":[145],"measure":[147],"quality":[149],"an":[151,161],"approximation":[152],"difference":[155],"between":[156],"expected":[158],"induced":[162],"policy":[163],"corresponding":[166],"theoretical":[167],"upper":[168],"bound.":[169],"Using":[170],"paradigm":[172],"experiments,":[175],"demonstrate":[177],"competitiveness":[179],"programs.":[184]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}