Sciweavers

673 search results - page 37 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
IFIP12
2004
13 years 9 months ago
A Decision Support System (DSS) for the Railway Scheduling Problem
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
Laura Paola Ingolotti, María Pilar Tormos, ...
SIAMJO
2010
97views more  SIAMJO 2010»
13 years 2 months ago
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh
CPAIOR
2007
Springer
14 years 1 months ago
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, An...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 7 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 7 months ago
Using machine learning to make constraint solver implementation decisions
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
Lars Kotthoff, Ian P. Gent, Ian Miguel