default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 11
Volume 11, Number 1, February 1992
- Maurice Queyranne, Yaoguang Wang:
On the convex hull of feasible solutions to certain combinatorial problems. 1-11 - El Houssaine Aghezzaf
, Laurence A. Wolsey:
Lot-sizing polyhedra with a cardinality constraint. 13-18 - Béla Bollobás, Amram Meir:
A travelling salesman problem in the k-dimensional unit cube. 19-21 - Tomas Gal, Ferdinand Geue:
A new pivoting rule for solving various degeneracy problems. 23-32 - Rolando Cavazos-Cadena, Linn I. Sennott:
Comparing recent assumptions for the existence of average optimal stationary policies. 33-37 - J. A. Hoogeveen, Steef L. van de Velde:
A new lower bound approach for single-machine multicriteria scheduling. 39-44 - François Margot:
Quick updates for p-opt TSP heuristics. 45-46 - Jian-Qiang Hu:
Variance properties of sample path derivatives of parametric random variables. 47-54 - Guillermo Gallego:
A minmax distribution free procedure for the (Q, R) inventory model. 55-60 - Panagiotis Kouvelis, Robert C. Carlson:
Total unimodularity applications in bi-objective discrete optimization. 61-65
Volume 11, Number 2, March 1992
- Alberto Marchetti-Spaccamela, Wan Soo Rhee, Leen Stougie, Sara A. van de Geer:
Probabilistic analysis of the minimum weighted flowtime scheduling problem. 67-71 - Chung-Yee Lee, Reha Uzsoy:
A new dynamic programming algorithm for the parallel machines total weighted completion time problem. 73-75 - Wolfgang Stadje, Dror Zuckerman:
Optimal repair policies with general degree of repair in two maintenance models. 77-80 - Suvrajeet Sen:
Relaxations for probabilistically constrained programs with discrete random variables. 81-86 - Daniel Granot, Dror Zuckerman:
Training and job search in the labor market. 87-92 - Bahman Kalantari:
Generalization of Karmarkar's algorithm to convex homogeneous functions. 93-98 - Mrinal K. Ghosh, Steven I. Marcus:
On strong average optimality of markov decision processes with unbounded costs. 99-104 - Monique Laurent, Antonio Sassano:
A characterization of knapsacks with the max-flow- - min-cut property. 105-110 - John S. Rose:
The newsboy with known demand and uncertain replenishment: Applications to quality control and container fill. 111-117 - Panos M. Pardalos, Somesh Jha:
Complexity of uniqueness and local search in quadratic 0-1 programming. 119-123
Volume 11, Number 3, April 1992
- Alain Prodon:
Steiner trees with n terminals among n + 1 nodes. 125-133 - Frieda Granot, Michal Penn:
On the integral plane two-commodity flow problem. 135-139 - Luís Alfredo V. de Carvalho, Valmir C. Barbosa:
Fast linear system solution by neural networks. 141-145 - Carlton Scott, Christopher S. Tang:
Separable convex programs with ratio constraints over a directed tree. 147-152 - Laurence A. Baxter, Farid Harche:
On the optimal assembly of series-parallel systems. 153-157 - Zhi-Quan Luo, Paul Tseng:
On a global error bound for a class of monotone affine variational inequality problems. 159-165 - Evangelos Triantaphyllou:
A sensitivity analysis of a (ti, Si) inventory policy with increasing demand. 167-172 - Walter A. Rosenkrantz, Rahul Simha:
Some theorems on conditional Pasta: A stochastic integral approach. 173-177 - Qiu-Sheng Liu, Katsuhisa Ohno, Ushio Sumita:
Structural properties of optimal tool replacement policy in a machining center. 179-185 - K. Jo Min:
Inventory and quantity discount pricing policies under profit maximization. 187-193
Volume 11, Number 4, May 1992
- John R. Birge, Robert M. Freund, Robert J. Vanderbei:
Prior reduced fill-in in solving equations in interior point algorithms. 195-198 - Michael J. Todd, Jean-Philippe Vial:
Todd's low-complexity algorithm is a predictor-corrector path-following method. 199-207 - Kurt M. Anstreicher:
On interior algorithms for linear programming with no regularity assumptions. 209-212 - David F. Shallcross:
A polynomial algorithm for a one machine batching problem. 213-218 - Olivier C. Martin, Steve W. Otto, Edward W. Felten:
Large-step markov chains for the TSP incorporating local search heuristics. 219-224 - Jihong Ou, Lawrence M. Wein:
On the improvement from scheduling a two-station queueing network in heavy traffic. 225-232 - Xiao-Gao Liu, John A. Buzacott:
The reversibility of cyclic queues. 233-241 - George S. Fishman, David S. Rubin:
Bounding the variance in Monte Carlo experiments. 243-248 - Ferenc Gyetvàn, Yong Shi:
Weak duality theorem and complementary slackness theorem for linear matrix programming problems. 249-253 - Levent Tunçel, Peter L. Jackson:
On the convexity of a function related to the Wagner-Whitin model. 255-259
Volume 11, Number 5, June 1992
- Chris N. Potts, Luk N. Van Wassenhove:
Approximation algorithms for scheduling a single machine to minimize total late work. 261-266 - Moshe Haviv, Martin L. Puterman:
Estimating the value of a discounted reward process. 267-272 - Antoine Gautier, Frieda Granot:
A parametric analysis of a nonlinear asset allocation management model. 273-279 - János Csirik, Hans Kellerer, Gerhard J. Woeginger:
The exact LPT-bound for maximizing the minimum completion time. 281-287 - Jishan Zhu, Siming Huang:
On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm. 289-291 - Christian Larsen, Jørgen Tind:
Lagrangean duality for facial programs with applications to integer and complementarity problems. 293-302 - Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. 303-308 - Maw-Sheng Chern:
On the computational complexity of reliability redundancy allocation in a series system. 309-315 - Yaakov Kogan:
Another approach to asymptotic expansions for large closed queueing networks. 317-321 - Nico M. van Dijk:
A note on monotonicity results in multicasting. 323-328
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
