Sciweavers

COR
2008
103views more  COR 2008»
13 years 11 months ago
A tabu search algorithm for structural software testing
This paper presents a tabu search metaheuristic algorithm for the automatic generation of structural software tests. It is a novel work since tabu search is applied to the automat...
Eugenia Díaz, Javier Tuya, Raquel Blanco, J...
COR
2008
60views more  COR 2008»
13 years 11 months ago
Design of an adaptive mutation operator in an electrical load management case study
Alvaro Gomes, Carlos Henggeler Antunes, Antonio Go...
COR
2008
80views more  COR 2008»
13 years 11 months ago
Multi-period capacitated location with modular equipments
This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to an...
Éric Gourdin, Olivier Klopfenstein
COR
2008
112views more  COR 2008»
13 years 11 months ago
Bi-dynamic constraint aggregation and subproblem reduction
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53...
Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib...
COR
2008
175views more  COR 2008»
13 years 11 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
COR
2008
95views more  COR 2008»
13 years 11 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
COR
2008
119views more  COR 2008»
13 years 11 months ago
The valuation of multidimensional American real options using the LSM simulation method
In this paper we show how a multidimensional American real option may be solved using the LSM simulation method originally proposed by Longstaff and Schwartz [2001, The Review of ...
Gonzalo Cortazar, Miguel Gravet, Jorge Urzua
COR
2008
75views more  COR 2008»
13 years 11 months ago
Roll assortment optimization in a paper mill: An integer programming approach
Satyaveer Singh Chauhan, Alain Martel, Sophie D'Am...
COR
2008
122views more  COR 2008»
13 years 11 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
COR
2008
93views more  COR 2008»
13 years 11 months ago
Improving solver success in reaching feasibility for sets of nonlinear constraints
Whether a given nonlinear solver can reach a feasible point for a set of nonlinear constraints depends heavily on the initial point provided. We develop a range of computationally...
Walid Ibrahim, John W. Chinneck