Journal: Operations Research Letters

Found 1763 papers in total
The 2-hop spanning tree problem
The 2-hop spanning tree problem
1998,
A spanning tree in a graph G where each node has distance at most 2 from a root node r...
Calculation of stability radii for combinatorial optimization problems
Calculation of stability radii for combinatorial optimization problems
1998,
We present algorithms to calculate the stability radius of optimal or approximate...
Separating subdivision of bicycle wheel inequalities over cut polytopes
Separating subdivision of bicycle wheel inequalities over cut polytopes
1998,
In this paper, we give a separation algorithm for a class of valid inequalities for...
The complexity of cover inequality separation
The complexity of cover inequality separation
1998,
Crowder et al . conjectured that the separation problem for cover inequalities for...
On the decomposition of value functions
On the decomposition of value functions
1998,
This paper provides a mathematical framework for the decomposition of value functions...
A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
1998,
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation...
On a class of approximations for ruin and waiting time probabilities
On a class of approximations for ruin and waiting time probabilities
1998,
A generalized class of Tijms-type approximations for ruin and waiting time...
An O(pn2) algorithm for the p-median and related problems on tree graphs
An O(pn2) algorithm for the p-median and related problems on tree graphs
1996,
We improve the complexity bound of the p-median problem on trees by showing that the...
On minimal cost–reliability ratio spanning trees and related problems
On minimal cost–reliability ratio spanning trees and related problems
1996,
The minimal cost–reliability ratio spanning tree problem is to find a spanning...
K-edge connected polyhedra on series-parallel graphs
K-edge connected polyhedra on series-parallel graphs
1996,
We give a complete description of the k-edge connected spanning subgraph polytope (for...
Submodular containment is hard, even for networks
Submodular containment is hard, even for networks
1996,
Suppose that we have two submodular base polyhedra in the same space. What is the...
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
1998,
A dynamic network consists of a directed graph with a source s, a sink t and...
A fast bipartite network flow algorithm for selective assembly
A fast bipartite network flow algorithm for selective assembly
1998,
Bipartite network flow problems naturally arise in applications such as selective...
Efficient continuous-time dynamic network flow algorithms
Efficient continuous-time dynamic network flow algorithms
1998,
We extend discrete-time dynamic flow algorithms presented in the literature to solve...
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
1998,
The assumption that different operations of a given job cannot be processed...
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
2000,
We consider a generalized version of the classical parallel machine scheduling...
Randomized online interval scheduling
Randomized online interval scheduling
1998,
Online interval scheduling problems arise in important application areas such as...
Optimal coordination strategies for production and marketing decisions
Optimal coordination strategies for production and marketing decisions
1998,
This study develops general optimal coordination strategies for short-term production...
A comment on a minmax location problem
A comment on a minmax location problem
1998,
In a recent paper Hamacher and Schobel study a minmax location problem in the...
Optimal facility layout design
Optimal facility layout design
1998,
The facility layout problem (FLP) is a fundamental optimization problem encountered in...
The berth planning problem
The berth planning problem
1998,
Singapore has one of the busiest ports in the world. Berth planning is one of the...
On the convergence of the decoupling algorithm for multiperiod equilibrium models
On the convergence of the decoupling algorithm for multiperiod equilibrium models
1998,
We examine two alternative approaches to solving sequences of mathematical programs...
A simple approach to the product rate variation problem via axiomatic methods
A simple approach to the product rate variation problem via axiomatic methods
1998,
New simple solutions are provided for minimizing the variation of production rates in...
A superlinearly convergent projection algorithm for solving the convex inequality problem
A superlinearly convergent projection algorithm for solving the convex inequality problem
1998,
The Convex Inequality Problem (CIP), i.e., find x ∈ R n such that Ax = b, g(x)...
Papers per page: