Sciweavers

23 search results - page 4 / 5
» Solving Integer and Disjunctive Programs by Lift and Project
Sort
View
EOR
2006
148views more  EOR 2006»
14 years 9 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
SASO
2008
IEEE
15 years 3 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
MP
2008
99views more  MP 2008»
14 years 9 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
15 years 4 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
COR
2011
14 years 4 months ago
Event-based MILP models for resource-constrained project scheduling problems
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
Oumar Koné, Christian Artigues, Pierre Lope...