Sciweavers

1274 search results - page 147 / 255
» N-fold integer programming
Sort
View
ATAL
2010
Springer
13 years 10 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
ANOR
2007
166views more  ANOR 2007»
13 years 10 months ago
Memetic particle swarm optimization
Abstract We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in a...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 10 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
COR
2008
112views more  COR 2008»
13 years 10 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 10 months ago
Building Better Nurse Scheduling Algorithms
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, ...
Uwe Aickelin, Paul White