Journal: Algorithmic Operations Research

Found 60 papers in total
Discovering trends in gene expression data using a hybrid evolutionary algorithm
Discovering trends in gene expression data using a hybrid evolutionary algorithm
2008,
High–throughput technology has enabled molecular biologists to study genes and...
Reducing the tongue–and–groove underdosage in MLC (multileaf collimator) shape matrix decomposition
Reducing the tongue–and–groove underdosage in MLC (multileaf collimator) shape matrix decomposition
2008,
We present an algorithm for optimal step–and–shoot multileaf collimator...
Optimizing chemotherapy scheduling by iteratively solving a recurrence equation
Optimizing chemotherapy scheduling by iteratively solving a recurrence equation
2008,
We illustrate how an iterative method and the idea of recurrence can be employed to...
Multiobjective optimization in health care management. A metaheuristic and simulation approach
Multiobjective optimization in health care management. A metaheuristic and simulation approach
2008,
This paper describes a methodology which combines elements of statistics, probability,...
Integrated software tools for the OR/MS classroom
Integrated software tools for the OR/MS classroom
2008,
In recent years, a growing range of software technologies has been deployed in the...
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
2008,
In a graph G = (V, E), an identifying code of G (resp. a locating-dominating code of...
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...
The α-reliable shortest path problem
The α-reliable shortest path problem
2008,
Many real-life applications, arising in transportation and telecommunication systems,...
The computational efficiency of Ji–Lee–Li algorithm for the assignment problem
The computational efficiency of Ji–Lee–Li algorithm for the assignment problem
2008,
Ji et al. have conjectured that using the matrix form (to represent a basic solution)...
Utilizing the surrogate dual bound in capacity planning with economies of scale
Utilizing the surrogate dual bound in capacity planning with economies of scale
2008,
Minimizing a nondecreasing separable concave cost function over a polyhedral set...
Robust evaluations for duals of non-negative linear programs with box-constrained uncertainties
Robust evaluations for duals of non-negative linear programs with box-constrained uncertainties
2008,
Non-negative linear programs with box-constrained uncertainties for all input data and...
On packing rectangles with resource augmentation: maximizing the profit
On packing rectangles with resource augmentation: maximizing the profit
2008,
We consider the problem of packing rectangles with profits into a bounded square...
Global convergence of a primal–dual interior-point method for nonlinear programming
Global convergence of a primal–dual interior-point method for nonlinear programming
2008,
Many recent convergence results obtained for primal–dual interior-point methods...
Alternative decomposition based approaches for assigning disjunctive tasks
Alternative decomposition based approaches for assigning disjunctive tasks
2007,
We consider a special linear assignment problem where some tasks are grouped, and in...
Identifying active manifolds
Identifying active manifolds
2007,
Determining the ‘active manifold’ for a minimization problem is a large...
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors
2007,
In this paper we study the behavior of Convex Quadratic Optimization problems when...
On the approximability of the travelling salesperson problem on local modifications of optimally solved instances
On the approximability of the travelling salesperson problem on local modifications of optimally solved instances
2007,
Given an instance of TSP together with an optimal solution, we consider the scenario...
Branch-and-cut algorithms for winner determination in discount auctions
Branch-and-cut algorithms for winner determination in discount auctions
2007,
Discount auction is a procurement mechanism for buying M indivisible heterogeneous...
Some necessary conditions and a general sufficiency condition for the validity of a Gilmore–Gomory type patching scheme for the traveling salesman problem
Some necessary conditions and a general sufficiency condition for the validity of a Gilmore–Gomory type patching scheme for the traveling salesman problem
2007,
One of the most celebrated polynomially solvable cases of the TSP is the...
The greedy algorithm for the symmetric traveling salesman problem
The greedy algorithm for the symmetric traveling salesman problem
2007,
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and...
‘Binarize and Project’ to generate cuts for general mixed-integer programs
‘Binarize and Project’ to generate cuts for general mixed-integer programs
2007,
We consider mixed-integer linear programs with arbitrary bounded integer variables. We...
Job shop scheduling with unit length tasks: bounds and algorithms
Job shop scheduling with unit length tasks: bounds and algorithms
2007,
We consider the job shop scheduling problem unit–J m , where each job is...
Vertex 3-colorability of claw-free graphs
Vertex 3-colorability of claw-free graphs
2007,
The 3-colorability problem is NP-complete in the class of claw-free graphs. In this...
Hybrid Continuous Interacting Ant Colony aimed at enhanced global optimization
Hybrid Continuous Interacting Ant Colony aimed at enhanced global optimization
2007,
Ant colony algorithms are a class of metaheuristics which are inspired from the...
Papers per page: