Sciweavers

189 search results - page 21 / 38
» A generalization of the integer linear infeasibility problem
Sort
View
JACM
2007
132views more  JACM 2007»
13 years 7 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
MP
2007
145views more  MP 2007»
13 years 7 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 2 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...
EOR
2006
148views more  EOR 2006»
13 years 7 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...
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
13 years 12 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran