Modifying the Forrest-Tomlin and Saunders Updates for Linear Programming Problems With Variable Upper Bounds

Annals of Operations Research - Netherlands
doi 10.1007/bf02739236
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Valid Inequalities for Problems With Additive Variable Upper Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Improved Semidefinite Programming Bounds for Quadratic Assignment Problems With Suitable Symmetry

Mathematical Programming, Series B
MathematicsSoftware
2010English

New Upper Bounds for Kissing Numbers From Semidefinite Programming

Journal of the American Mathematical Society
MathematicsApplied Mathematics
2008English

Linear Programming Bounds for Codes via a Covering Argument

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

Suboptimality Bounds for Linear Quadratic Problems in Hybrid Linear Systems

2013English

Backward Perturbation Bounds for Linear Least Squares Problems

SIAM Journal on Matrix Analysis and Applications
Analysis
1998English

Algorithms for Solving Non-Linear Programming Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1975English

Generalized Upper Bounded Techniques for Linear Programming - I

1964English

New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy