Sciweavers

3250 search results - page 32 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SIAMSC
2010
143views more  SIAMSC 2010»
13 years 6 months ago
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromod
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
Andreas Stathopoulos, Konstantinos Orginos
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
AAAI
2006
13 years 10 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
14 years 23 days ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
CP
2005
Springer
14 years 2 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich