Journal: Algorithmic Operations Research

Found 60 papers in total
On-line network synthesis
On-line network synthesis
2007,
We consider on-line network synthesis problems. Let N = {1, , n} be a set of n sites....
Constructing incremental sequences in graphs
Constructing incremental sequences in graphs
2006,
Given a weighted graph G=(V,E,w) , we investigate the problem of constructing a...
On-line bin packing with two item sizes
On-line bin packing with two item sizes
2006,
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of...
Mathematical models of the delay constrained routing problem
Mathematical models of the delay constrained routing problem
2006,
Given a network with known link capacities and traffic demands, one can compute the...
Preemptive scheduling with position costs
Preemptive scheduling with position costs
2006,
This paper is devoted to basic scheduling problems in which the scheduling cost of a...
Vehicle routing problem with time windows: An evolutionary algorithmic approach
Vehicle routing problem with time windows: An evolutionary algorithmic approach
2006,
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in...
A new practically efficient interior point method for LP
A new practically efficient interior point method for LP
2006,
In this paper we briefly review the importance of LP (linear programming), and...
The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse
The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse
2006,
This paper considers large-scale multistage stochastic linear programs. Sampling is...
Simplex adjacency graphs in linear optimization
Simplex adjacency graphs in linear optimization
2006,
Simplex adjacency graphs represent the possible Simplex pivot operations (the edges)...
Performance of simulated annealing, tabu search, and evolutionary algorithms for multi-objective network partitioning
Performance of simulated annealing, tabu search, and evolutionary algorithms for multi-objective network partitioning
2006,
Most real optimization problems often involve multiple objectives to optimize. In...
On the stability of approximation for Hamiltonian path problems
On the stability of approximation for Hamiltonian path problems
2006,
We consider the problem of finding a cheapest Hamiltonian path of a complete graph...
Note on upper bounds for the travelling salesperson problem domination number
Note on upper bounds for the travelling salesperson problem domination number
2006,
The domination number, domn (A, n) , of a heuristic A for the Asymmetric TSP is the...
Papers per page: