A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.
A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
A comparative study of redundant constraints identification methods in linear programming problems.
A computational approach to pivot selection in the LP relaxation of set problems.
A conjugate direction method for approximating the analytic center of a polytope.
A convergent algorithm for solving linear programs with an additional reverse convex constraint
A Counterexample to Greenberg's Algorithm for Solving Linear Inequalities.
A Decision Support System for Farm Regional Planning
A Decomposition of 2-Weak Vertex-Packing Polytopes.
A disjunctive linear fractional max-min problem
A dual approach to solving linear inequalities by unconstrained quadratic optimization.
A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
A dual feasible forest algorithm for the linear assignment problem
A Duality Theorem for Infinite Dimensional Improper Mathematical Programming Problems
A generalized Markov decision process
A Generalized Upper Bounded Technique for a Linear Fractional Program.
A linear assignment formulation of the multiattribute decision problem
A linear programming based analysis of the CP-rank of completely positive matrices
A real matrix A is said to be completely positive (CP) if it can be decomposed as A = BB^T, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Φ_k the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank...
A logarithm barrier method for semi-definite programming
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical line-searches.