Search

Showing total 868 results

Search Constraints

Start Over You searched for: Search Limiters Academic (Peer-Reviewed) Journals Remove constraint Search Limiters: Academic (Peer-Reviewed) Journals Search Limiters Available in Library Collection Remove constraint Search Limiters: Available in Library Collection Topic algorithms Remove constraint Topic: algorithms Publication Year Range More than 50 years ago Remove constraint Publication Year Range: More than 50 years ago Database Complementary Index Remove constraint Database: Complementary Index Database JSTOR Journals Remove constraint Database: JSTOR Journals
868 results

Search Results

5. Thrust and Parry

10. A COMMENT ON A PAPER OF MAXWELL.

13. A PRIMAL ALGORITHM TO SOLVE NETWORK FLOW PROBLEMS WITH CONVEX COSTS.

14. ON NONLINEAR FRACTIONAL PROGRAMMING.

15. ON SOME WORKS OF KANTOROVICH, KOOPMANS AND OTHERS.

16. AN EVALUATION OF THE EMPIRICAL SIGNIFICANCE OF OPTIMAL SEEKING ALGORITHMS IN PORTFOLIO SELECTION.

17. COMMENTS ON A PAPER BY M. L. WOLFSON: 'SELECTING THE BEST LENGTHS TO STOCK'

18. Asymptotic Linear Programming.

19. Letters to the Editor.

20. Some Properties of Generalized Concave Functions.

21. CHANCE CONSTRAINED PROGRAMMING WITH JOINT CONSTRAINTS.

22. DISCOUNTED MARKOV PROGRAMMING IN A PERIODIC PROCESS.

23. THE MULTI-INDEX PROBLEM.

24. Production Planning for a Stochastic Demand Process.

25. The Elementary Redundancy-Optimization Problem: A Case Study in Probabilistic Multiple-Goal Programming.

26. The Optimal Location of Nuclear-Power Facilities in the Pacific Northwest.

27. A Generated Cut for Primal Integer Programming.

28. Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory.

29. A Mathematical Model for Simultaneously Determining the Optimal Brand-Collection and Display-Area Allocation.

30. ON THE MAXIMIZATION OF THE GEOMETRIC MEAN WITH LOGNORMAL RETURN DISTRIBUTION.

31. APPLICATION OF QUASI-INTEGER PROGRAMMING TO THE SOLUTION OF MENU PLANNING PROBLEMS WITH VARIABLE PORTION SIZE.

32. DETERMINATION OF OPTIMUM PACKAGING FREQUENCY OF ITEMS JOINTLY REPLENISHED.

33. SOLVING THE "MARKETING MIX" PROBLEM USING GEOMETRIC PROGRAMMING.

34. The Optimal Control of Partially Observable Markov Processes over a Finite Horizon.

35. The Rearrangement of Items in a Warehouse.

36. Maximal, Lexicographic, and Dynamic Network Flows.

37. The Use of Cuts in Complementary Programming.

38. Solution of the Flowshop-Scheduling Problem with No Intermediate Queues.

39. Management of Seasonal Style-Goods Inventories.

40. AN ALL ZERO-ONE ALGORITHM FOR A CERTAIN CLASS OF TRANSPORTATION PROBLEMS.

41. AN ANALYSIS OF THE M/G/1 QUEUE UNDER ROUND-ROBIN SCHEDULING.

42. DIVISIBLE AND MOVEABLE ACTIVITIES IN CRITICAL-PATH ANALYSIS.

43. OPTIMIZATION OF SERIES-PARALLEL-SERIES NETWORKS.

44. CUTTING-PLANE METHODS WITHOUT NESTED CONSTRAINT SETS.

45. CONSTRAINED NONLINEAR OPTIMIZATION BY HEURISTIC PROGRAMMING.

46. ALGORITHMS FOR OPTIMAL PRODUCTION SCHEDULING AND EMPLOYMENT SMOOTHING.

47. ASSEMBLY-LINE BALANCING--DYNAMIC PROGRAMMING WITH PRECEDENCE CONSTRAINTS.

48. IMPROVED COMBINATORIAL PROGRAMMING ALGORITHMS FOR A CLASS OF ALL-ZERO-ONE INTEGER PROGRAMMING PROBLEMS.

49. A DYNAMIC MODEL FOR BOND PORTFOLIO MANAGEMENT.

50. FINDING THE K SHORTEST LOOPLESS PATHS IN A NETWORK.