The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- Generalized Nash Equilibrium Problems (Q59878) (← links)
- Stability criterion of a multiserver model with simultaneous service (Q104497) (← links)
- The impact of covariance misspecification in risk-based portfolios (Q126312) (← links)
- On the point for which the sum of the distances to n given points is minimum (Q134355) (← links)
- A non-cooperative mechanism for the Shapley value of airport problems (Q256597) (← links)
- Measuring slacks-based efficiency for commercial banks in China by using a two-stage DEA model with undesirable output (Q256601) (← links)
- A discrete-time queueing system with server breakdowns and changes in the repair times (Q256602) (← links)
- Signaling theory revisited: a very short insurance case (Q256603) (← links)
- Nearest neighbors methods for support vector machines (Q256606) (← links)
- A leader-follower partially observed, multiobjective Markov game (Q256610) (← links)
- Value of information for a leader-follower partially observed Markov game (Q256611) (← links)
- Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices (Q256616) (← links)
- When is it better to wait for a new version? Optimal replacement of an emerging technology under uncertainty (Q256619) (← links)
- Robust timing of markdowns (Q256623) (← links)
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (Q256627) (← links)
- Microgrid investment under uncertainty: a real option approach using closed form contingent analysis (Q256632) (← links)
- Information security investment for competitive firms with hacker behavior and security requirements (Q256635) (← links)
- Autonomous coalitions (Q256638) (← links)
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Tree approximation for discrete time stochastic processes: a process distance approach (Q256651) (← links)
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- Effective production: measuring of the sales effect using data envelopment analysis (Q256658) (← links)
- Personnel scheduling and supplies provisioning in emergency relief operations (Q256662) (← links)
- Bayesian decision support for complex systems with many distributed experts (Q256664) (← links)
- A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems (Q256666) (← links)
- On the use of the \(L_{p}\) distance in reference point-based approaches for multiobjective optimization (Q256671) (← links)
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
- A modification of a mixed integer linear programming (MILP) model to avoid the computational complexity (Q256677) (← links)
- On the impact of semidefinite positive correlation measures in portfolio theory (Q256678) (← links)
- Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
- Young's axiomatization of the Shapley value: a new proof (Q256682) (← links)
- On games arising from multi-depot Chinese postman problems (Q256685) (← links)
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems (Q256691) (← links)
- Aggregate directional distance formulation of DEA with integer variables (Q256695) (← links)
- Bounds on uptime distribution based on aging for systems with finite lifetimes (Q256697) (← links)
- Optimal stopping time in software testing based on failure size approach (Q256699) (← links)
- Service supply chain coordination with platform effort-induced demand (Q256704) (← links)
- Majorization comparison of closed list electoral systems through a matrix theorem (Q256705) (← links)
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Stability of vertically differentiated Cournot and Bertrand-type models when firms are boundedly rational (Q271913) (← links)
- Modeling supermarket re-layout from the owner's perspective (Q271919) (← links)
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- Analysis of a discrete-time queue with time-limited overtake priority (Q271924) (← links)
- On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
- A queueing model with two classes of retrial customers and paired services (Q271928) (← links)
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- Self-regenerating environmental absorption efficiency and the soylent green scenario (Q271934) (← links)
