Sciweavers

4081 search results - page 437 / 817
» The Impact of Constraint Programming
Sort
View
IOR
2006
173views more  IOR 2006»
15 years 6 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
147
Voted
JISE
2006
76views more  JISE 2006»
15 years 6 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
IFIP
2010
Springer
15 years 1 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli
SIAMJO
2010
89views more  SIAMJO 2010»
15 years 1 months ago
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
Roberto Andreani, José Mario Martíne...
CPAIOR
2011
Springer
14 years 10 months ago
Optimization Methods for the Partner Units Problem
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...