Journal: Operations Research Letters

Found 1763 papers in total
Markov decision processes with exponentially representable discounting
Markov decision processes with exponentially representable discounting
2009,
We generalize the geometric discount of finite discounted cost Markov Decision...
Vehicle routing problems on a line-shaped network with release time constraints
Vehicle routing problems on a line-shaped network with release time constraints
2009,
This work considers the vehicle routing problem on a line with the constraint that...
Improved analysis of an algorithm for the coupled task problem with UET (unit execution time) jobs
Improved analysis of an algorithm for the coupled task problem with UET (unit execution time) jobs
2009,
The coupled task problem is to schedule n jobs, each one consisting of two subtasks...
A cost-sharing method for an economic lot-sizing game
A cost-sharing method for an economic lot-sizing game
2009,
We present a cost-sharing method that is competitive, cross-monotonic and approximate...
Cutting plane algorithms for the inverse mixed integer linear programming problem
Cutting plane algorithms for the inverse mixed integer linear programming problem
2009,
We present cutting plane algorithms for the inverse mixed integer linear programming...
Scheduling with a minimum number of machines
Scheduling with a minimum number of machines
2009,
We investigate the scheduling problem with release dates and deadlines on a minimum...
On first passage times of a hyper-exponential jump diffusion process
On first passage times of a hyper-exponential jump diffusion process
2009,
We investigate some important probabilistic properties relating to the first passage...
A compact formulation of the ring loading problem with integer demand splitting
A compact formulation of the ring loading problem with integer demand splitting
2009,
The ring loading problem with integer demand splitting is that of routing κ...
A fast local search method for minimum energy broadcast in wireless ad hoc networks
A fast local search method for minimum energy broadcast in wireless ad hoc networks
2009,
Local search methods are often used to reduce the power consumption of broadcast...
The stochastic p-median problem with unknown cost probability distribution
The stochastic p-median problem with unknown cost probability distribution
2009,
We want to find the location of p facilities which minimize the expected total cost,...
Average-case approximation ratio of the 2-opt algorithm for the TSP
Average-case approximation ratio of the 2-opt algorithm for the TSP
2009,
We show that the 2-opt heuristic for the traveling salesman problem achieves an...
Fast convergence to state-action frequency polytopes for Markov Decision Processes
Fast convergence to state-action frequency polytopes for Markov Decision Processes
2009,
In the context of finite weakly communicating Markov Decision Processes, we tackle the...
Single-source k-splittable min-cost flows
Single-source k-splittable min-cost flows
2009,
Motivated by a famous open question on the single-source unsplittable minimum cost...
A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
2009,
An algorithm called DE-PSO is proposed which incorporates concepts from DE and PSO,...
The hardness of train rearrangements
The hardness of train rearrangements
2009,
We derive several results on the computational complexity of train rearrangement...
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
2009,
We show that in an optimal solution of the economic lot-sizing problem the total...
Hardness of lazy packing and covering
Hardness of lazy packing and covering
2009,
We prove APX-hardness for the two problems maximum resource bin packing and lazy bin...
On improving optimal oblivious routing
On improving optimal oblivious routing
2009,
In this paper a generalization of the robust network design problem with oblivious...
On competitiveness in uniform utility allocation markets
On competitiveness in uniform utility allocation markets
2009,
We call a market competitive if increasing the endowment of one buyer does not...
A dynamic programming algorithm for the bilevel knapsack problem
A dynamic programming algorithm for the bilevel knapsack problem
2009,
We propose an efficient dynamic programming algorithm for solving a bilevel program...
Existence and computation of optimal tolls in multiclass network equilibrium problems
Existence and computation of optimal tolls in multiclass network equilibrium problems
2009,
In this work we provide a simple proof of the existence of optimal tolls for...
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
2009,
We describe a polynomial-size conic quadratic reformulation for a machine-job...
An edge-reduction algorithm for the vertex cover problem
An edge-reduction algorithm for the vertex cover problem
2009,
An approximation algorithm for the vertex cover problem is proposed with performance...
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
2009,
We consider an APX-hard variant (Δ-Max-ATSP) and an APX-hard relaxation...
Papers per page: