Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility Location Article Swipe
In this dissertation, we apply large-scale optimization techniques including column generation and heuristic approaches to problems in the domains of online advertising and mobile facility location. First, we study the online advertising portfolio optimization problem (OAPOP) of an advertiser. In the OAPOP, the advertiser has a set of targeting items of interest (in the order of tens of millions for large enterprises) and a daily budget. The objective is to determine how much to bid on each targeting item to maximize the return on investment. We show the OAPOP can be represented by the Multiple Choice Knapsack Problem (MCKP). We propose an efficient column generation (CG) algorithm for the linear programming relaxation of the problem. The computations demonstrate that our CG algorithm significantly outperforms the state-of-the-art linear time algorithm used to solve the MCKP relaxation for the OAPOP. Second, we study the problem faced by the advertiser in online advertising in the presence of bid adjustments. In addition to bids, the advertisers are able to submit bid adjustments for ad query features such as geographical location, time of day, device, and audience. We introduce the Bid Adjustments Problem in Online Advertising (BAPOA) where an advertiser determines base bids and bid adjustments to maximize the return on investment. We develop an efficient algorithm to solve the BAPOA. We perform computational experiments and demonstrate, in the presence of high revenue-per-click variation across features, the revenue benefit of using bid adjustments can exceed 20%. Third, we study the capacitated mobile facility location problem (CMFLP), which is a generalization of the well-known capacitated facility location problem that has applications in supply chain and humanitarian logistics. We provide two integer programming formulations for the CMFLP. The first is on a layered graph, while the second is a set partitioning formulation. We develop a branch-and-price algorithm on the set partitioning formulation. We find that the branch-and-price procedure is particularly effective, when the ratio of the number of clients to the number of facilities is small and the facility capacities are tight. We also develop a local search heuristic and a rounding heuristic for the CMFLP.
Related Topics
- Type
- dissertation
- Language
- en
- Landing Page
- http://hdl.handle.net/1903/20275
- http://hdl.handle.net/1903/20275
- OA Status
- green
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2785140553
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2785140553Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.13016/m2j09w59cDigital Object Identifier
- Title
-
Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility LocationWork title
- Type
-
dissertationOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-01-01Full publication date if available
- Authors
-
Mustafa Ergin ŞahınList of authors in order
- Landing page
-
https://hdl.handle.net/1903/20275Publisher landing page
- PDF URL
-
https://hdl.handle.net/1903/20275Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hdl.handle.net/1903/20275Direct OA link when available
- Concepts
-
Online advertising, Portfolio, Computer science, Advertising, Facility location problem, Business, Operations research, Engineering, World Wide Web, The Internet, FinanceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2785140553 |
|---|---|
| doi | https://doi.org/10.13016/m2j09w59c |
| ids.doi | https://doi.org/10.13016/m2j09w59c |
| ids.mag | 2785140553 |
| ids.openalex | https://openalex.org/W2785140553 |
| fwci | |
| type | dissertation |
| title | Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility Location |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12384 |
| topics[0].field.id | https://openalex.org/fields/14 |
| topics[0].field.display_name | Business, Management and Accounting |
| topics[0].score | 0.9448999762535095 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1406 |
| topics[0].subfield.display_name | Marketing |
| topics[0].display_name | Customer churn and segmentation |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C512338625 |
| concepts[0].level | 3 |
| concepts[0].score | 0.5665373206138611 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q624902 |
| concepts[0].display_name | Online advertising |
| concepts[1].id | https://openalex.org/C2780821815 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5400581359863281 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q5340806 |
| concepts[1].display_name | Portfolio |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.4882807731628418 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C112698675 |
| concepts[3].level | 1 |
| concepts[3].score | 0.478848934173584 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q37038 |
| concepts[3].display_name | Advertising |
| concepts[4].id | https://openalex.org/C108005400 |
| concepts[4].level | 2 |
| concepts[4].score | 0.4131399989128113 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1305598 |
| concepts[4].display_name | Facility location problem |
| concepts[5].id | https://openalex.org/C144133560 |
| concepts[5].level | 0 |
| concepts[5].score | 0.3875884711742401 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q4830453 |
| concepts[5].display_name | Business |
| concepts[6].id | https://openalex.org/C42475967 |
| concepts[6].level | 1 |
| concepts[6].score | 0.3023814260959625 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q194292 |
| concepts[6].display_name | Operations research |
| concepts[7].id | https://openalex.org/C127413603 |
| concepts[7].level | 0 |
| concepts[7].score | 0.20471647381782532 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[7].display_name | Engineering |
| concepts[8].id | https://openalex.org/C136764020 |
| concepts[8].level | 1 |
| concepts[8].score | 0.16420850157737732 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q466 |
| concepts[8].display_name | World Wide Web |
| concepts[9].id | https://openalex.org/C110875604 |
| concepts[9].level | 2 |
| concepts[9].score | 0.12633386254310608 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q75 |
| concepts[9].display_name | The Internet |
| concepts[10].id | https://openalex.org/C10138342 |
| concepts[10].level | 1 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q43015 |
| concepts[10].display_name | Finance |
| keywords[0].id | https://openalex.org/keywords/online-advertising |
| keywords[0].score | 0.5665373206138611 |
| keywords[0].display_name | Online advertising |
| keywords[1].id | https://openalex.org/keywords/portfolio |
| keywords[1].score | 0.5400581359863281 |
| keywords[1].display_name | Portfolio |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.4882807731628418 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/advertising |
| keywords[3].score | 0.478848934173584 |
| keywords[3].display_name | Advertising |
| keywords[4].id | https://openalex.org/keywords/facility-location-problem |
| keywords[4].score | 0.4131399989128113 |
| keywords[4].display_name | Facility location problem |
| keywords[5].id | https://openalex.org/keywords/business |
| keywords[5].score | 0.3875884711742401 |
| keywords[5].display_name | Business |
| keywords[6].id | https://openalex.org/keywords/operations-research |
| keywords[6].score | 0.3023814260959625 |
| keywords[6].display_name | Operations research |
| keywords[7].id | https://openalex.org/keywords/engineering |
| keywords[7].score | 0.20471647381782532 |
| keywords[7].display_name | Engineering |
| keywords[8].id | https://openalex.org/keywords/world-wide-web |
| keywords[8].score | 0.16420850157737732 |
| keywords[8].display_name | World Wide Web |
| keywords[9].id | https://openalex.org/keywords/the-internet |
| keywords[9].score | 0.12633386254310608 |
| keywords[9].display_name | The Internet |
| language | en |
| locations[0].id | pmh:oai:drum.lib.umd.edu:1903/20275 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306401518 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | University Libraries (University of Maryland) |
| locations[0].source.host_organization | https://openalex.org/I66946132 |
| locations[0].source.host_organization_name | University of Maryland, College Park |
| locations[0].source.host_organization_lineage | https://openalex.org/I66946132 |
| locations[0].license | |
| locations[0].pdf_url | http://hdl.handle.net/1903/20275 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | Dissertation |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://hdl.handle.net/1903/20275 |
| locations[1].id | mag:2785140553 |
| locations[1].is_oa | False |
| locations[1].source | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://drum.lib.umd.edu/handle/1903/20275 |
| locations[2].id | doi:10.13016/m2j09w59c |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306402644 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | Digital Repository at the University of Maryland (University of Maryland College Park) |
| locations[2].source.host_organization | https://openalex.org/I66946132 |
| locations[2].source.host_organization_name | University of Maryland, College Park |
| locations[2].source.host_organization_lineage | https://openalex.org/I66946132 |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | |
| locations[2].raw_type | thesis |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | https://doi.org/10.13016/m2j09w59c |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5055406030 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-5121-6173 |
| authorships[0].author.display_name | Mustafa Ergin Şahın |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Mustafa Sahin |
| authorships[0].is_corresponding | True |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://hdl.handle.net/1903/20275 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2018-02-02T00:00:00 |
| display_name | Algorithms for Online Advertising Portfolio Optimization and Capacitated Mobile Facility Location |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T12384 |
| primary_topic.field.id | https://openalex.org/fields/14 |
| primary_topic.field.display_name | Business, Management and Accounting |
| primary_topic.score | 0.9448999762535095 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1406 |
| primary_topic.subfield.display_name | Marketing |
| primary_topic.display_name | Customer churn and segmentation |
| related_works | https://openalex.org/W2394494771, https://openalex.org/W3211630925, https://openalex.org/W2604957448, https://openalex.org/W3172032423, https://openalex.org/W2022992658, https://openalex.org/W3101255731, https://openalex.org/W3120786984, https://openalex.org/W2012210693, https://openalex.org/W1536752494, https://openalex.org/W3144571450, https://openalex.org/W2555663677, https://openalex.org/W1544418557, https://openalex.org/W2139076300, https://openalex.org/W3162923093, https://openalex.org/W2907928238, https://openalex.org/W2163268944, https://openalex.org/W3172008428, https://openalex.org/W3080791653, https://openalex.org/W2074278669, https://openalex.org/W1978504723 |
| cited_by_count | 0 |
| locations_count | 3 |
| best_oa_location.id | pmh:oai:drum.lib.umd.edu:1903/20275 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306401518 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | University Libraries (University of Maryland) |
| best_oa_location.source.host_organization | https://openalex.org/I66946132 |
| best_oa_location.source.host_organization_name | University of Maryland, College Park |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I66946132 |
| best_oa_location.license | |
| best_oa_location.pdf_url | http://hdl.handle.net/1903/20275 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Dissertation |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://hdl.handle.net/1903/20275 |
| primary_location.id | pmh:oai:drum.lib.umd.edu:1903/20275 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306401518 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | University Libraries (University of Maryland) |
| primary_location.source.host_organization | https://openalex.org/I66946132 |
| primary_location.source.host_organization_name | University of Maryland, College Park |
| primary_location.source.host_organization_lineage | https://openalex.org/I66946132 |
| primary_location.license | |
| primary_location.pdf_url | http://hdl.handle.net/1903/20275 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | Dissertation |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://hdl.handle.net/1903/20275 |
| publication_date | 2017-01-01 |
| publication_year | 2017 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 45, 63, 253, 284, 291, 297, 338, 343 |
| abstract_inverted_index.CG | 120 |
| abstract_inverted_index.In | 0, 39, 156 |
| abstract_inverted_index.We | 85, 99, 182, 207, 216, 271, 295, 305, 335 |
| abstract_inverted_index.ad | 169 |
| abstract_inverted_index.an | 37, 101, 193, 209 |
| abstract_inverted_index.as | 173 |
| abstract_inverted_index.be | 90 |
| abstract_inverted_index.by | 92, 144 |
| abstract_inverted_index.in | 16, 147, 150, 188, 222, 265 |
| abstract_inverted_index.is | 68, 252, 282, 290, 311, 327 |
| abstract_inverted_index.of | 19, 36, 47, 50, 55, 57, 112, 153, 177, 225, 234, 255, 317, 320, 325 |
| abstract_inverted_index.on | 75, 83, 205, 283, 300 |
| abstract_inverted_index.to | 14, 69, 73, 79, 130, 158, 164, 201, 212, 322 |
| abstract_inverted_index.we | 3, 27, 139, 242 |
| abstract_inverted_index.(in | 52 |
| abstract_inverted_index.Bid | 185 |
| abstract_inverted_index.The | 66, 115, 280 |
| abstract_inverted_index.and | 11, 22, 62, 180, 198, 220, 268, 329, 342 |
| abstract_inverted_index.are | 162, 333 |
| abstract_inverted_index.bid | 74, 154, 166, 199, 236 |
| abstract_inverted_index.can | 89, 238 |
| abstract_inverted_index.for | 59, 107, 135, 168, 277, 346 |
| abstract_inverted_index.has | 44, 263 |
| abstract_inverted_index.how | 71 |
| abstract_inverted_index.our | 119 |
| abstract_inverted_index.set | 46, 292, 302 |
| abstract_inverted_index.the | 17, 29, 40, 42, 53, 81, 87, 93, 108, 113, 124, 132, 136, 141, 145, 151, 160, 184, 203, 214, 223, 231, 244, 256, 278, 288, 301, 308, 315, 318, 323, 330, 347 |
| abstract_inverted_index.two | 273 |
| abstract_inverted_index.(CG) | 105 |
| abstract_inverted_index.20%. | 240 |
| abstract_inverted_index.MCKP | 133 |
| abstract_inverted_index.able | 163 |
| abstract_inverted_index.also | 336 |
| abstract_inverted_index.base | 196 |
| abstract_inverted_index.bids | 197 |
| abstract_inverted_index.day, | 178 |
| abstract_inverted_index.each | 76 |
| abstract_inverted_index.find | 306 |
| abstract_inverted_index.high | 226 |
| abstract_inverted_index.item | 78 |
| abstract_inverted_index.much | 72 |
| abstract_inverted_index.show | 86 |
| abstract_inverted_index.such | 172 |
| abstract_inverted_index.tens | 56 |
| abstract_inverted_index.that | 118, 262, 307 |
| abstract_inverted_index.this | 1 |
| abstract_inverted_index.time | 127, 176 |
| abstract_inverted_index.used | 129 |
| abstract_inverted_index.when | 314 |
| abstract_inverted_index.OAPOP | 88 |
| abstract_inverted_index.apply | 4 |
| abstract_inverted_index.bids, | 159 |
| abstract_inverted_index.chain | 267 |
| abstract_inverted_index.daily | 64 |
| abstract_inverted_index.faced | 143 |
| abstract_inverted_index.first | 281 |
| abstract_inverted_index.items | 49 |
| abstract_inverted_index.large | 60 |
| abstract_inverted_index.local | 339 |
| abstract_inverted_index.order | 54 |
| abstract_inverted_index.query | 170 |
| abstract_inverted_index.ratio | 316 |
| abstract_inverted_index.small | 328 |
| abstract_inverted_index.solve | 131, 213 |
| abstract_inverted_index.study | 28, 140, 243 |
| abstract_inverted_index.using | 235 |
| abstract_inverted_index.where | 192 |
| abstract_inverted_index.which | 251 |
| abstract_inverted_index.while | 287 |
| abstract_inverted_index.BAPOA. | 215 |
| abstract_inverted_index.CMFLP. | 279, 348 |
| abstract_inverted_index.Choice | 95 |
| abstract_inverted_index.First, | 26 |
| abstract_inverted_index.OAPOP, | 41 |
| abstract_inverted_index.OAPOP. | 137 |
| abstract_inverted_index.Online | 189 |
| abstract_inverted_index.Third, | 241 |
| abstract_inverted_index.across | 229 |
| abstract_inverted_index.column | 9, 103 |
| abstract_inverted_index.exceed | 239 |
| abstract_inverted_index.graph, | 286 |
| abstract_inverted_index.linear | 109, 126 |
| abstract_inverted_index.mobile | 23, 246 |
| abstract_inverted_index.number | 319, 324 |
| abstract_inverted_index.online | 20, 30, 148 |
| abstract_inverted_index.return | 82, 204 |
| abstract_inverted_index.search | 340 |
| abstract_inverted_index.second | 289 |
| abstract_inverted_index.submit | 165 |
| abstract_inverted_index.supply | 266 |
| abstract_inverted_index.tight. | 334 |
| abstract_inverted_index.(BAPOA) | 191 |
| abstract_inverted_index.(MCKP). | 98 |
| abstract_inverted_index.(OAPOP) | 35 |
| abstract_inverted_index.Problem | 97, 187 |
| abstract_inverted_index.Second, | 138 |
| abstract_inverted_index.benefit | 233 |
| abstract_inverted_index.budget. | 65 |
| abstract_inverted_index.clients | 321 |
| abstract_inverted_index.develop | 208, 296, 337 |
| abstract_inverted_index.device, | 179 |
| abstract_inverted_index.domains | 18 |
| abstract_inverted_index.integer | 274 |
| abstract_inverted_index.layered | 285 |
| abstract_inverted_index.perform | 217 |
| abstract_inverted_index.problem | 34, 142, 249, 261 |
| abstract_inverted_index.propose | 100 |
| abstract_inverted_index.provide | 272 |
| abstract_inverted_index.revenue | 232 |
| abstract_inverted_index.(CMFLP), | 250 |
| abstract_inverted_index.Knapsack | 96 |
| abstract_inverted_index.Multiple | 94 |
| abstract_inverted_index.addition | 157 |
| abstract_inverted_index.facility | 24, 247, 259, 331 |
| abstract_inverted_index.features | 171 |
| abstract_inverted_index.interest | 51 |
| abstract_inverted_index.location | 248, 260 |
| abstract_inverted_index.maximize | 80, 202 |
| abstract_inverted_index.millions | 58 |
| abstract_inverted_index.presence | 152, 224 |
| abstract_inverted_index.problem. | 114 |
| abstract_inverted_index.problems | 15 |
| abstract_inverted_index.rounding | 344 |
| abstract_inverted_index.algorithm | 106, 121, 128, 211, 299 |
| abstract_inverted_index.audience. | 181 |
| abstract_inverted_index.determine | 70 |
| abstract_inverted_index.efficient | 102, 210 |
| abstract_inverted_index.features, | 230 |
| abstract_inverted_index.heuristic | 12, 341, 345 |
| abstract_inverted_index.including | 8 |
| abstract_inverted_index.introduce | 183 |
| abstract_inverted_index.location, | 175 |
| abstract_inverted_index.location. | 25 |
| abstract_inverted_index.objective | 67 |
| abstract_inverted_index.portfolio | 32 |
| abstract_inverted_index.procedure | 310 |
| abstract_inverted_index.targeting | 48, 77 |
| abstract_inverted_index.variation | 228 |
| abstract_inverted_index.advertiser | 43, 146, 194 |
| abstract_inverted_index.approaches | 13 |
| abstract_inverted_index.capacities | 332 |
| abstract_inverted_index.determines | 195 |
| abstract_inverted_index.effective, | 313 |
| abstract_inverted_index.facilities | 326 |
| abstract_inverted_index.generation | 10, 104 |
| abstract_inverted_index.logistics. | 270 |
| abstract_inverted_index.relaxation | 111, 134 |
| abstract_inverted_index.techniques | 7 |
| abstract_inverted_index.well-known | 257 |
| abstract_inverted_index.Adjustments | 186 |
| abstract_inverted_index.Advertising | 190 |
| abstract_inverted_index.adjustments | 167, 200, 237 |
| abstract_inverted_index.advertiser. | 38 |
| abstract_inverted_index.advertisers | 161 |
| abstract_inverted_index.advertising | 21, 31, 149 |
| abstract_inverted_index.capacitated | 245, 258 |
| abstract_inverted_index.demonstrate | 117 |
| abstract_inverted_index.experiments | 219 |
| abstract_inverted_index.investment. | 84, 206 |
| abstract_inverted_index.large-scale | 5 |
| abstract_inverted_index.outperforms | 123 |
| abstract_inverted_index.programming | 110, 275 |
| abstract_inverted_index.represented | 91 |
| abstract_inverted_index.adjustments. | 155 |
| abstract_inverted_index.applications | 264 |
| abstract_inverted_index.computations | 116 |
| abstract_inverted_index.demonstrate, | 221 |
| abstract_inverted_index.enterprises) | 61 |
| abstract_inverted_index.formulation. | 294, 304 |
| abstract_inverted_index.formulations | 276 |
| abstract_inverted_index.geographical | 174 |
| abstract_inverted_index.humanitarian | 269 |
| abstract_inverted_index.optimization | 6, 33 |
| abstract_inverted_index.particularly | 312 |
| abstract_inverted_index.partitioning | 293, 303 |
| abstract_inverted_index.computational | 218 |
| abstract_inverted_index.dissertation, | 2 |
| abstract_inverted_index.significantly | 122 |
| abstract_inverted_index.generalization | 254 |
| abstract_inverted_index.branch-and-price | 298, 309 |
| abstract_inverted_index.state-of-the-art | 125 |
| abstract_inverted_index.revenue-per-click | 227 |
| cited_by_percentile_year | |
| corresponding_author_ids | https://openalex.org/A5055406030 |
| countries_distinct_count | 0 |
| institutions_distinct_count | 1 |
| citation_normalized_percentile |