Sciweavers

172 search results - page 24 / 35
» eor 2006
Sort
View
101
Voted
EOR
2006
130views more  EOR 2006»
15 years 8 days ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
119
Voted
EOR
2006
104views more  EOR 2006»
15 years 8 days ago
A wavelet-based spectral procedure for steady-state simulation analysis
We develop WASSP, a wavelet-based spectral method for steady-state simulation analysis. First WASSP determines a batch size and a warm-up period beyond which the computed batch me...
Emily K. Lada, James R. Wilson
117
Voted
EOR
2006
118views more  EOR 2006»
15 years 8 days ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
103
Voted
EOR
2006
93views more  EOR 2006»
15 years 8 days ago
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the p...
Andreas Bortfeldt
EOR
2006
88views more  EOR 2006»
15 years 8 days ago
Nonessential objectives within network approaches for MCDM
In Gal and Hanne [Eur. J. Oper. Res. 119 (1999) 373] the problem of using several methods to solve a multiple criteria decision making (MCDM) problem with linear objective functio...
Tomas Gal, Thomas Hanne