Journal: Operations Research Letters

Found 1763 papers in total
Elementary closures for integer programs
Elementary closures for integer programs
2001,
In integer programming, the elementary closure associated with a family of cuts is the...
Two simple proofs for analyticity of the central path in linear programming
Two simple proofs for analyticity of the central path in linear programming
2001,
Several papers have appeared recently establishing the analyticity of the central path...
On mixed-integer zero–one representations for separable lower-semicontinuous piecewise-linear functions
On mixed-integer zero–one representations for separable lower-semicontinuous piecewise-linear functions
2001,
In a recent paper, Padberg has provided some insights into constructing locally ideal...
Shortest paths in almost acyclic graphs
Shortest paths in almost acyclic graphs
2000,
This paper presents an algorithm for the shortest-path problem on a directed graph...
A probabilistic result for the max-cut problem on random graphs
A probabilistic result for the max-cut problem on random graphs
2000,
We consider the max-cut problem on a random graph G with n vertices and weights w ij...
Maximum dispersion problem in dense graphs
Maximum dispersion problem in dense graphs
2000,
In this note, we present a polynomial-time approximation scheme for a ‘dense...
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
1999,
In this paper, we consider the Fixed Charge Network Flow Problem (FCNFP) which is...
On the condition numbers for polyhedra in Karmarkar's form
On the condition numbers for polyhedra in Karmarkar's form
1999,
We present formulations of two condition measures (one for linear programming (LP) due...
Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions
Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions
1999,
Konno, introduced a piecewise linear objective function for portfolio optimization to...
New facets for the set packing polytope
New facets for the set packing polytope
2000,
We introduce a family of graphs, named grilles, and a facet of the set packing...
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
2000,
This paper shows that the minimum ratio canceling algorithm of Wallacher (and a faster...
Why the logarithmic barrier function in convex and linear programming?
Why the logarithmic barrier function in convex and linear programming?
2000,
We provide a simple interpretation of the use of the logarithmic barrier function in...
A tight upper bound for the k-partition problem on ideal sets
A tight upper bound for the k-partition problem on ideal sets
1999,
This paper analyzes an approximation algorithm (Graham's LPT rule) for the NP-complete...
Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility
Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility
2000,
We consider two models of M/G/ 1 and G/M/ 1 type queueing systems with restricted...
Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process
Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process
2000,
In this paper, we propose a queueing model based on an integer-valued first-order...
An improved general procedure for lexicographic bottleneck problems
An improved general procedure for lexicographic bottleneck problems
1999,
In combinatorial optimization, the bottleneck (or minmax) problems are those problems...
An efficient heuristic for inventory control when the customer is using a (s,S) policy
An efficient heuristic for inventory control when the customer is using a (s,S) policy
2001,
We consider a capacitated supply chain in which the supplier has the information of...
A family of facets for the uncapacitated p-median polytope
A family of facets for the uncapacitated p-median polytope
2001,
We present a nontrivial family of facet-defining inequalities for the uncapacitated p...
Bayesian optimization and genericity
Bayesian optimization and genericity
1997,
We show that in almost all decisions under uncertainty Bayesian optimization...
On closed-form solutions of a resource allocation problem in parallel funding of R&D projects
On closed-form solutions of a resource allocation problem in parallel funding of R&D projects
2000,
In order to reduce the risk of complete failure, research managers often adopt a...
An algorithm for finding a maximum clique in a graph
An algorithm for finding a maximum clique in a graph
1997,
This paper introduces a branch-and-bound algorithm for the maximum clique problem...
Faster approximation algorithms for weighted triconnectivity augmentation problems
Faster approximation algorithms for weighted triconnectivity augmentation problems
1997,
The problem of finding a minimum-weight augmenting edge-set to make a graph 3-vertex...
A new and improved algorithm for the 3-cut problem
A new and improved algorithm for the 3-cut problem
1997,
We present a O( mn 3 ) time exact algorithm for finding a minimum 3-cut in an...
Semi on-line algorithms for the partition problem
Semi on-line algorithms for the partition problem
1997,
The partition problem is one of the basic NP-complete problems. While an efficient...
Papers per page: