default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdriana Felicia Gabor
Person information
- affiliation: Erasmus University Rotterdam, School of Economics, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Moustafa Abdelwanis
, Adriana F. Gabor, Nenad Mladenovic, Andrei Sleptchenko:
Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories. Comput. Oper. Res. 164: 106546 (2024)- [j23]Ahmed Aly, Adriana F. Gabor, Nenad Mladenovic, Andrei Sleptchenko:
An efficient probability-based VNS algorithm for delivery territory design. Comput. Oper. Res. 170: 106756 (2024) - 2023
- [j22]Ragheb Al-Nammari, Mecit Can Emre Simsekler, Adriana Felicia Gabor, Abroon Qazi:
Exploring Drivers of Staff Engagement in Healthcare Organizations Using Tree-Based Machine Learning Algorithms. IEEE Trans. Engineering Management 70(8): 2988-2997 (2023) - 2022
- [j21]Abdo Abouelrous, Adriana F. Gabor, Yingqian Zhang:
Optimizing the inventory and fulfillment of an omnichannel retailer: a stochastic approach with scenario clustering. Comput. Ind. Eng. 173: 108723 (2022) - [j20]Adriana F. Gabor, Jan-Kees C. W. van Ommeren, Andrei Sleptchenko:
An inventory model with discounts for omnichannel retailers of slow moving items. Eur. J. Oper. Res. 300(1): 58-72 (2022) - [c7]Ahmed Aly, Adriana F. Gabor, Nenad Mladenovic:
An Effective VNS for Delivery Districting. ICVNS 2022: 69-81 - 2021
- [j19]Javier Guerrero-Lorente, Adriana F. Gabor, Eva Ponce-Cueto:
Corrigendum to "Omnichannel logistics network design with integrated customer preference for deliveries and returns" [Comput. Ind. Eng. 144 (2020) 106433]. Comput. Ind. Eng. 160: 107569 (2021) - 2020
- [j18]Javier Guerrero-Lorente, Adriana F. Gabor, Eva Ponce-Cueto:
Omnichannel logistics network design with integrated customer preference for deliveries and returns. Comput. Ind. Eng. 144: 106433 (2020) - [j17]Murat Firat, Guillaume Crognier, Adriana F. Gabor, Cor A. J. Hurkens, Yingqian Zhang:
Column generation based heuristic for learning classification trees. Comput. Oper. Res. 116: 104866 (2020)
2010 – 2019
- 2018
- [j16]Adriana F. Gabor, Lars A. van Vianen, Guangyuan Yang, Sven Axsäter:
A base-stock inventory model with service differentiation and response time guarantees. Eur. J. Oper. Res. 269(3): 900-908 (2018) - [i1]Murat Firat, Guillaume Crognier, Adriana F. Gabor, Yingqian Zhang, Cor A. J. Hurkens:
Constructing classification trees using column generation. CoRR abs/1810.06684 (2018) - 2016
- [j15]Lars A. van Vianen, Adriana F. Gabor, Jan-Kees C. W. van Ommeren:
Waiting times in classical priority queues via elementary lattice path counting. Queueing Syst. Theory Appl. 84(3-4): 295-307 (2016) - 2015
- [j14]Wanrong Ju, Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
An approximate policy for a dual-sourcing inventory model with positive lead times and binomial yield. Eur. J. Oper. Res. 244(2): 490-497 (2015) - [j13]Remy Spliet, Adriana F. Gabor:
The Time Window Assignment Vehicle Routing Problem. Transp. Sci. 49(4): 721-731 (2015) - 2014
- [j12]Remy Spliet, Adriana F. Gabor, Rommert Dekker:
The vehicle rescheduling problem. Comput. Oper. Res. 43: 129-136 (2014) - [j11]Jelmer P. van der Gaast, Cornelius A. Rietveld, Adriana F. Gabor, Yingqian Zhang:
A Tabu Search Algorithm for application placement in computer clustering. Comput. Oper. Res. 50: 38-46 (2014) - 2011
- [j10]Victor Boskamp, Alex Knoops, Flavius Frasincar, Adriana Felicia Gabor:
Maximizing revenue with allocation of multiple advertisements on a Web banner. Comput. Oper. Res. 38(10): 1412-1424 (2011) - [j9]Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu:
Erratum to: "An approximation algorithm for the k-level stochastic facility location problem" [Oper. Res. Lett. 38(2010) 386-389]. Oper. Res. Lett. 39(2): 160-161 (2011) - 2010
- [j8]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
A new approximation algorithm for the multilevel facility location problem. Discret. Appl. Math. 158(5): 453-460 (2010) - [j7]Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu:
An approximation algorithm for the k-level stochastic facility location problem. Oper. Res. Lett. 38(5): 386-389 (2010) - [j6]Adriana Felicia Gabor, Gerhard J. Woeginger:
How * not * to solve a Sudoku. Oper. Res. Lett. 38(6): 582-584 (2010) - [c6]Hwee Pink Tan, Adriana Felicia Gabor, Zhi Ang Eu, Winston Khoon Guan Seah:
A Wide Coverage Positioning System (WPS) for Underwater Localization. ICC 2010: 1-5
2000 – 2009
- 2009
- [j5]Hwee Pink Tan, Rudesindo Núñez-Queija, Adriana Felicia Gabor, Onno J. Boxma:
Admission control for differentiated services in future generation CDMA networks. Perform. Evaluation 66(9-10): 488-504 (2009) - 2008
- [c5]Hwee Pink Tan, Adriana Felicia Gabor, Winston Khoon Guan Seah, Pius W. Q. Lee:
Performance Analysis of Data Delivery Schemes for a Multi-Sink Wireless Sensor Network. AINA 2008: 418-425 - 2007
- [c4]Richard J. Boucherie, Aloysius Irwan Endrayanto, Adriana Felicia Gabor:
Optimal Joint Rate and Power Allocation in CDMA Networks. AAIM 2007: 201-210 - 2006
- [j4]Jan-Kees C. W. van Ommeren, Adriana Felicia Bumb, Andrei Sleptchenko:
Locating repair shops in a stochastic environment. Comput. Oper. Res. 33: 1575-1594 (2006) - [j3]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
An approximation algorithm for a facility location problem with stochastic demands and inventories. Oper. Res. Lett. 34(3): 257-263 (2006) - [j2]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
Approximation algorithms for facility location problems with a special class of subadditive cost functions. Theor. Comput. Sci. 363(3): 289-300 (2006) - [c3]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. AAIM 2006: 207-219 - 2005
- [c2]Adriana Felicia Bumb, Jan-Kees C. W. van Ommeren:
An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands. AAIM 2005: 330-339 - 2001
- [j1]Adriana Felicia Bumb:
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem. Oper. Res. Lett. 29(4): 155-161 (2001) - [c1]Adriana Felicia Bumb, Walter Kern:
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. RANDOM-APPROX 2001: 55-62
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
