Sciweavers

2109 search results - page 64 / 422
» Solving Necklace Constraint Problems
Sort
View
132
Voted
CPC
2006
110views more  CPC 2006»
15 years 4 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
135
Voted
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
15 years 10 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...
JAIR
2010
130views more  JAIR 2010»
15 years 3 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
CP
1999
Springer
15 years 8 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
154
Voted
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 10 months ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell