Journal: Operations Research Letters

Found 1763 papers in total
Finding 2-edge connected spanning subgraphs
Finding 2-edge connected spanning subgraphs
2004,
This paper studies the NP-hard problem of finding a minimum size 2-edge connected...
Local approximations for maximum partial subgraph problem
Local approximations for maximum partial subgraph problem
2004,
We deal with MAX H 0 -FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum...
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
2004,
We propose a fully polynomial bicriteria approximation scheme for the constrained...
Reliability analysis of a renewable multiple cold standby system
Reliability analysis of a renewable multiple cold standby system
2004,
We present a general reliability analysis of the basic multiple cold standby system...
Worst-case analysis of the subset sum algorithm for bin packing
Worst-case analysis of the subset sum algorithm for bin packing
2004,
We analyze the worst-case ratio of a natural heuristic for the bin packing problem,...
Dependence structure of sojourn times via partition separated ordering
Dependence structure of sojourn times via partition separated ordering
2003,
We investigate the joint distribution of successive sojourn times of a customer...
On the ring loading problem with demand splitting
On the ring loading problem with demand splitting
2004,
In this paper, we improve the rerouting step of Myung, Kim and Tcha's algorithm for...
Flood search under the California Split rule
Flood search under the California Split rule
2004,
We consider flood search on a line and show that no algorithm can achieve an...
Material compatibility constraints for make-to-order production planning
Material compatibility constraints for make-to-order production planning
2003,
This paper defines a set of material compatibility constraints for use in order...
Continuous benchmark solutions
Continuous benchmark solutions
2004,
The existence of benchmark selections that are continuous both in production factors...
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
2004,
Quite recently Fujishige developed a weakly polynomial-time algorithm for the maximum...
Allocating electricity transmission costs through tracing: a game-theoretic rationale
Allocating electricity transmission costs through tracing: a game-theoretic rationale
2004,
Tracing is a method of assigning flows in an electricity network to particular...
Sorting weighted distances with applications to objective function evaluations in single facility location problem
Sorting weighted distances with applications to objective function evaluations in single facility location problem
2004,
We consider single facility location problems on rectilinear spaces and spaces induced...
Randomized on-line scheduling on three processors
Randomized on-line scheduling on three processors
2004,
We consider a randomized on-line scheduling problem where each job has to be scheduled...
Improved lower bounds for the capacitated lot sizing problem with setup times
Improved lower bounds for the capacitated lot sizing problem with setup times
2004,
We present new lower bounds for the capacitated lot sizing problem, applying...
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Preemptive scheduling of equal-length jobs to maximize weighted throughput
2004,
We study the problem of computing a preemptive schedule of equal-length jobs with...
On the complexity of the primal self-concordant barrier method
On the complexity of the primal self-concordant barrier method
2003,
The theory of self-concordance, initiated by Nesterov and Nemirovskii, has become very...
Lexicographic balanced optimization problems
Lexicographic balanced optimization problems
2004,
We introduce the lexicographic balanced optimization problem (LBaOP) and show that it...
The expected length of a random line segment in a rectangle
The expected length of a random line segment in a rectangle
2004,
We calculate the expected length of a random line segment in a rectangle, using a line...
Mean sample spacings, sample size and variability in an auction-theoretic framework
Mean sample spacings, sample size and variability in an auction-theoretic framework
2004,
In terms of a standard model for English auctions and sealed-bid auctions, we study...
Solving linear fractional bilevel programs
Solving linear fractional bilevel programs
2004,
In this paper, we prove that an optimal solution to the linear fractional bilevel...
On the directed hop-constrained shortest path problem
On the directed hop-constrained shortest path problem
2004,
In this paper we discuss valid inequalities for the directed hop-constrained shortest...
A note on maximizing a submodular set function subject to a knapsack constraint
A note on maximizing a submodular set function subject to a knapsack constraint
2004,
In this paper, we obtain an (1-e -1 )-approximation algorithm for maximizing a...
Integer programming, Barvinok's counting algorithm and Gomory relaxations
Integer programming, Barvinok's counting algorithm and Gomory relaxations
2004,
We propose an algorithm based on Barvinok's counting algorithm for P...
Papers per page: