The following pages link to N. A. Bryson (Q1265039):
Displaying 26 items.
- (Q1125105) (redirect page) (← links)
- A process for generating quantitative belief functions (Q1125107) (← links)
- Applications of the parametric programming procedure (Q1179007) (← links)
- A formal method for analyzing and integrating the rule-sets of multiple experts (Q1198099) (← links)
- Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040) (← links)
- An action learning evaluation procedure for multiple criteria decision making problems (Q1278506) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- Generating consensus priority point vectors: A logarithmic goal programming approach (Q1302734) (← links)
- Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm (Q1317085) (← links)
- An approach to using the analytic hierarchy process for solving multiple criteria decision making problems (Q1333494) (← links)
- Partitioning of sequentially ordered systems using linear programming (Q1362974) (← links)
- Supporting consensus formation in group support systems using the qualitative discriminant process (Q1368357) (← links)
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (Q1368436) (← links)
- \(w\)-efficient partitions and the solution of the sequential clustering problem (Q1374298) (← links)
- Modelling pairwise comparisons on ratio scales (Q1388855) (← links)
- Eliciting and mapping qualitative preferences to numeric rankings in group decision making (Q1610173) (← links)
- Parametric linear programming and cluster analysis (Q1806869) (← links)
- Making the information systems outsourcing decision: A transaction cost approach to analyzing outsourcing decision problems (Q1809814) (← links)
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint (Q1814154) (← links)
- Group decision-making and the analytic hierarchy process: Exploring the consensus-relevant information content (Q1906946) (← links)
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints (Q2368115) (← links)
- Optimal techniques for class-dependent attribute discretization (Q4658503) (← links)
- Joint Vendor-buyer Policy in JIT Manufacturing (Q4834261) (← links)
- A Goal Programming Method for Generating Priority Vectors (Q4840366) (← links)
- Aggregating preference rankings: An AHP‐based approach (Q4844598) (← links)
- Identifying the Efficient Extreme-Points of the Three-Objective Linear Programming Problem (Q5289363) (← links)
