X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Institute for Operations Research and the Management Sciences (INFORMS)  (36)
  • 1
    Online Resource
    Online Resource
    Bending the Pipeline? Executive Search and Gender Inequality in Hiring for Top Management Jobs
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2016
    In:  Management Science Vol. 62, No. 12 ( 2016-12), p. 3636-3655
    Details
    In: Management Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 62, No. 12 ( 2016-12), p. 3636-3655
    Abstract: We study the sources of women’s underrepresentation in hiring for top management jobs by focusing on the context of executive search. Using data that include proprietary information on 10,970 individuals considered by a search firm, we examine the sources of the low proportion of women placed in senior roles. Contrary to received wisdom, we find limited evidence that demand-side screeners strongly contribute to gender disadvantage in this setting. What gender differences exist tend to play out at the start of the hiring process and are driven both by supply-side and demand-side actors. Once considered for a position, women are no less likely than men to be hired—though they are slightly less likely to be interviewed by the search firm. Our findings highlight the theoretical importance of disentangling candidates’ “self-steering” behavior from the “pipeline bending” of hiring agents. We discuss the implications of our results for understanding gender inequality at upper echelons of the labor market. This paper was accepted by Olav Sorenson, organizations.
    Type of Medium: Online Resource
    ISSN: 0025-1909 , 1526-5501
    URL: Article
    DOI: 10.1287/mnsc.2015.2315
    RVK:
    QP 300
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2016
    detail.hit.zdb_id: 206345-1
    detail.hit.zdb_id: 2023019-9
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 2
    Online Resource
    Online Resource
    Evolution of Referrals over Customers’ Life Cycle: Evidence from a Ride-Sharing Platform
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2023
    In:  Information Systems Research Vol. 34, No. 2 ( 2023-06), p. 698-720
    Details
    In: Information Systems Research, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 34, No. 2 ( 2023-06), p. 698-720
    Abstract: Online platforms often ask their users to refer friends in exchange for a reward. This paper addresses how referral generation and referral value evolve throughout the customer’s life cycle as a function of service usage, experience level, and past referral behavior. Our analysis is based on a longitudinal data set that comprises the transactions and referral actions of 400,000 users in a ride-sharing platform over a year. The richness of our data set allows us to address two shortcomings from previous studies: modeling dynamic behavior (i.e., the relationship between past and future referrals) and accounting for unobserved heterogeneity across users. Our results show that users make more referrals when they have used the service recently and intensively. For example, users become 9% less likely to make referrals for each week they have not used the service. Furthermore, users make more high-value referrals as they become more experienced with the service. The referral generation and referral value of the top 10% most experienced users are more than 18% higher relative to when they first used the service. Finally, as users make more referrals, they become more likely to run out of friends to whom they can refer the service, leading to less referrals in the future. After users make their first referral, the probability of making additional referrals decreases by more than 78% and the value of subsequent referrals reduces by 19% on average. The results imply that platforms should consider tailoring their referral programs according to how referral generation and referral value evolve over time. History: Xiaoquan (Michael) Zhang, Senior Editor; Khim Yong Goh, Associate Editor.
    Type of Medium: Online Resource
    ISSN: 1047-7047 , 1526-5536
    URL: Article
    DOI: 10.1287/isre.2022.1138
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2023
    detail.hit.zdb_id: 2027203-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 3
    Online Resource
    Online Resource
    A Comparison of Methods for Treatment Assignment with an Application to Playlist Generation
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2023
    In:  Information Systems Research Vol. 34, No. 2 ( 2023-06), p. 786-803
    Details
    In: Information Systems Research, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 34, No. 2 ( 2023-06), p. 786-803
    Abstract: This study presents a systematic comparison of methods for individual treatment assignment, a general problem that arises in many applications and that has received significant attention from economists, computer scientists, and social scientists. We group the various methods proposed in the literature into three general classes of algorithms (or metalearners): learning models to predict outcomes (the O-learner), learning models to predict causal effects (the E-learner), and learning models to predict optimal treatment assignments (the A-learner). We compare the metalearners in terms of (1) their level of generality and (2) the objective function they use to learn models from data; we then discuss the implications that these characteristics have for modeling and decision making. Notably, we demonstrate analytically and empirically that optimizing for the prediction of outcomes or causal effects is not the same as optimizing for treatment assignments, suggesting that, in general, the A-learner should lead to better treatment assignments than the other metalearners. We demonstrate the practical implications of our findings in the context of choosing, for each user, the best algorithm for playlist generation in order to optimize engagement. This is the first comparison of the three different metalearners on a real-world application at scale (based on more than half a billion individual treatment assignments). In addition to supporting our analytical findings, the results show how large A/B tests can provide substantial value for learning treatment-assignment policies, rather than simply for choosing the variant that performs best on average. History: Olivia Liu Sheng, Senior Editor; Gautam Pant, Associate Editor. Supplemental Material: The online appendix is available at https://doi.org/10.1287/isre.2022.1149 .
    Type of Medium: Online Resource
    ISSN: 1047-7047 , 1526-5536
    URL: Article
    DOI: 10.1287/isre.2022.1149
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2023
    detail.hit.zdb_id: 2027203-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 4
    Online Resource
    Online Resource
    Hub Location with Protection Under Interhub Link Failures
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2023
    In:  INFORMS Journal on Computing Vol. 35, No. 5 ( 2023-09), p. 966-985
    Details
    In: INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 35, No. 5 ( 2023-09), p. 966-985
    Abstract: This paper introduces the hub location problem under interhub link failures, a hub location problem in which activated interhub links may fail with a given probability. Two different optimization models are studied, which construct hub backbone networks protected under interhub link disruptions by imposing that, for each commodity, an additional routing path exists besides its original routing path. Both models consider the minimization of the fixed costs of the activated hubs and interhub links plus the expected value of the routing costs of the original and alternative paths. The first model builds explicitly the alternative routing paths, whereas the second model guarantees that, for each commodity, at least one alternative path exists using a large set of connectivity constraints although the alternative paths are not built explicitly. The results of extensive computational testing allow us to analyze the performance of the two proposed models and to evaluate the extra cost required to design a robust backbone network under interhub link failures. The obtained results support the validity of the proposal. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Application. Funding: The authors of this research acknowledge financial support by the Spanish Ministerio de Ciencia y Tecnología, Agencia Estatal de Investigación and Fondos Europeos de Desarrollo Regional (FEDER) via projects PID2020-114594GB-C21 and MTM2019-105824GB-I00. The authors also acknowledge partial support from projects FEDER-US-1256951, Junta de Andalucía P18-FR-422, P18-FR-2369, B-FQM-322-UGR20 (COXMOS), and NetmeetData: Ayudas Fundación BBVA a equipos de investigación científica 2019. The first author was partially supported by the IMAG-Maria de Maeztu grant [CEX2020-001105-M/AEI/10.13039/501100011033] and UE-NextGenerationEU (ayudas de movilidad para la recualificación del profesorado universitario). Supplemental Material: The online supplement is available at https://doi.org/10.1287/ijoc.2023.1296 .
    Type of Medium: Online Resource
    ISSN: 1091-9856 , 1526-5528
    URL: Article
    DOI: 10.1287/ijoc.2023.1296
    RVK:
    QA 10000
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2023
    detail.hit.zdb_id: 2070411-2
    detail.hit.zdb_id: 2004082-9
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 5
    Online Resource
    Online Resource
    Operators-Users Equilibrium Model in a Partially Regulated Transit System
    Institute for Operations Research and the Management Sciences (INFORMS) ; 1992
    In:  Transportation Science Vol. 26, No. 2 ( 1992-05), p. 93-105
    Details
    In: Transportation Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 26, No. 2 ( 1992-05), p. 93-105
    Abstract: We present two formulations of a model for finding equilibrium passenger and operator flows in a partially regulated transit system where bus operators are free to choose the routes on which they offer public transport services. The transit fares are assumed fixed and known. The model offers a detailed representation of the transit system network and of the transit users behavior. Congestion effects are also considered as a consequence of the operation of cars and buses over a common road network. Two algorithmic solution approaches are investigated.
    Type of Medium: Online Resource
    ISSN: 0041-1655 , 1526-5447
    URL: Article
    DOI: 10.1287/trsc.26.2.93
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 1992
    detail.hit.zdb_id: 2015901-8
    detail.hit.zdb_id: 160958-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 6
    Online Resource
    Online Resource
    Exact Solution of Several Families of Location-Arc Routing Problems
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2019
    In:  Transportation Science Vol. 53, No. 5 ( 2019-09), p. 1313-1333
    Details
    In: Transportation Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 53, No. 5 ( 2019-09), p. 1313-1333
    Abstract: We model and solve several families of location-arc routing problems on an undirected graph. These problems extend the multidepot rural postman problem to the case where the depots are not fixed. The aim is to select the facility locations and to construct a set of routes traversing each required edge of the graph, where each route starts and ends at the same facility. The models differ from each other in their objective functions and on whether they include a capacity constraint. Alternative formulations are presented that use only binary variables, and are valid even when the input graph is not complete. This applies, in particular, to a compact two-index formulation for problems minimizing the overall routing costs, with or without facility setup costs. This formulation incorporates a new set of constraints that force the routes to be consistent and return to their original depots. A polyhedral study is presented for some of the formulations, which indicates that the main families of constraints are facet defining. All formulations are solved by branch and cut, and instances with up to 200 vertices are solved to optimality. Despite the difficulty of the problems, the numerical results demonstrate the good performance of the algorithm.
    Type of Medium: Online Resource
    ISSN: 0041-1655 , 1526-5447
    URL: Article
    DOI: 10.1287/trsc.2018.0881
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2019
    detail.hit.zdb_id: 2015901-8
    detail.hit.zdb_id: 160958-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 7
    Online Resource
    Online Resource
    Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2022
    In:  Transportation Science Vol. 56, No. 5 ( 2022-09), p. 1219-1237
    Details
    In: Transportation Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 56, No. 5 ( 2022-09), p. 1219-1237
    Abstract: Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicles. Several recently published articles study the use of electric vehicles (EVs) in node-routing problems. In contrast, this article considers EVs in the context of arc routing while also addressing practically relevant aspects that have not been addressed sufficiently so far. These include dynamic charging of EVs while driving, speed-dependent energy consumption, and nonlinear charging functions that depend on the battery’s state of charge and the charging time. A generic way of dealing with these aspects is introduced through the concept of an energy-indexed graph, which is used to derive an integer linear programming formulation and a solution framework based on branch and cut. Efficient construction heuristics and a local search for approximately solving large-scale instances are proposed. A computational study is performed on realistic problem instances. Besides analyzing the performance of all proposed methods, the obtained results also provide insights into strategic decisions related to the battery size and the amount of charging facilities.
    Type of Medium: Online Resource
    ISSN: 0041-1655 , 1526-5447
    URL: Article
    DOI: 10.1287/trsc.2022.1126
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2022
    detail.hit.zdb_id: 2015901-8
    detail.hit.zdb_id: 160958-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 8
    Online Resource
    Online Resource
    Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2009
    In:  Operations Research Vol. 57, No. 1 ( 2009-02), p. 32-46
    Details
    In: Operations Research, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 57, No. 1 ( 2009-02), p. 32-46
    Abstract: We propose a stochastic unit commitment model for a power generation company that takes part in an electricity spot market. The relevant feature of this model is its detailed representation of the spot market during a whole week, including seven day-ahead market sessions and the corresponding adjustment market sessions. The adjustment market sessions can be seen as an hour-ahead market mechanism. This representation takes into account the influence that the company's decisions exert on the market-clearing price by means of a residual demand curve for each market session. We introduce uncertainty in the form of several possible spot market outcomes for each day, which leads to a weekly scenario tree. The model also represents in detail the operation of the company's generation units. The model leads to large-scale mixed linear-integer problems that are hard to solve with commercial optimizers. This suggests the use of alternative solution methods. We test four solution approaches with a realistic numerical example in the context of the Spanish electricity spot market. The first is a direct solution with a commercial optimizer, which illustrates the mentioned limitations. The second is a standard Lagrangean relaxation algorithm. The third and fourth methods are two original variants of Benders decomposition for multistage stochastic integer programs. The first Benders decomposition algorithm builds approximations for the recourse function relaxing the integrality constraints of the subproblems. The second variant strengthens these cuts by performing one iteration of the Lagrangean of each subproblem. We analyze the advantages of these four methods and compare the results.
    Type of Medium: Online Resource
    ISSN: 0030-364X , 1526-5463
    URL: Article
    DOI: 10.1287/opre.1080.0593
    RVK:
    SA 7410
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2009
    detail.hit.zdb_id: 2019440-7
    detail.hit.zdb_id: 123389-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 9
    Online Resource
    Online Resource
    Relationship Duration and Returns to Brokerage in the Staffing Sector
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2010
    In:  Organization Science Vol. 21, No. 6 ( 2010-12), p. 1141-1158
    Details
    In: Organization Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 21, No. 6 ( 2010-12), p. 1141-1158
    Abstract: We examine how long-term relationships affect brokers' returns, using project-level pricing data from an information technology staffing firm. We argue that long-term relationships between brokers and their counterparties affect both acquisition of private information and bargaining power, helping brokers to create and capture economic value. The results show that the staffing firm is able to charge a higher price and capture a higher proportion of that price when it has a long-term relationship with the worker. We also show that the staffing firm's ability to generate returns from its relationships is constrained when the brokered parties (worker and client firm) have a long-term relationship with each other. We discuss the implications of these findings for the study of market brokerage and long-term exchange relationships.
    Type of Medium: Online Resource
    ISSN: 1047-7039 , 1526-5455
    URL: Article
    DOI: 10.1287/orsc.1090.0509
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2010
    detail.hit.zdb_id: 2024496-4
    detail.hit.zdb_id: 1022236-4
    SSG: 3,2
    SSG: 3,4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
  • 10
    Online Resource
    Online Resource
    The Windy Clustered Prize-Collecting Arc-Routing Problem
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2011
    In:  Transportation Science Vol. 45, No. 3 ( 2011-08), p. 317-334
    Details
    In: Transportation Science, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 45, No. 3 ( 2011-08), p. 317-334
    Abstract: This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed.
    Type of Medium: Online Resource
    ISSN: 0041-1655 , 1526-5447
    URL: Article
    DOI: 10.1287/trsc.1110.0370
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2011
    detail.hit.zdb_id: 2015901-8
    detail.hit.zdb_id: 160958-0
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Availability (electronic / print)
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages