Sciweavers

11562 search results - page 264 / 2313
» Parallel Imaging Problem
Sort
View
COCOA
2007
Springer
16 years 25 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
STACS
2007
Springer
16 years 23 days ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
CPAIOR
2007
Springer
16 years 25 days ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
16 years 24 days ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
IJCAI
2003
15 years 8 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...