Sciweavers

1977 search results - page 103 / 396
» The satisfactory partition problem
Sort
View
CAS
2008
68views more  CAS 2008»
15 years 6 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
163
Voted
COLT
2003
Springer
15 years 11 months ago
Learning with Equivalence Constraints and the Relation to Multiclass Learning
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
Aharon Bar-Hillel, Daphna Weinshall
145
Voted
CP
2006
Springer
15 years 10 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
180
Voted
IJHIS
2007
89views more  IJHIS 2007»
15 years 6 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena