Pages that link to "Item:Q2528479"

The following pages link to Generalized upper bounding techniques (Q2528479):

Displaying 46 items.

• Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
• The mixed postman problem (Q754753) (← links)
• Basis properties and algorithmic specializations for GUB transformed networks (Q786644) (← links)
• Implementations of special ordered sets in MP software (Q792884) (← links)
• An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions (Q915629) (← links)
• Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
• On solution of multicoupled models (Q1088906) (← links)
• A heuristic for multiple choice programming (Q1089261) (← links)
• Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
• On the calculation of true and pseudo penalties in multiple choice integer programming (Q1183620) (← links)
• A generalisation of variable upper bounding and generalised upper bounding (Q1247367) (← links)
• Linear programming for weighted deviation problems using compact basis techniques (Q1251590) (← links)
• Detecting embedded pure network structures in LP problems (Q1265245) (← links)
• Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
• Accelerating the regularized decomposition method for two stage stochastic linear problems (Q1278964) (← links)
• Dynamic factorization in large-scale optimization (Q1330893) (← links)
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems (Q1569942) (← links)
• A finite improvement algorithm for the linear complementarity problem (Q1823161) (← links)
• The linear multiple choice knapsack problem (Q1825130) (← links)
• Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
• Generalized upper bounding techniques (Q2528479) (← links)
• A suboptimization method for interval linear programming: A new method for linear programming (Q2545859) (← links)
• Cutting plane algorithms and state space constrained linear optimal control problems (Q2550193) (← links)
• A generalized upper bounded technique for a linear fractional program (Q2558161) (← links)
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code (Q3002339) (← links)
• Automatic identification of embedded network rows in large-scale optimization models (Q3315283) (← links)
• A cyclical scheduling heuristic for lot sizing with capacity constraints (Q3330960) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• Solving stochastic programs with simple recourse (Q3710300) (← links)
• A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
• Roof duality for polynomial 0–1 optimization (Q3770279) (← links)
• Improved penalty calculations for a mixed integer branch-and-bound algorithm (Q4079323) (← links)
• The factorization approach to large-scale linear programming (Q4096702) (← links)
• A generalized upper bounding algorithm for large-scale generalized goal programming problems (Q4132245) (← links)
• A generalized upper bounding approach to a communications network planning problem (Q4133436) (← links)
• Compact LP bases for a class of IP problems (Q4135217) (← links)
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints (Q4138506) (← links)
• Computing bounds for the optimal value in linear programming (Q4147869) (← links)
• Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
• Unimodular matrices of flow problems with additional constraints (Q4152313) (← links)
• Integer multicommodity flow problems (Q4645913) (← links)
• On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
• A mofified gub algorithm for solving linear minimax problems (Q4729610) (← links)
• A generalized upper bounding method for doubly coupled linear programs (Q5663641) (← links)
• A projective method for structured nonlinear programs (Q5668258) (← links)