Journal: Operations Research Letters

Found 1763 papers in total
On the structure and complexity of the 2-connected Steiner network problem in the plane
On the structure and complexity of the 2-connected Steiner network problem in the plane
2000,
We consider the problem of finding a minimum Euclidean length graph 2-connecting a set...
Sparse certificates and removable cycles in l-mixed p-connected graphs
Sparse certificates and removable cycles in l-mixed p-connected graphs
2005,
A graph G=(V,E) is called l -mixed p -connected if G-S-L is connected for all...
Approximating k-hop minimum-spanning trees
Approximating k-hop minimum-spanning trees
2005,
Given a complete graph on ∼ n nodes with metric edge costs, the minimum-cost k...
On the average sojourn time under M/M/1/SRPT
On the average sojourn time under M/M/1/SRPT
2005,
We study an M/M/1 queueing system under the shortest remaining processing time (SRPT)...
On approximation of the submodular set cover problem
On approximation of the submodular set cover problem
1999,
We design a primal–dual heuristic for the submodular set cover problem and...
A note on policy algorithms for discounted Markov decision problems
A note on policy algorithms for discounted Markov decision problems
1999,
In this note, we show that the evaluation phase in the policy iteration algorithm for...
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
2000,
This paper studies the classification problem of Markov processes of M/G/1 type with a...
A fast algorithm for the transient reward distribution in continuous-time Markov chains
A fast algorithm for the transient reward distribution in continuous-time Markov chains
2000,
This note presents a generally applicable discretization method for computing the...
A new scaling algorithm for the minimum cost network flow problem
A new scaling algorithm for the minimum cost network flow problem
1999,
In this paper, we present a new polynomial time algorithm for solving the minimum cost...
Simplicial with truncated Dantzig–Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
Simplicial with truncated Dantzig–Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
2000,
The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network...
An algorithm for the hierarchical Chinese postman problem
An algorithm for the hierarchical Chinese postman problem
2000,
The Hierarchical Chinese Postman Problem (HCPP) is a variant of the classical Chinese...
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
2005,
We study a two-phase, budget-constrained, network-planning problem with multiple hub...
Note on a paper of Broyden
Note on a paper of Broyden
1999,
Recently, Broyden proved a property of orthogonal matrices from which he derived...
A variable target value method for nondifferentiable optimization
A variable target value method for nondifferentiable optimization
2000,
This paper presents a new Variable target value method (VTVM) that can be used in...
Linear-shaped partition problems
Linear-shaped partition problems
2000,
We establish the polynomial-time solvability of a class of vector partition problems...
Bounds for global optimization of capacity expansion and flow assignment problems
Bounds for global optimization of capacity expansion and flow assignment problems
2000,
This paper provides new bounds related to the global optimization of the problem of...
The best-choice problem for partially ordered objects
The best-choice problem for partially ordered objects
1999,
We consider the problem of making a single on-line selection from a random sequence of...
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
2000,
The well-studied 0/1 Knapsack and Subset-Sum problem are maximization problems that...
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
Valid integer polytope (VIP) penalties for branch-and-bound enumeration
2000,
We introduce new penalties, called valid integer polytope (VIP) penalties, that...
Linear-time-approximation algorithms for bin packing
Linear-time-approximation algorithms for bin packing
2000,
Simchi–Levi proved that the famous bin packing algorithms FF and BF have an...
Using xQx to model and solve the uncapacitated task allocation problem
Using xQx to model and solve the uncapacitated task allocation problem
2005,
This paper illustrates how large instances of the unconstrained task allocation...
Computational results with a primal–dual subproblem simplex method
Computational results with a primal–dual subproblem simplex method
1999,
The two main ideas implemented are a primal–dual subproblem simplex method and a...
Forward chaining is simple (x)
Forward chaining is simple (x)
2000,
We show that Forward Chaining in Horn Systems is merely the Simplex Algorithm,...
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
2000,
While properties of the weighted central path for linear and non-linear programs have...
Papers per page: