Sciweavers

2182 search results - page 99 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 5 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
EVOW
2008
Springer
13 years 9 months ago
A Hybrid Column Generation Approach for the Berth Allocation Problem
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz A...
IJAIT
2008
99views more  IJAIT 2008»
13 years 7 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
ORL
2007
64views more  ORL 2007»
13 years 7 months ago
Robust portfolio selection with uncertain exit time using worst-case VaR strategy
In this paper we consider the robust portfolio selection problem involving two types of uncertainties; the uncertainty in the distribution of exit time and the uncertainty in the ...
Dashan Huang, Frank J. Fabozzi, Masao Fukushima
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean