Sciweavers

14739 search results - page 211 / 2948
» An optimization problem on the sphere
Sort
View
COR
2004
291views more  COR 2004»
14 years 11 months ago
Cycling in linear programming problems
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
Saul I. Gass, Sasirekha Vinjamuri
BMCBI
2010
116views more  BMCBI 2010»
14 years 11 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 4 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
CCCG
2007
15 years 15 days ago
The Slider-Pinning Problem
A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n−3 edges and exactly k = 2n− m degrees of freedom. The slider-pinning problem is to eliminate all ...
Audrey Lee, Ileana Streinu, Louis Theran
ORL
2007
102views more  ORL 2007»
14 years 10 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov