421 | -- | 425 | Xing Gao, Weijun Zhong, Shue Mei. A differential game approach to information security investment under hackers' knowledge dissemination |
426 | -- | 429 | Tomonari Kitahara, Shinji Mizuno, Jianming Shi. The LP-Newton method for standard form linear programming problems |
430 | -- | 435 | Ningxiong Xu, Arthur F. Veinott Jr.. Sequential stochastic core of a cooperative stochastic programming game |
436 | -- | 441 | Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein. Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints |
442 | -- | 444 | Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli. Cutting planes from two-term disjunctions |
445 | -- | 448 | George J. Kyparisis, Christos Koulamas. On index priority sequencing rules for scheduling with time-dependent job processing times |
449 | -- | 453 | M. Gloria Fiestras-Janeiro, Ignacio García-Jurado, Ana Meca, Manuel A. Mosquera. A new cost allocation rule for inventory transportation systems |
454 | -- | 456 | Bara Kim, Jeongsim Kim, Jerim Kim. Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems |
457 | -- | 461 | Bo Zeng, Long Zhao. Solving two-stage robust optimization problems using a column-and-constraint generation method |
462 | -- | 467 | Ali Kakhbod. Pay-to-bid auctions: To bid or not to bid |
468 | -- | 473 | Oriol Tejada. Complements and substitutes in generalized multisided assignment economies |
474 | -- | 476 | Omer Tamuz. A lower bound on seller revenue in single buyer monopoly auctions |
477 | -- | 481 | Olga L. Ortiz, Alan L. Erera, Chelsea C. White III. State observation accuracy and finite-memory policy performance |
482 | -- | 485 | Talat S. Genc, Georges Zaccour. Capacity investments in a stochastic dynamic game: Equilibrium characterization |
486 | -- | 489 | Shmuel Wimer. On optimal flip-flop grouping for VLSI power minimization |
490 | -- | 493 | Pengfei Guo, Mingming Leng, Yulan Wang. A fair staff allocation rule for the capacity pooling of multiple call centers |
494 | -- | 498 | Alois Geyer, Michael Hanke, Alex Weissensteiner. Scenario tree generation and multi-asset financial optimization problems |
503 | -- | 505 | Yu-Hsien Liao. The coincidences among the semicore and the dominance core |
506 | -- | 510 | Lishun Zeng, Shinji Mizuno. Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks |
511 | -- | 515 | Kyoung-Sook Moon, Hongjoong Kim. An adaptive averaging binomial method for option valuation |
516 | -- | 520 | Martin Branda. Reformulations of input-output oriented DEA tests with diversification |
521 | -- | 525 | Lingfei Li, Rafael Mendoza-Arriaga. Ornstein-Uhlenbeck processes time changed with additive subordinators and their applications in commodity derivative models |
526 | -- | 529 | Susumu Cato. The first-order approach to the principal-agent problems under inequality aversion |
530 | -- | 534 | Alper Sen. Performance bounds on optimal fixed prices |
535 | -- | 539 | Yuhang Liu, Zizhuo Wang. A simple policy for multiple queues with size-independent service times |
540 | -- | 544 | George J. Kyparisis, Christos Koulamas. Two-tier equilibria for supply chains with a single manufacturer and multiple asymmetric retailers |
545 | -- | 551 | Xiaoming Yan, Yong Wang. A note on supplier diversification under random yield |
552 | -- | 555 | Pedro J. de Rezende, Flávio Keidi Miyazawa, Anderson T. Sasaki. A PTAS for the disk cover problem of geometric objects |
556 | -- | 558 | Hande Yaman. The splittable flow arc set with capacity and minimum load constraints |
559 | -- | 561 | Naoyuki Kamiyama. A note on the serial dictatorship with project closures |
562 | -- | 0 | Bo van der Rhee, Jack A. A. van der Veen, V. Venugopal, Vijayender Reddy Nalla. Corrigendum to "A new revenue sharing mechanism for coordinating multi-echelon supply chains" [Oper. Res. Lett. 38(4) (2010) 296-301] |
563 | -- | 0 | Zhou Xu, Qi Wen. Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173] |