The following pages link to Operations Research Letters (Q96289):
Displaying 50 items.
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities (Q453060) (← links)
- An improved balanced job bound analysis of closed queueing networks (Q578756) (← links)
- Software package for the queueing system \(M^ X/G/1\) (Q579114) (← links)
- A note on detecting simple redundancies in linear systems (Q579125) (← links)
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140) (← links)
- C-programming and the minimization of pseudolinear and additive concave functions (Q579142) (← links)
- On T-joins and odd factors (Q579278) (← links)
- An on-line assignment problem with random effectiveness and costly information (Q581216) (← links)
- Sums of increasing convex and increasing concave functions (Q581222) (← links)
- A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- A robust nonparametric procedure to estimate response functions for binary choice models (Q583768) (← links)
- On confidence intervals for cyclic regenerative processes (Q584843) (← links)
- On the property of eigenvalues of some infinitesimal generator (Q584845) (← links)
- Accrual capital gains taxation and the lock-in effect (Q593959) (← links)
- State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors (Q593977) (← links)
- Yet another geometric programming dual algorithm (Q593984) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- Three person Baccarat (Q593995) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- Performance of an unscheduled shuttle system with two classes of vehicles (Q594759) (← links)
- Traffic assignment in communication satellites (Q594769) (← links)
- A branch and search algorithm for a class of nonlinear knapsack problems (Q594771) (← links)
- On detection of linear and nonlinear optimization problems (Q594778) (← links)
- Comparison conjectures about the M/G/s queue (Q595276) (← links)
- Continuous versions of the queuing formulas L=lambdaW and H=lambdaG (Q595278) (← links)
- Nursing care demand prediction based on a decomposed semi-Markov population model (Q595513) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- Polynomial time solvability of non-symmetric semidefinite programming (Q613324) (← links)
- A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
- Existence, uniqueness, and convergence of the regularized primal-dual central path (Q613327) (← links)
- Stationary point conditions for the FB merit function associated with symmetric cones (Q613328) (← links)
- Greedy vacancy search algorithm for packing equal circles in a square (Q613329) (← links)
- A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm (Q613330) (← links)
- An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Bounded delay packet scheduling in a bounded buffer (Q613334) (← links)
- Stable routing under the Spanning Tree Protocol (Q613335) (← links)
- A note on ``Efficient feasibility testing for dial-a-ride problems'' (Q613336) (← links)
- Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
- Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs (Q613341) (← links)
- Queue inference from periodic reporting data (Q613342) (← links)
