Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases
Pages:30–36
Published Online:February 1, 1973
Mathematical Programs with Optimization Problems in the Constraints
Pages:37–44
Published Online:February 1, 1973
An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach
Pages:45–60
Published Online:February 1, 1973
Heuristic Selection of Advanced Bases for a Class of Linear Programming Models
Pages:90–100
Published Online:February 1, 1973
A Minimax Facility-Configuration Problem Involving Lattice Points
Pages:101–111
Published Online:February 1, 1973
Computation in Discrete Stochastic Programs with Recourse
Pages:112–122
Published Online:February 1, 1973
Concave Programming Applied to a Special Class of 0-1 Integer Programs
Pages:135–140
Published Online:February 1, 1973
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
Pages:156–161
Published Online:February 1, 1973
Computing Optimal Solutions for Infinite-Horizon Mathematical Programs with a Transient Stage
Pages:179–187
Published Online:February 1, 1973
Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
Pages:188–209
Published Online:February 1, 1973
A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
Pages:210–220
Published Online:February 1, 1973
There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
Pages:221–224
Published Online:February 1, 1973
An Algorithm for Globally-Optimal Nonlinear-Cost Multidimensional Flows in Networks and Some Special Applications
Pages:225–239
Published Online:February 1, 1973
Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
Pages:240–246
Published Online:February 1, 1973
An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
Pages:247–260
Published Online:February 1, 1973
Optimal Design of Multiactivity Multifacility Systems by Branch and Bound
Pages:270–283
Published Online:February 1, 1973
An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
Pages:284–295
Published Online:February 1, 1973
An Example of the Application of Nonlinear Programming to Chemical-Process Optimization
Pages:296–304
Published Online:February 1, 1973
Free Access
Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
Pages:321–322
Published Online:February 1, 1973
Free Access
Technical Note—Equivalent Mixed Integer Programming Problems
Pages:323–326
Published Online:February 1, 1973
Free Access
Technical Note—An Application of Witzgall’s Algorithm to a Problem in Radar Signal Design
Pages:326–328
Published Online:February 1, 1973
Free Access
Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms
Pages:328–332
Published Online:February 1, 1973
Free Access
Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
Pages:332–337
Published Online:February 1, 1973
Free Access
Technical Note—Conditions for Global Optimality in Nonlinear Programming
Pages:337–340
Published Online:February 1, 1973
Free Access
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
Pages:340–343
Published Online:February 1, 1973
Free Access
Technical Note—Rationalizing Discrete Programs
Pages:343–345
Published Online:February 1, 1973
Free Access
Technical Note—Bounding Nonconvex Programs by Conjugates
Pages:346–348
Published Online:February 1, 1973
Free Access
Technical Note—The Set-Covering Problem with Equality Constraints
Pages:348–351
Published Online:February 1, 1973
Free Access
Technical Note—The Continuity of the Perturbation Function of a Convex Program
Pages:351–352
Published Online:February 1, 1973
Free Access
Technical Note—The Use of Cuts in Complementary Programming
Pages:353–359
Published Online:February 1, 1973
Free Access
Technical Note—A Class of Nonlinear Chance-Constrained Programming Models with Joint Constraints
Pages:360–364
Published Online:February 1, 1973
Free Access
Technical Note—Maximal Funnel-Node Flow in an Undirected Network
Pages:365–369
Published Online:February 1, 1973
Free Access
Technical Note—On a Duality Theorem for a Nonlinear Programming Problem
Pages:369–370
Published Online:February 1, 1973
Free Access
Technical Note—Comments on the “Classical” Derivation by Taha and Curry of Optimality Conditions in Linear Programming
Pages:371–372
Published Online:February 1, 1973
Free Access
Technical Note—Some Comments on “Linear” Programming with Absolute-Value Functionals
Pages:373–374
Published Online:February 1, 1973
Free Access
Technical Note—A Note on Reinverting the Dantzig-Wolfe Type Decomposed LP Basis
Pages:374–376
Published Online:February 1, 1973
Free Access
Technical Note—Risk Aversion in Stochastic Programming with Recourse
Pages:377–380
Published Online:February 1, 1973
Free Access
Technical Note—Further Necessary Conditions for the Existence of a Solution to the Multi-Index Problem
Pages:380–386
Published Online:February 1, 1973
Free Access
Technical Note—Solutions of a Special Class of Linear Programming Problems
Pages:386–388
Published Online:February 1, 1973
Free Access
Technical Note—Parameterizing an Activity Vector in Linear Programming
Pages:389–390
Published Online:February 1, 1973
Free Access
Technical Note—Explicit Solutions of Interval Linear Programs
Pages:390–393
Published Online:February 1, 1973
Free Access
The 1972 Lanchester Prize—Call for Nominations
Pages:399–399
Published Online:February 1, 1973
