Sciweavers

62 search results - page 5 / 13
» A branch-and-bound algorithm for the linear ordering problem...
Sort
View
PAMI
2008
162views more  PAMI 2008»
13 years 7 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
MP
2006
87views more  MP 2006»
13 years 7 months ago
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
In this paper, we present a robust optimization formulation for dealing with demand uncertainty in a dynamic pricing and inventory control problem for a make-to-stock manufacturing...
Elodie Adida, Georgia Perakis
TASE
2008
IEEE
13 years 7 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 8 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
ICMLA
2007
13 years 8 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio