Aneja Y P

Y P Aneja

Information about the author Y P Aneja will soon be added to the site.
Found 4 papers in total
A robust branch‐and‐cut approach for the minimum‐energy symmetric network connectivity problem
A robust branch‐and‐cut approach for the minimum‐energy symmetric network connectivity problem
2012
This paper considers the minimum‐energy symmetric network connectivity problem...
Using branch‐and‐price approach to solve the directed network design problem with relays
Using branch‐and‐price approach to solve the directed network design problem with relays
2012
We present node‐arc and arc‐path formulations, and develop a...
Equivalence of e ‐Approximate Separation and Optimization in Fixed Dimensions
Equivalence of e ‐Approximate Separation and Optimization in Fixed Dimensions
2001
Given a closed, convex set X\subseteq \bbR n , containing the origin, we consider the...
An ant colony optimization metaheuristic for single-path multicommodity network flow problems
An ant colony optimization metaheuristic for single-path multicommodity network flow problems
2010
This paper studies the single-path multicommodity network flow problem (SMNF), in...
Papers per page: