Sciweavers

817 search results - page 96 / 164
» Exact solutions to linear programming problems
Sort
View
ORL
2006
105views more  ORL 2006»
15 years 2 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
COR
2010
123views more  COR 2010»
15 years 2 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
GLOBECOM
2008
IEEE
15 years 8 months ago
QoS Routing in Wireless Mesh Networks with Cognitive Radios
— In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a har...
Roberto Hincapie, Jian Tang, Guoliang Xue, Roberto...
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 6 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
GLOBECOM
2009
IEEE
15 years 9 months ago
Strong Barrier Coverage with Directional Sensors
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Li Zhang, Jian Tang, Weiyi Zhang