The following pages link to Vishnu Narayanan (Q337180):
Displaying 20 items.
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- Facility location models to locate data in information networks: a literature review (Q512996) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone (Q4596201) (← links)
- Semidefinite Approximation of Closed Convex Set (Q4613906) (← links)
- Facial Structure and Representation of Integer Hulls of Convex Sets (Q4910825) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- Cuts for Conic Mixed-Integer Programming (Q5429254) (← links)
- Exact augmented Lagrangian duality for mixed integer convex optimization (Q6506667) (← links)
- An open-source solver for finding global solutions to constrained derivative-free optimization problems (Q6532380) (← links)
- On generators of $k$-PSD closures of the positive semidefinite cone (Q6532986) (← links)
- Exact augmented Lagrangian duality for mixed integer convex optimization (Q6542541) (← links)
- Distributed accelerated gradient methods with restart under quadratic growth condition (Q6607027) (← links)
