The following pages link to Yash P. Aneja (Q627449):
Displaying 50 items.
- (Q203394) (redirect page) (← links)
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
- Optimization of bicriterion quasi-concave function subject to linear constraints (Q752008) (← links)
- Ratio dynamic programs (Q797504) (← links)
- A new branch-and-cut approach for the generalized regenerator location problem (Q827283) (← links)
- A note on the m-center problem with rectilinear distances (Q913636) (← links)
- An ant colony optimization metaheuristic for machine-part cell formation problems (Q991361) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- Network flows with age dependent decay rates (Q1060129) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Lexicographic bottleneck combinatorial problems (Q1306468) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- Lexicographic balanced optimization problems (Q1433654) (← links)
- Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- Multiple bottleneck assignment problem (Q1806893) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- Multi-terminal multipath flows: synthesis (Q1887053) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- On \(k\)-sum optimization (Q1919195) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks (Q2267666) (← links)
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← 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)
- A new approach for designing fault-tolerant WDM networks (Q2518527) (← links)
- A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks (Q2815458) (← links)
- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks (Q3637096) (← links)
- Classes of linear programs with integral optimal solutions (Q3694985) (← links)
- The Optimality of (<i>s</i>, <i>S</i>) Policies for a Stochastic Inventory Problem with Proportional and Lump-Sum Penalty Cost (Q3771938) (← links)
- Maximal expected flow in a network subject to arc failures (Q3870689) (← links)
- Bicriteria Transportation Problem (Q3885513) (← links)
- An integer linear programming approach to the steiner problem in graphs (Q3890443) (← 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)
- The constrained shortest path problem (Q4175067) (← links)
- Two problems in multicommodity networks (Q4193282) (← links)
- Categorized Assignment Scheduling: a Tabu Search Approach (Q4273298) (← links)
- Capacity Expansion and Contraction Of A Facility With Economies Of Scale (Q4281931) (← links)
- (Q4287663) (← links)
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel (Q4291466) (← links)
- Maximizing residual flow under an arc destruction (Q4537607) (← links)