Sciweavers

1274 search results - page 74 / 255
» N-fold integer programming
Sort
View
ECWEB
2003
Springer
104views ECommerce» more  ECWEB 2003»
14 years 3 months ago
e-Procurement Using Goal Programming
Abstract. e-Procurement is an Internet-based business process for obtaining materials and services and managing their inflow into the organization. In this paper we develop multia...
S. Kameshwaran, Y. Narahari
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
14 years 2 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
MVA
1996
129views Computer Vision» more  MVA 1996»
13 years 11 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
MANSCI
2008
75views more  MANSCI 2008»
13 years 10 months ago
Staffing Multiskill Call Centers via Linear Programming and Simulation
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
Mehmet Tolga Çezik, Pierre L'Ecuyer
NETWORKS
2008
13 years 10 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...