• Publications
  • Influence
Energy efficient schemes for wireless sensor networks with multiple mobile base stations
TLDR
We propose to deploy multiple, mobile base stations to prolong the lifetime of the sensor network. Expand
  • 698
  • 42
  • PDF
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
TLDR
We study the multiple knapsack problem with assignment restrictions (MKAR), which is a variant of the well-known Multiple Knapsack Problem with Assignment Restrictions (MKP) by allowing assignment restrictions. Expand
  • 123
  • 16
  • PDF
On Throughput Maximization in Constant Travel-Time Robotic Cells
TLDR
We consider the problem of scheduling operations in bufferless robotic cells that produce identical parts. Expand
  • 94
  • 14
A Class of Hard Small 0-1 Programs
TLDR
In this paper, we consider a class of 0–1 programs which, although innocent looking, is a challenge for existing solution methods. Expand
  • 76
  • 14
Sequencing and Scheduling in Robotic Cells: Recent Developments
TLDR
A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. Expand
  • 200
  • 13
  • PDF
On Bipartite and Multipartite Clique Problems
TLDR
In this paper, we introduce the maximum edge biclique problem in bipartite graphs and the edge/node weighted multipartite clique problem in multipartITE graphs. Expand
  • 135
  • 12
  • PDF
Link scheduling in sensor networks: distributed edge coloring revisited
TLDR
We propose a distributed edge coloring algorithm that needs at most (/spl delta/+1) colors, where /spl delta/ is the maximum degree of the graph. Expand
  • 218
  • 11
  • PDF
Throughput Optimization in Robotic Cells
TLDR
Robotic Cells in Practice.- A Classification Scheme for Robotic Cells and Notation. Expand
  • 109
  • 6
Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page
AbstractConsider a set of n advertisements (hereafter called “ads”) A ={A1,...,An} competing to be placed in a planning horizon which is divided into N time intervals called slots. An ad Ai isExpand
  • 56
  • 6
Fixed-Dimensional Stochastic Dynamic Programs: An Approximation Scheme and an Inventory Application
TLDR
We study fixed-dimensional stochastic dynamic programs in a discrete setting over a finite horizon. Expand
  • 22
  • 6
  • PDF