Sciweavers

1182 search results - page 47 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
IOR
2010
98views more  IOR 2010»
14 years 11 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
COR
2011
14 years 9 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 15 days ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ICIP
2004
IEEE
16 years 3 months ago
Simplified digital holographic reconstruction using statistical methods
For reconstructing a complex object wavefront from digital holograms, we propose a new penalized-likelihood approach based on the measurement statistics and edge-preserving regula...
Jeffrey A. Fessler, Saowapak Sotthivirat
134
Voted
PPSN
2000
Springer
15 years 5 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...