691 search results - page 84 / 139 » Genetic Programming Applied to Mixed Integer Programming |
116
click to vote
ICTAI
1999
IEEE
15 years 7 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
125
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
122
click to vote
COR
2008
15 years 2 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
129
Voted
EOR
2008
15 years 2 months ago
2008
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
127
click to vote
MP
2006
15 years 2 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...