Results 1  10
of
291,655
Minimax Programs
 University of California Press
, 1997
"... We introduce an optimization problem called a minimax program that is similar to a linear program, except that the addition operator is replaced in the constraint equations by the maximum operator. We clarify the relation of this problem to some betterknown problems. We identify an interesting spec ..."
Abstract

Cited by 475 (5 self)
 Add to MetaCart
special case and present an efficient algorithm for its solution. 1 Introduction Over the last fifty years, thousands of problems of practical interest have been formulated as a linear program. Not only has the linear programming model proven to be widely applicable, but ongoing research has discovered
Noncommercial Software for MixedInteger Linear Programming
, 2004
"... We present an overview of noncommercial software tools for the solution of mixedinteger linear programs (MILPs). We first review solution methodologies for MILPs and then present an overview of the available software, including detailed descriptions of eight software packages available under open s ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
We present an overview of noncommercial software tools for the solution of mixedinteger linear programs (MILPs). We first review solution methodologies for MILPs and then present an overview of the available software, including detailed descriptions of eight software packages available under open
Review of nonlinear mixedinteger and disjunctive programming techniques
 Optimization and Engineering
, 2002
"... This paper has as a major objective to present a unified overview and derivation of mixedinteger nonlinear programming (MINLP) techniques, Branch and Bound, OuterApproximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are ex ..."
Abstract

Cited by 94 (22 self)
 Add to MetaCart
This paper has as a major objective to present a unified overview and derivation of mixedinteger nonlinear programming (MINLP) techniques, Branch and Bound, OuterApproximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems
Mixing MixedInteger Inequalities
 MATHEMATICAL PROGRAMMING
, 1998
"... Mixedinteger rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixedinteger programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities. Given a mixedinteger region S and a coll ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Mixedinteger rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixedinteger programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities. Given a mixedinteger region S and a
The synchronous dataflow programming language LUSTRE
 Proceedings of the IEEE
, 1991
"... This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in t ..."
Abstract

Cited by 647 (53 self)
 Add to MetaCart
This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools
Duality for mixedinteger linear programs
 The International Journal of Operations Research
, 2007
"... AbstractThe theory of duality for linear programs is welldeveloped and has been successful in advancing both the theory and practice of linear programming. In principle, much of this broad framework can be extended to mixedinteger linear programs, but this has proven difficult, in part because dua ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
duality theory does not integrate well with current computational practice. This paper surveys what is known about duality for integer programs and offers some minor extensions, with an eye towards developing a more practical framework. KeywordsDuality, Mixedinteger linear programming, Value function
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
 ACM Trans. Math. Software
, 1982
"... An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerica ..."
Abstract

Cited by 649 (21 self)
 Add to MetaCart
gradient algorithms, indicating that I~QR is the most reliable algorithm when A is illconditioned. Categories and Subject Descriptors: G.1.2 [Numerical Analysis]: ApprorJmationleast squares approximation; G.1.3 [Numerical Analysis]: Numerical Linear Algebralinear systems (direct and
Results 1  10
of
291,655