Keyword: computational analysis

Found 489 papers in total
Resource management in machine scheduling problems: A survey
Resource management in machine scheduling problems: A survey
2007,
The paper is a survey devoted to job scheduling problems with resource allocation. We...
How tight is the corner relaxation?
How tight is the corner relaxation?
2008,
Given a mixed-integer linear programming (MILP) model and an optimal basis of the...
Incremental medians via online bidding
Incremental medians via online bidding
2008,
In the k -median problem we are given sets of facilities and customers, and distances...
Life time warranty cost model for software with imperfect error rectification
Life time warranty cost model for software with imperfect error rectification
2008,
The optimum release time or total testing time of a software product subject to the...
ϵ-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
ϵ-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
2008,
Motivated by the need to deal with imprecise data in real-world optimization problems,...
A note on the k-Canadian Traveller Problem
A note on the k-Canadian Traveller Problem
2008,
We consider the online problem k -CTP, which is the problem to guide a vehicle from...
Locating waste pipelines to minimize their impact on marine environment
Locating waste pipelines to minimize their impact on marine environment
2007,
A waste pipeline, considered as an undesirable facility, is to be located in a coastal...
An algorithm for the detection of move repetition without the use of hash-keys
An algorithm for the detection of move repetition without the use of hash-keys
2007,
This paper addresses the theoretical and practical aspects of an important problem in...
Algorithms for the problem of non-capacitated flows with fixed costs in arcs: a statistical comparison
Algorithms for the problem of non-capacitated flows with fixed costs in arcs: a statistical comparison
2001,
This paper is concerned about empirical comparisons of algorithms, one of the most...
Minimum Lk path partitioning – An illustration of the Monge property
Minimum Lk path partitioning – An illustration of the Monge property
2008,
We investigate the problem of cutting a given sequence of positive real numbers into p...
Complexity of the min–max (regret) versions of min cut problems
Complexity of the min–max (regret) versions of min cut problems
2008,
This paper investigates the complexity of the min–max and min–max regret...
Artificial immune system to solve the problem of minimum generating tree with parameters
Artificial immune system to solve the problem of minimum generating tree with parameters
2007,
This work proposes an heuristical approach based on evolutionary computation, whose...
The effect of multiple optima on the simple genetic algorithm run-time complexity
The effect of multiple optima on the simple genetic algorithm run-time complexity
2007,
Genetic algorithms are stochastic search algorithms that have been applied to...
K3,3 minors and the maximum-flow problem
K3,3 minors and the maximum-flow problem
2008,
Let G be a graph, and let e be an edge of G. The main result of this paper is that any...
Necessary and sufficient conditions of optimality for some classical scheduling problems
Necessary and sufficient conditions of optimality for some classical scheduling problems
2007,
A scheduling problem is generally to order the jobs such that a certain objective...
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
2007,
An automated production system is considered in which several robots are used for...
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
2007,
In this paper, we consider the single machine batching problem with family setup times...
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
2007,
Saadani et al. studied the classical n -job flow shop scheduling problem F2‖C...
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
2007,
Baker and Nuttle studied the following single-variable-resource scheduling problem:...
Enumerating spanning and connected subsets in graphs and matroids
Enumerating spanning and connected subsets in graphs and matroids
2007,
We show that enumerating all minimal spanning and connected subsets of a given matroid...
Two fast algorithms for all-pairs shortest paths
Two fast algorithms for all-pairs shortest paths
2007,
In a large, dense network, the computation of the ‘distances’, i.e., the...
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
2007,
The two-dimensional bin-packing problem (2 BP ) consists of minimizing the number of...
Interval scheduling: a survey
Interval scheduling: a survey
2007,
In interval scheduling, not only the processing times of the jobs but also their...
A combined cluster and interaction model: The hierarchical assignment problem
A combined cluster and interaction model: The hierarchical assignment problem
2005,
This article presents a new spatial modeling approach that deals with interactions...
Papers per page: