Always valid inference: Continuous monitoring of A/B tests |
Ee:000 |
OR/MS / 64 / 3-4 / 259 |
Setting reserve prices in second-price auctions with unobserved bids |
Ef:000 |
OR/MS / 64 / 3-4 / 263 |
Dynamic double auctions: Toward first best |
Ef:000 |
OR/MS / 64 / 3-4 / 267 |
Experimental design in two-sided platforms: An analysis of bias |
Ez:000 |
OR/MS / 64 / 3-4 / 279 |
Optimization: From its inception |
Cd:000 |
OR/MS / 63 / 5-6 / 377 |
Prior beliefs and ambiguity attitudes in decision from experience |
Ea:000 |
OR/MS / 63 / 5-6 / 395 |
Three faces of technology’s value creation: Emerging, enabling, embedding |
Az:000 |
OR/MS / 63 / 3-4 / 203 |
Minimizing the maximum expected waiting time in a periodic single-server queue with a service-rate control |
Dd:000 |
OR/MS / 62 / 5-6 / 391 |
Rare-event simulation for distribution networks |
De:000 |
OR/MS / 62 / 3-4 / 211 |
The impact of media censorship: 1984 0r brave new world? |
Az:000 |
OR/MS / 62 / 1-2 / 25 |
Optimal prescriptive trees |
Cd:000 |
OR/MS / 61 / 5-6 / 385 |
Big data analytics in operations management |
Ad:000 |
OR/MS / 61 / 1-2 / 11 |
Risk averse shortest paths: A computational study |
Ef:000 |
OR/MS / 61 / 1-2 / 93 |
The rich domain of ambiguity explored |
Ef:000 |
OR/MS / 60 / 5-6 / 407 |
Does copyright affect reuse? Evidence from Google Books and Wikipedia |
Ez:000 |
OR/MS / 60 / 5-6 / 417 |
Innovation, openness and platform control |
Af:000 |
OR/MS / 60 / 3-4 / 183 |
Optimal price and delay differentiation in large-scale queuing systems |
Dd:000 |
OR/MS / 60 / 3-4 / 235 |
Millennial-style learning: Search intensity, decision making and information sharing |
Ea:000 |
OR/MS / 60 / 3-4 / 243 |
Uncertain data envelopment analysis |
Cb:000 |
OR/MS / 59 / 5-6 / 389 |
The state-of-the-art integrations and applications of the analytic hierarchy process |
Cb:000 |
OR/MS / 59 / 5-6 / 391 |
Learning to optimize via information-directed sampling |
Cd:000 |
OR/MS / 59 / 5-6 / 423 |
When to release feedback in a dynamic tournament |
Cz:000 |
OR/MS / 59 / 5-6 / 439 |
Effects of system parameters on the optimal cost and policy in a class of multidimensional queuing control problems |
Dd:000 |
OR/MS / 59 / 5-6 / 447 |
Time series forecasting for dynamic quality of web services: An empirical study |
Fc:000 |
OR/MS / 59 / 5-6 / 489 |
Structuring problems for multi-criteria decision analysis in practice: A literature review of method combinations |
Cb:000 |
OR/MS / 59 / 3-4 / 227 |
The vehicle routing problem with release and due dates |
Cc:000 |
OR/MS / 59 / 3-4 / 231 |
Asymptotically optimal control for a multiclass queuing model
in the moderate deviation heavy traffic regime |
Dd:000 |
OR/MS / 59 / 3-4 / 267 |
Co-evolution of social networks and continuous actor attributes |
Fc:000 |
OR/MS / 59 / 3-4 / 311 |
Regenerator location problem in flexible optical networks |
Cc:000 |
OR/MS / 59 / 1-2 / 57 |
Node, edge, arc routing and turn penalties: Multiple problems – one neighborhood extension |
Cc:000 |
OR/MS / 59 / 1-2 / 61 |
Improved local search approaches to solve the post enrollment course enrollment timetabling problem |
Ce:000 |
OR/MS / 59 / 1-2 / 99 |
A demand estimator based on a nested logit model |
Cz:000 |
OR/MS / 59 / 1-2 / 107 |
Discretization precision and assessment error |
Ea:000 |
OR/MS / 59 / 1-2 / 131 |
Capacity investment with demand learning |
Ez:000 |
OR/MS / 58 / 3 / 251 |
New directions for modelling
strategic behavior: Game-theoretic models of communication, coordination and cooperation in economic relationships |
Dc:000 |
OR/MS / 58 / 1-2 / 89 |
An inventory model with three-parameter Weibull deterioration, quadratic demand rate and shortages |
Ed:000 |
OR/MS / 58 / 1-2 / 99 |
The fleet size and mix location-routing problem with time windows:
Formulations and a heuristic algorithm |
Cc:000 |
OR/MS / 57 / 5-6 / 459 |
Case-specific random forests |
Ee:000 |
OR/MS / 57 / 5-6 / 505 |
Deciding for others reduces loss aversion |
Ef:000 |
OR/MS / 57 / 5-6 / 517 |
Newsmaking and sensemaking: Navigating temporal
transitions between planned and unexpected events |
Ef:000 |
OR/MS / 57 / 5-6 / 521 |
Optimal advance scheduling |
Cc:000 |
OR/MS / 57 / 3 / 217 |
Two exact algorithms for the traveling umpire problem |
Cc:000 |
OR/MS / 56 / 5-6 / 481 |
Averting catastrophes:
The strange economics of Scylla and Charybdis |
Ef:000 |
OR/MS / 56 / 5-6 / 527 |
Congestion behavior and tolls in a bottleneck model
with stochastic capacity |
Cc:000 |
OR/MS / 56 / 4 / 347 |
Production and inventory control for a make-to-stock/
calibrate-to-order system with dedicated and shared resources |
Dd:000 |
OR/MS / 56 / 4 / 369 |
Design of near optimal decision rules
in multistage adaptive mixed-integer optimization |
Ea:000 |
OR/MS / 56 / 4 / 375 |
Risk preferences around the world |
Ef:000 |
OR/MS / 56 / 4 / 385 |
Collaboration and multitasking in networks:
Architectures, bottlenecks, and capacity |
Cc:000 |
OR/MS / 56 / 3 / 227 |
Decision making under uncertainty
when preference information is incomplete |
Ea:000 |
OR/MS / 56 / 3 / 253 |
Multi-criteria group decision making based on bilateral agreements |
Ea:000 |
OR/MS / 56 / 3 / 255 |
Measuring uncertainty |
Ef:000 |
OR/MS / 56 / 3 / 265 |
Network data envelopment analysis: A review |
Cb:000 |
OR/MS / 55 / 5-6 / 477 |
Mulitiobjective shortest path problems with lexicographic goal-based preferences |
Ce:000 |
OR/MS / 55 / 5-6 / 513 |
Budget-optimal task allocation for reliable crowdsourcing systems |
Cz:000 |
OR/MS / 55 / 4 / 363 |
Many-server heavy-traffic limit for queues with time-varying parameters |
Dd:000 |
OR/MS / 55 / 4 / 365 |
The appointment scheduling game |
Cc:000 |
OR/MS / 55 / 3 / 233 |
Does higher transparency lead to more search in online auctions? |
Ce:000 |
OR/MS / 55 / 3 / 243 |
Speed–quality trade-offs in a dynamic model |
Db:000 |
OR/MS / 55 / 3 / 245 |
Why do simple heuristics perform well in choices with binary attributes? |
Cb:000 |
OR/MS / 55 / 1-2 / 77 |
The bipartite rationing problem |
Cz:000 |
OR/MS / 55 / 1-2 / 111 |
Deal or no deal: A spreadsheet game to introduce decision making under uncertainty |
Ef:000 |
OR/MS / 55 / 1-2 / 133 |
Effects of risk aversion on the value of information in two-action decision problems |
Ef:000 |
OR/MS / 55 / 1-2 / 135 |
Data envelopment analysis with non-homogeneous DMUs |
Cb:000 |
OR/MS / 54 / 5-6 / 473 |
Optimal dynamic mechanism design and the virtual-pivot mechanism |
Dz:000 |
OR/MS / 54 / 5-6 / 505 |
Ratings and rankings: Voodoo or science? |
Ee:000 |
OR/MS / 54 / 5-6 / 529 |
A new graph-theoretical model for the guillotine-cutting problem |
Cz:000 |
OR/MS / 54 / 4 / 351 |
Modeling bounded rationality in capacity allocation games
with the quantal response equilibrium |
Dc:000 |
OR/MS / 53 / 5-6 / 515 |
Risk preferences are not time preferences |
Ef:000 |
OR/MS / 53 / 5-6 / 535 |
Percolation-based routing in the Internet |
Fc:000 |
OR/MS / 53 / 5-6 / 549 |
Ranking games and gambling: When to quit when you’re
ahead |
Dc:000 |
OR/MS / 53 / 4 / 353 |
First in line waiting times as a tool for analysing queueing systems |
Dd:000 |
OR/MS / 53 / 4 / 355 |
Information transmission and the bullwhip effect: An empirical investigation |
Bc:000 |
OR/MS / 53 / 3 / 205 |
A generic algorithm for solving fuzzy shortest path problems
with fuzzy mixed arc lengths |
Ca:000 |
OR/MS / 53 / 3 / 223 |
Digital science and knowledge boundaries in complex innovation |
Fa:000 |
OR/MS / 53 / 3 / 257 |
Multi-objective optimization with artificial weed colonies |
Cd:000 |
OR/MS / 53 / 1-2 / 79 |
Artificial intelligence and political organization: An
exploration based on the science fiction work of Iain M.
Banks |
Fb:000 |
OR/MS / 53 / 1-2 / 119 |
Bailing out the Once-ler: Using Dr. Seuss to teach management |
Bf:000 |
OR/MS / 52 / 5-6 / 457 |
Priceless: The nonpecuniary benefits of schooling |
Bf:000 |
OR/MS / 52 / 5-6 / 461 |
Stochastic simulation based genetic algorithm for chance constrained data envelopment analysis problems |
Ca:000 |
OR/MS / 52 / 5-6 / 475 |
Increasing selective pressure towards the best compromise
in evolutionary multiobjective optimization: The extended NOSGA method |
Cb:000 |
OR/MS / 52 / 5-6 / 479 |