Sciweavers

14739 search results - page 226 / 2948
» An optimization problem on the sphere
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
14 years 8 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
MST
2010
86views more  MST 2010»
14 years 5 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 2 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 1 months ago
A Hamiltonian approximation method for the reduction of controlled systems
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
Siep Weiland
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
15 years 5 months ago
A genetic algorithm for resident physician scheduling problem
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
Chi-Way Wang, Lei-Ming Sun, Ming-Hui Jin, Chung-Ju...