Sciweavers

9626 search results - page 1427 / 1926
» Invariant Based Programming
Sort
View
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 7 months ago
Using ATL to define advanced and flexible constraint model transformations
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
Raphaël Chenouard, Laurent Granvilliers, Rica...
COR
2008
96views more  COR 2008»
15 years 7 months ago
Discrete models for competitive location with foresight
We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective ...
Frank Plastria, Lieselot Vanhaverbeke
COR
2008
88views more  COR 2008»
15 years 7 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
COR
2008
101views more  COR 2008»
15 years 7 months ago
Stochastic facility location with general long-run costs and convex short-run costs
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
Peter Schütz, Leen Stougie, Asgeir Tomasgard
COR
2008
112views more  COR 2008»
15 years 7 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...
« Prev « First page 1427 / 1926 Last » Next »