A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.
Page 1 Next
Displaying 1 – 20 of 302
A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
Guntram Scheithauer, Johannes Terno (1995)
Applicationes Mathematicae
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
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
A comparative study of redundant constraints identification methods in linear programming problems.
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
A computational approach to pivot selection in the LP relaxation of set problems.
Djannaty, F., Rostamy, B. (2006)
Journal of Applied Mathematics and Decision Sciences
A conjugate direction method for approximating the analytic center of a polytope.
Kojima, Masakazu, Megiddo, Nimrod, Mizuno, Shinji (1998)
Journal of Inequalities and Applications [electronic only]
A convergent algorithm for solving linear programs with an additional reverse convex constraint
Lê Dung Muu (1985)
Kybernetika
A Counterexample to Greenberg's Algorithm for Solving Linear Inequalities.
B.F. Sherman (1976/1977)
Numerische Mathematik
A Decision Support System for Farm Regional Planning
I. Papathanasiou, B. Manos, Μ. Vlachopoulou, I. Vassiliadou (2005)
The Yugoslav Journal of Operations Research
A Decomposition of 2-Weak Vertex-Packing Polytopes.
E. Steingrimsson (1994)
Discrete & computational geometry
A disjunctive linear fractional max-min problem
Patkar, Vivek, Stancu-Minasian, I.M. (1991)
Portugaliae mathematica
A dual approach to solving linear inequalities by unconstrained quadratic optimization.
Popescu, Elena (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2009)
The Yugoslav Journal of Operations Research
A dual feasible forest algorithm for the linear assignment problem
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
A Duality Theorem for Infinite Dimensional Improper Mathematical Programming Problems
Anatolly Anatolijevich Vatolin (1996)
The Yugoslav Journal of Operations Research
A generalized Markov decision process
Gary J. Koehler (1980)
RAIRO - Operations Research - Recherche Opérationnelle
A Generalized Upper Bounded Technique for a Linear Fractional Program.
S.S. Chadha (1973)
Metrika
A linear assignment formulation of the multiattribute decision problem
Jean-Marie Blin (1976)
RAIRO - Operations Research - Recherche Opérationnelle
A linear programming based analysis of the CP-rank of completely positive matrices
Yingbo Li, Anton Kummert, Andreas Frommer (2004)
International Journal of Applied Mathematics and Computer Science
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
Jean-Pierre Crouzeix, Bachir Merikhi (2008)
RAIRO - Operations Research
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.
Currently displaying 1 – 20 of 302
Page 1 Next