Sciweavers

1707 search results - page 273 / 342
» Early Integer Programming
Sort
View
ORL
2007
49views more  ORL 2007»
14 years 9 months ago
Lot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
Hamish Waterer
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
CN
2008
106views more  CN 2008»
14 years 8 months ago
Optimization models and methods for planning wireless mesh networks
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing f...
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ila...
INFORMS
2010
107views more  INFORMS 2010»
14 years 8 months ago
A Class Representative Model for Pure Parsimony Haplotyping
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
Daniele Catanzaro, Alessandra Godi, Martine Labb&e...
MP
2010
145views more  MP 2010»
14 years 8 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...