Sciweavers

3367 search results - page 183 / 674
» Incremental assignment problem
Sort
View
JAIR
2010
90views more  JAIR 2010»
14 years 10 months ago
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
Gerold Jäger, Weixiong Zhang
AUSAI
2003
Springer
15 years 8 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
ICALP
2010
Springer
15 years 8 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 7 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
WSC
2008
15 years 5 months ago
Simulation-based optimization for the quay crane scheduling problem
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
Pasquale Legato, Rina Mary Mazza, Roberto Trunfio