Sciweavers

691 search results - page 23 / 139
» Genetic Programming Applied to Mixed Integer Programming
Sort
View
67
Voted
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
15 years 2 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
IPCO
2008
136views Optimization» more  IPCO 2008»
14 years 11 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
77
Voted
INFORMS
2006
87views more  INFORMS 2006»
14 years 9 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
IJMTM
2011
190views more  IJMTM 2011»
14 years 4 months ago
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...
95
Voted
CEC
2008
IEEE
15 years 3 months ago
Geometric PSO + GP = Particle Swarm Programming
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
Julian Togelius, Renzo De Nardi, Alberto Moraglio