Sciweavers

691 search results - page 47 / 139
» Genetic Programming Applied to Mixed Integer Programming
Sort
View
111
Voted
CEC
2009
IEEE
15 years 9 months ago
Optimization of the sizing of a solar thermal electricity plant: Mathematical programming versus genetic algorithms
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
Jose M. Cabello, Jose M. Cejudo, Mariano Luque, Fr...
118
Voted
4OR
2004
90views more  4OR 2004»
15 years 2 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
107
Voted
MP
2010
92views more  MP 2010»
14 years 9 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
121
Voted
ATAL
2010
Springer
15 years 2 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss
146
Voted
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 8 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai