Results 1 - 10 of 9,258

Duality for mixed-integer linear programs

by M. Guzelsoy, T. K. Ralphs - The International Journal of Operations Research , 2007
"... AbstractThe theory of duality for linear programs is well-developed 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 mixed-integer linear programs, but this has proven difficult, in part because dua ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
AbstractThe theory of duality for linear programs is well-developed 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 mixed-integer linear programs, but this has proven difficult, in part because

SUBMITTED TO THE IEEE TRANSACTIONS ON ROBOTICS 1 Iterative MILP Methods for Vehicle Control Problems

by Matthew G. Earl
"... Abstract Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms that add ..."
Abstract - Add to MetaCart
Abstract Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms

Automatic Discovery of Linear Restraints Among Variables of a Program

by Patrick Cousot, Nicolas Halbwachs , 1978
"... The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs. ..."
Abstract - Cited by 726 (43 self) - Add to MetaCart
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.

Conic mixed-integer rounding cuts

by Alper Atamtürk, Vishnu Narayanan - University of California-Berkeley , 2006
"... Abstract. A conic integer program is an integer programming problem with conic constraints. Many important problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constr ..."
Abstract - Cited by 21 (4 self) - Add to MetaCart
Abstract. A conic integer program is an integer programming problem with conic constraints. Many important problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic

Treadmarks: Shared memory computing on networks of workstations

by Cristiana Amza, Alan L. Cox, Hya Dwarkadas, Pete Keleher, Honghui Lu, Ramakrishnan Rajamony, Weimin Yu, Willy Zwaenepoel - Computer , 1996
"... TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of parallelism in the code, most of the data structures ..."
Abstract - Cited by 487 (37 self) - Add to MetaCart
cient shared memory, and our experience with two large applications, mixed integer programming and genetic linkage analysis. 1

ATOMIC DECOMPOSITION BY BASIS PURSUIT

by Scott Shaobing Chen , David L. Donoho , Michael A. Saunders , 1995
"... The Time-Frequency and Time-Scale communities have recently developed a large number of overcomplete waveform dictionaries -- stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for d ..."
Abstract - Cited by 2728 (61 self) - Add to MetaCart
variation de-noising, and multi-scale edge denoising. Basis Pursuit in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked

Logic Programming with Focusing Proofs in Linear Logic

by Jean-marc Andreoli - Journal of Logic and Computation , 1992
"... The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is C ..."
Abstract - Cited by 419 (8 self) - Add to MetaCart
The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle

Iterative MILP methods for vehicle-control problems

by Matthew G. Earl, Senior Member - IEEE Transactions on Robotics
"... Abstract—Mixed-integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms that addr ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
Abstract—Mixed-integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms

Sequence independent lifting for mixed-integer programming

by Alper Atamtürk - Oper. Res
"... Abstract: We show that (1) superadditive lifting functions lead to sequence independent lifting of inequalities for general mixed-integer programming and (2) any mixedinteger rounding inequality can be obtained via sequence independent lifting. Lifting is a procedure for deriving strong valid inequ ..."
Abstract - Cited by 24 (10 self) - Add to MetaCart
Abstract: We show that (1) superadditive lifting functions lead to sequence independent lifting of inequalities for general mixed-integer programming and (2) any mixedinteger rounding inequality can be obtained via sequence independent lifting. Lifting is a procedure for deriving strong valid

Fast linear iterations for distributed averaging.

by Lin Xiao , Stephen Boyd - Systems & Control Letters, , 2004
"... Abstract We consider the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of finding the fastest converging ..."
Abstract - Cited by 433 (12 self) - Add to MetaCart
Abstract We consider the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of finding the fastest
Results 1 - 10 of 9,258