Yuan Di

Di Yuan

Information about the author Di Yuan will soon be added to the site.
Found 11 papers in total
Solving Nonlinear Covering Problems Arising in WLAN Design
Solving Nonlinear Covering Problems Arising in WLAN Design
2011
Wireless local area networks (WLANs) are widely used for cable replacement and...
A fast local search method for minimum energy broadcast in wireless ad hoc networks
A fast local search method for minimum energy broadcast in wireless ad hoc networks
2009
Local search methods are often used to reduce the power consumption of broadcast...
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
2008
A multicast session in a wireless ad hoc network concerns routing messages from a...
Pilot power optimization and coverage control in wideband code division multiple access (WCDMA) mobile networks
Pilot power optimization and coverage control in wideband code division multiple access (WCDMA) mobile networks
2007
In mobile networks using wideband code division multiple access (WCDMA), common pilot...
Optimized planning of frequency hopping in cellular networks
Optimized planning of frequency hopping in cellular networks
2005
We consider a generalization of the classical frequency assignment problem. The...
An augmented Lagrangian algorithm for large scale multicommodity routing
An augmented Lagrangian algorithm for large scale multicommodity routing
2004
The linear multicommodity network flow (MCNF) problem has many applications in the...
Optimization of Internet Protocol network design and routing
Optimization of Internet Protocol network design and routing
2004
We consider network design and routing for Internet Protocol (IP) traffic. The design...
A multicommodity network-flow problem with side constraints on paths solved by column generation
A multicommodity network-flow problem with side constraints on paths solved by column generation
2003
The multicommodity network-flow model concerns routing of a number of commodities...
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
2000
The capacitated network design problem is a multicommodity minimal cost network flow...
A Lagrangean approach to network design problems
A Lagrangean approach to network design problems
1998
Network design is a very important issue in the area of telecommunications and...
An exact algorithm for the capacitated facility location problems with single sourcing
An exact algorithm for the capacitated facility location problems with single sourcing
1999
Facility location problems are often encountered in many areas such as distribution,...
Papers per page: