Sciweavers

1332 search results - page 23 / 267
» Combinatorial Algorithms
Sort
View
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 9 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 19 days ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
14 years 19 days ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
ISAAC
2005
Springer
88views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Combinatorial Network Abstraction by Trees and Distances
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß,...
ATAL
2009
Springer
14 years 3 months ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...