The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- The auction algorithm for the transportation problem (Q918416) (← links)
- Constructing integer programming models by the predicate calculus (Q918417) (← links)
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425) (← links)
- A logic language for combinatorial optimization (Q918429) (← links)
- Parallel arc-allocation algorithms for optimizing generalized networks (Q918433) (← links)
- Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
- Solving k-shortest and constrained shortest path problems efficiently (Q918435) (← links)
- Heuristic least-cost computation of discrete classification functions with uncertain argument values (Q918437) (← links)
- Reconstructing shortest paths (Q918442) (← links)
- On the use of expert systems in network optimization: With an application to matrix balancing (Q918444) (← links)
- Controlled rounding for tables with subtotals (Q918619) (← links)
- Ambiguity aversion and ambiguity content in decision making under uncertainty (Q919951) (← links)
- Decision analysis with indeterminate or incoherent probabilities (Q919952) (← links)
- Sure things - dominance and independence rules for choice under uncertainty (Q919953) (← links)
- Expression theory and the measurement of apparently labile values (Q919955) (← links)
- On neutrality of preferences on acts with respect to use of proxy outcomes (Q919957) (← links)
- Risk attitudes for nonlinear measurable utility (Q919960) (← links)
- Axiomatic rank-dependent means (Q919963) (← links)
- Transitivity in the small and in the large for states-additive SSB utilities (Q919964) (← links)
- Estimation of cardinal utility based on a nonlinear theory (Q919966) (← links)
- Duality in non-additive expected utility theory (Q919971) (← links)
- Anticipated utility: A measure representation approach (Q919972) (← links)
- Axiomatic utility theories with the betweenness property (Q919973) (← links)
- An overview of lexicographic choice under uncertainty (Q919974) (← links)
- Subjective expected utility with nonincreasing risk aversion (Q919975) (← links)
- Ascending bid auctions with behaviorally consistent bidders (Q919976) (← links)
- The general optimal market area model (Q919999) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- A method for solving to optimality uncapacitated location problems (Q920004) (← links)
- Discrete facility location with nonlinear diseconomies in fixed costs (Q920006) (← links)
- The use of state space relaxation for the dynamic facility location problem (Q920008) (← links)
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem (Q920010) (← links)
- Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
- Existence theory for spatially competitive network facility location models (Q920014) (← links)
- The capacitated maximal covering location problem with backup service (Q920016) (← links)
- Aggregation effects in maximum covering models (Q920020) (← links)
- A new bounding method for single facility location models (Q920023) (← links)
- Determination of efficient solutions for point-objective locational decision problems (Q920025) (← links)
- Duality for constrained multifacility location problems with mixed norms and applications (Q920027) (← links)
- On the relation between complexity and uncertainty (Q920029) (← links)
- The delivery man problem on a tree network (Q920033) (← links)
- The expected likelihood of transitivity for a probabilistic chooser (Q920815) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- An efficient method to determine the optimal configuration of a flexible manufacturing system (Q920833) (← links)
- Allocating a joint setup in a multi-cell system (Q920835) (← links)
- A demand-driven method for scheduling optimal smooth production levels (Q920837) (← links)
- On the exact upper bound for the Multifit processor scheduling algorithm (Q920838) (← links)
- Almost sure critical paths (Q920839) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
