Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Operations Research Letters
Found
1763 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Finding the K shortest hyperpaths using reoptimization
2006,
Pretolani Daniele
We present some reoptimization techniques for computing (shortest) hyperpath weights...
The competitive salesman problem on a network: a worst-case approach
2006,
Averbakh Igor
We provide a complexity analysis of the problem of optimal routing of a server on a...
Augmented Lagrangian function, non-quadratic growth condition and exact penalization
2006,
Yang X.Q.
In this paper, under the assumption that the perturbation function satisfies a growth...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
Popovici Nicolae
The aim of this paper is to emphasize some remarkable properties of multicriteria...
On the robust assignment problem under a fixed number of cost scenarios
2006,
Woeginger Gerhard J.
We investigate the complexity of the min–max assignment problem under a fixed...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
Popovici Nicolae
The aim of this paper is to emphasize some remarkable properties of multicriteria...
Inventory placement in acyclic supply chain networks
2006,
Magnanti Thomas L.
By adding a set of redundant constraints, and by iteratively refining the...
Optimal picking of large orders in carousel systems
2006,
Litvak Nelly
A carousel is an automated ring-shaped warehousing system that rotates either...
Job scheduling, cooperation and control
2006,
Borm Peter
This paper studies one machine job scheduling situations where clients can have more...
Minimizing makespan on a single machine subject to random breakdowns
2006,
Aytug Haldun
We investigate optimal sequencing policies for the expected makespan problem with an...
Scheduling with step-improving processing times
2006,
Woeginger Gerhard J.
We consider the scheduling problem of minimizing the makespan on a single machine with...
Fast neighborhood search for the single machine total weighted tardiness problem
2006,
Orlin James B.
Most successful heuristics for solving I||∑w i T i are based on swap...
On the unimodality of the manufacturer's objective function in the newsvendor model
2006,
Paul Anand
We derive new sufficient conditions for the manufacturer's profit function to be...
Coordination through De Bruijn sequences
2006,
Gossner Olivier
Let (x t ) be an n -periodic sequence in which the first n elements are drawn i.i.d....
Improved approximation of maximum vertex cover
2006,
Nobili Paolo
We provide a new LP relaxation of the maximum vertex cover problem and a...
On the optimal allocation of two active redundancies in a two-component series system
2006,
Zequeira Rmulo I.
Components C 1 and C 2 form a series system. Suppose we can allocate the spare R 1 in...
An improved algorithm for decomposing arc flows into multipath flows
2006,
Kabadi Santosh N.
We consider a multipath maximum flow problem introduced by Kishimoto. The focus is on...
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
2006,
Boland Natashia
A label setting algorithm for solving the Elementary Resource Constrained Shortest...
The robust shortest path problem in series–parallel multidigraphs with interval data
2006,
Kasperski Adam
In this paper the robust shortest path problem in edge series–parallel...
A 2-approximation algorithm for the network substitution problem
2006,
Pisaruk Nicolai N.
The network substitution problem is to substitute an existing network for a new...
Order preserving reductions and polynomial improving paths
2006,
Jacobson Sheldon H.
This paper shows that neighborhood transformations and data-independent order...
Resource augmentation in two-dimensional packing with orthogonal rotations
2006,
Correa Jos R.
We consider the problem of packing two-dimensional rectangles into the minimum number...
The traveling salesman problem with few inner points
2006,
Woeginger Gerhard J.
We propose two algorithms for the planar Euclidean traveling salesman problem. The...
The multiple Traveling Salesman Problem with time windows: vehicle bounds based on precedence graphs
2006,
Krishnamurti Ramesh
Vehicle bounds for the multiple traveling salesman problem with time windows are found...
First Page
22
23
24
25
26
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers