The following pages link to K. P. K. Nair (Q231004):
Displayed 45 items.
- Optimization of bicriterion quasi-concave function subject to linear constraints (Q752008) (← links)
- Ratio dynamic programs (Q797504) (← links)
- A note on the m-center problem with rectilinear distances (Q913636) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- Network flows with age dependent decay rates (Q1060129) (← links)
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- Fuzzy models for single-period inventory problem (Q1867683) (← links)
- Multi-terminal multipath flows: synthesis (Q1887053) (← links)
- Fuzzy disk for covering fuzzy points (Q1887918) (← links)
- Constrained balanced optimization problems (Q1963024) (← links)
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks (Q2267666) (← links)
- Efficient chains in a network with time-cost trade-off function on each arc (Q2367391) (← links)
- Flows over edge-disjoint mixed multipaths and applications (Q2381819) (← links)
- On linear multiplicative programming. (Q2468549) (← links)
- Multiroute flows: cut-trees and realizability (Q2581318) (← links)
- (Q2867369) (← links)
- VLSN search algorithms for partitioning problems using matching neighbourhoods (Q3515505) (← links)
- Classes of linear programs with integral optimal solutions (Q3694985) (← links)
- (Q3779569) (← links)
- Maximal expected flow in a network subject to arc failures (Q3870689) (← links)
- Bicriteria Transportation Problem (Q3885513) (← links)
- Minimal Cost-Reliability Ratio Spanning Tree (Q3923967) (← links)
- Multicommodity Network Flows with Probabilistic Losses (Q3968729) (← links)
- Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems (Q3978839) (← links)
- A heuristic approach to optimal assignment of components to a parallel-series network (Q3987528) (← links)
- Stochastic game models of brand switching (Q4152076) (← links)
- The constrained shortest path problem (Q4175067) (← links)
- Two problems in multicommodity networks (Q4193282) (← links)
- (Q4287663) (← links)
- On capacitated stochastic chain problems in a network (Q4378525) (← links)
- Maximizing residual flow under an arc destruction (Q4537607) (← links)
- Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems (Q4838218) (← links)
- Generalized Bottleneck Problems<sup>∗</sup> (Q4859828) (← links)
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem (Q4888175) (← links)
- Production Planning in Assembly Line Systems (Q5184650) (← links)
- Integer Exact Network Synthesis Problem (Q5189504) (← links)
- Location Of A Tree Shaped Facility In A Network (Q5287407) (← links)
- Multistage Planned Replacement Strategies (Q5521272) (← links)
- Multistage Replacement Strategies with Finite Duration of Transfer (Q5524170) (← links)
- Multistage Replacement Strategies (Q5568474) (← links)
- Fuzzy versions of the covering circle problem (Q5956206) (← links)