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