Sciweavers

1603 search results - page 15 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
EOR
2006
59views more  EOR 2006»
14 years 10 months ago
Sensitivity analysis in linear optimization: Invariant support set intervals
Sensitivity analysis is one of the most interesting and preoccupying areas in optimization. Many attempts are made to investigate the problem's behavior when the input data c...
Alireza Ghaffari Hadigheh, Tamás Terlaky
ATAL
2010
Springer
14 years 11 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
ARSCOM
2007
115views more  ARSCOM 2007»
14 years 10 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
WWW
2007
ACM
15 years 10 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
EMO
2003
Springer
136views Optimization» more  EMO 2003»
15 years 3 months ago
Solving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...
Michael Guntsch, Martin Middendorf