Generalized upper bounding techniques
From MaRDI portal
Publication:2528479
DOI10.1016/S0022-0000(67)80015-1zbMath0162.23003MaRDI QIDQ2528479
R. M. Van Slyke, George B. Dantzig
Publication date: 1967
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Dynamic factorization in large-scale optimization, Solving stochastic programs with simple recourse, On solution of multicoupled models, A heuristic for multiple choice programming, Exploiting special structure in Karmarkar's linear programming algorithm, A regularized decomposition method for minimizing a sum of polyhedral functions, Implementing the simplex method as a cutting-plane method, with a view to regularization, Roof duality for polynomial 0–1 optimization, A generalized upper bounding method for doubly coupled linear programs, A projective method for structured nonlinear programs, An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions, Analysis of relaxations for the multi-item capacitated lot-sizing problem, A mofified gub algorithm for solving linear minimax problems, Improved penalty calculations for a mixed integer branch-and-bound algorithm, On the calculation of true and pseudo penalties in multiple choice integer programming, A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, The factorization approach to large-scale linear programming, Integer multicommodity flow problems, Automatic identification of embedded network rows in large-scale optimization models, A cyclical scheduling heuristic for lot sizing with capacity constraints, A generalized upper bounding algorithm for large-scale generalized goal programming problems, A generalized upper bounding approach to a communications network planning problem, Compact LP bases for a class of IP problems, A primal algorithm for solving a capacitated network flow problem with additional linear constraints, Computing bounds for the optimal value in linear programming, Matrix augmentation and partitioning in the updating of the basis inverse, Unimodular matrices of flow problems with additional constraints, A generalisation of variable upper bounding and generalised upper bounding, Linear programming for weighted deviation problems using compact basis techniques, Generalized upper bounding techniques, On a dual method for a specially structured linear programming problem with application to stochastic programming, Detecting embedded pure network structures in LP problems, Computational comparison on the partitioning strategies in multiple choice integer programming, The mixed postman problem, A suboptimization method for interval linear programming: A new method for linear programming, Accelerating the regularized decomposition method for two stage stochastic linear problems, A finite improvement algorithm for the linear complementarity problem, Cutting plane algorithms and state space constrained linear optimal control problems, The linear multiple choice knapsack problem, A primal partitioning approach for single and non-simultaneous multicommodity flow problems, A generalized upper bounded technique for a linear fractional program, Large-scale linear programming: Geometry, working bases and factorizations, Basis properties and algorithmic specializations for GUB transformed networks, Implementations of special ordered sets in MP software, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
Cites Work
