Sciweavers

719 search results - page 56 / 144
» Solving Sparse Linear Constraints
Sort
View
TCBB
2008
122views more  TCBB 2008»
14 years 10 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
EOR
2011
134views more  EOR 2011»
14 years 5 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
14 years 5 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
77
Voted
MMAS
2010
Springer
14 years 5 months ago
A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
Dorit Ron, Ilya Safro, Achi Brandt
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 4 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti