Journal: Algorithmic Operations Research

Found 60 papers in total
Polynomial interior point algorithms for general linear complementarity problems
Polynomial interior point algorithms for general linear complementarity problems
2010,
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems....
Approximating the metric 2-peripatetic salesman problem
Approximating the metric 2-peripatetic salesman problem
2010,
This paper deals with the 2-Peripatetic Salesman Problem for the case where costs...
Sphere methods for linear programming
Sphere methods for linear programming
2010,
The sphere method for solving linear programs operates with only a subset of...
An improved LS (Link State) algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed
An improved LS (Link State) algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed
2010,
In the paper we mainly study the C max problem of scheduling n groups of jobs on n...
Minimum cost flow problem on dynamic multi generative network flows
Minimum cost flow problem on dynamic multi generative network flows
2010,
This paper consists of studies of constructing and modeling Dynamic Multi Generative...
Probabilistic optimization in graph-problems
Probabilistic optimization in graph-problems
2010,
We study a probabilistic optimization model for graph-problems under...
Simple and fast reoptimizations for the Steiner tree problem
Simple and fast reoptimizations for the Steiner tree problem
2009,
We address reoptimization issues for the Steiner tree problem. We assume that an...
Approximable 1-Turn routing problems in all-optical mesh networks
Approximable 1-Turn routing problems in all-optical mesh networks
2009,
In all-optical networks, several communications can be transmitted through the same...
Recoverable robustness for train shunting problems
Recoverable robustness for train shunting problems
2009,
Several attempts have been done in the literature in the last years in order to...
2-Commodity integer network synthesis problem
2-Commodity integer network synthesis problem
2009,
We consider the following 2-commodity, integer network synthesis problem: Given two...
From balls and bins to points and vertices
From balls and bins to points and vertices
2009,
Given a graph G = (V, E) with |V| = n, we consider the following problem. Place m = n...
Generalized traveling salesman problem reduction algorithms
Generalized traveling salesman problem reduction algorithms
2009,
The generalized traveling salesman problem (GTSP) is an extension of the well-known...
A two-period portfolio selection model for asset-backed securitization
A two-period portfolio selection model for asset-backed securitization
2009,
Asset-Backed Securitization (ABS) is a well-stated financial mechanism which allows an...
Solving some multistage robust decision problems with huge implicitly defined scenario trees
Solving some multistage robust decision problems with huge implicitly defined scenario trees
2009,
This paper describes models and solution algorithms for solving robust multistage...
Compatible weights and valid cycles in non-spanning OSPF (open shortest path first) routing patterns
Compatible weights and valid cycles in non-spanning OSPF (open shortest path first) routing patterns
2009,
Many IP (Internet Protocol) networks use OSPF (Open Shortest Path First) for...
Greedy algorithms for on-line set-covering
Greedy algorithms for on-line set-covering
2009,
We study on-line models for the set-covering problem in which items from a ground set...
Approximated MLC (multileaf collimator) shape matrix decomposition with interleaf collision constraint
Approximated MLC (multileaf collimator) shape matrix decomposition with interleaf collision constraint
2009,
Shape matrix decomposition is a subproblem in radiation therapy planning. A given...
Robust selling times in adaptive portfolio management
Robust selling times in adaptive portfolio management
2009,
Traditional techniques in portfolio management rely on the precise knowledge of the...
General form of nonmonotone line search techniques for unconstrained optimization
General form of nonmonotone line search techniques for unconstrained optimization
2009,
By using the forcing function, we proposed a general form of nonmonotone line search...
A solution approach for two-stage stochastic nonlinear mixed integer programs
A solution approach for two-stage stochastic nonlinear mixed integer programs
2009,
This paper addresses the class of nonlinear mixed integer stochastic programming...
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 field...
A combinatorial optimization approach for determining composition and sequence of polymers
A combinatorial optimization approach for determining composition and sequence of polymers
2008,
Polymers are compounds formed by the joining of smaller, often repeating, units linked...
Quadratic binary programming models in computational biology
Quadratic binary programming models in computational biology
2008,
In this paper we formulate four problems in computational molecular biology as...
An exact mathematical programming approach to multiple RNA sequence-structure alignment
An exact mathematical programming approach to multiple RNA sequence-structure alignment
2008,
One of the main tasks in computational biology is the computation of alignments of...
Papers per page: