Sciweavers

266 search results - page 17 / 54
» Solving Very Large Crew Scheduling Problems to Optimality
Sort
View
DAC
2006
ACM
14 years 12 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
WSC
2008
14 years 1 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
EMO
2006
Springer
170views Optimization» more  EMO 2006»
14 years 2 months ago
Robust Multi-Objective Optimization in High Dimensional Spaces
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
André Sülflow, Nicole Drechsler, Rolf ...
MOC
2010
13 years 5 months ago
Entropy-satisfying relaxation method with large time-steps for Euler IBVPs
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...
Frédéric Coquel, Quang Long Nguyen, ...
EVOW
2007
Springer
14 years 5 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...