Journal: Operations Research Letters

Found 1763 papers in total
On dual integrality in matching problems
On dual integrality in matching problems
1989,
Edmonds and Johnson proved an integrality property of optimal dual solutions of...
New expressions for the extended ℝ-Y reductions
New expressions for the extended ℝ-Y reductions
1989,
Reliability-preserving reductions are important for the efficient computation of the...
Efficient solution of the matroid product problem
Efficient solution of the matroid product problem
1989,
The matroid product problem is to find a base of a matroid which maximizes the product...
On the spanning tree polyhedron
On the spanning tree polyhedron
1989,
Fulkerson characterized the blocking matrix to the incidence matrix of all spanning...
On the core of a traveling salesman cost allocation game
On the core of a traveling salesman cost allocation game
1989,
Let G=(V,E) be a connected undirected graph with positive edge lengths. Let...
Total domination in block graphs
Total domination in block graphs
1989,
A set of vertices D is a dominating set for a graph G=(V,E) if every vertex in V-D is...
On the expected number of assignments in reduced matrices for the linear assignment problem
On the expected number of assignments in reduced matrices for the linear assignment problem
1989,
A linear n×n assignment problem is considered for which the elements of the cost...
An algorithm for the multiprocessor assignment problem
An algorithm for the multiprocessor assignment problem
1989,
An exhaustive search algorithm is presented for the assignment of tasks to processors...
An edge elimination test for the Steiner Problem in graphs
An edge elimination test for the Steiner Problem in graphs
1989,
It is known that before actually solving the Steiner Problem in graphs, reduction...
A note on order preserving matchings
A note on order preserving matchings
1989,
The authors study order preserving injections or bipartite matchings from poset V 1 to...
Finding the most vital arcs in a network
Finding the most vital arcs in a network
1989,
Let be a directed, arc weighted network with node set V and arc set A . Associated...
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
1989,
Shuffle-exchange networks have received a great deal of attention as interconnecting...
Bounding the expected time-cost curve for a stochastic PERT network flow
Bounding the expected time-cost curve for a stochastic PERT network flow
1989,
Based on some earlier work by Wollmer on how to approximate the expected time-cost...
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
1989,
The polyhedral structure of the convex hull of regions is investigated defined by a...
Submodularity and valid inequalities in capacitated fixed charge networks
Submodularity and valid inequalities in capacitated fixed charge networks
1989,
Using a submodular inequality, and the observation that the flow values in capacitated...
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
1989,
Determining efficient sequences of X-ray diffraction measurements on a four-circle...
The k most vital arcs in the shortest path problem
The k most vital arcs in the shortest path problem
1989,
The k most vital arcs in a network are those whose removal from the network results in...
An augmented Lagrangian decomposition method for block diagonal linear programming problems
An augmented Lagrangian decomposition method for block diagonal linear programming problems
1989,
A new decomposition method for large linear programming problems of angular structure...
On the ℝà-perturbation method for avoiding degeneracy
On the ℝà-perturbation method for avoiding degeneracy
1989,
Although it is NP-complete to decide whether a linear programming problem is...
Average cost expansion sequencing
Average cost expansion sequencing
1989,
The paper derives necessary and sufficient conditions for the optimality of a...
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
1989,
An O(n) time algorithm for the projection of a vector is presented on the simplex of...
A new algorithm to find all vertices of a polytope
A new algorithm to find all vertices of a polytope
1989,
This paper presents a new algorithm to find all the vertices of a polytope using a...
Linear programming brings marital bliss
Linear programming brings marital bliss
1989,
A stable matching is an assignment of n men to n women so that no two people prefer...
On simultaneous approximation in quadratic integer programming
On simultaneous approximation in quadratic integer programming
1989,
It is shown how to replace the objective function of an integer quadratic programming...
Papers per page: