Sciweavers

4047 search results - page 145 / 810
» The Discrete Basis Problem
Sort
View
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
15 years 7 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
MP
2006
110views more  MP 2006»
15 years 6 months ago
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensurin...
Aharon Ben-Tal, Stephen Boyd, Arkadi Nemirovski
SIAMJO
2010
110views more  SIAMJO 2010»
15 years 1 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
IPSN
2003
Springer
16 years 1 days ago
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
Emre Ertin, John W. Fisher, Lee C. Potter
INFORMS
2008
62views more  INFORMS 2008»
15 years 6 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu