Results 1  10
of
3,594
Extended Formulations in Mixed Integer Conic Quadratic Programming
, 2015
"... In this paper we consider the use of extended formulations in LPbased algorithms for mixed integer conic quadratic programming (MICQP). Through an homogenization procedure we generalize an existing extended formulation to general conic quadratic constraints. We then compare its effectiveness again ..."
Abstract
 Add to MetaCart
In this paper we consider the use of extended formulations in LPbased algorithms for mixed integer conic quadratic programming (MICQP). Through an homogenization procedure we generalize an existing extended formulation to general conic quadratic constraints. We then compare its effectiveness
A lifted linear programming branchandbound algorithm for mixed integer conic quadratic programs
, 2007
"... This paper develops a linear programming based branchandbound algorithm for mixed integer conic quadratic programs. The algorithm is based on a higher dimensional or lifted polyhedral relaxation of conic quadratic constraints introduced by BenTal and Nemirovski. The algorithm is different from o ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
This paper develops a linear programming based branchandbound algorithm for mixed integer conic quadratic programs. The algorithm is based on a higher dimensional or lifted polyhedral relaxation of conic quadratic constraints introduced by BenTal and Nemirovski. The algorithm is different from
Multiple kernel learning, conic duality, and the SMO algorithm
 In Proceedings of the 21st International Conference on Machine Learning (ICML
, 2004
"... While classical kernelbased classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. (2004) considered conic combinations of kernel matrices for the support vector machine (SVM), and showed that the optimiz ..."
Abstract

Cited by 445 (31 self)
 Add to MetaCart
that the optimization of the coefficients of such a combination reduces to a convex optimization problem known as a quadraticallyconstrained quadratic program (QCQP). Unfortunately, current convex optimization toolboxes can solve this problem only for a small number of kernels and a small number of data points
Treadmarks: Shared memory computing on networks of workstations
 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
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 680 (11 self)
 Add to MetaCart
mixed integer programming problems and gives a brief summary of additional practical experience, including the use of tabu search to guide other types of processes, such as those
Control of Systems Integrating Logic, Dynamics, and Constraints
 Automatica
, 1998
"... This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and ..."
Abstract

Cited by 413 (50 self)
 Add to MetaCart
reference trajectories while fulfilling operating constraints, and possibly take into account previous qualitative knowledge in the form of heuristic rules. Due to the presence of integer variables, the resulting online optimization procedures are solved through Mixed Integer Quadratic Programming (MIQP
Shape matching and object recognition using low distortion correspondence
 In CVPR
, 2005
"... We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of correspond ..."
Abstract

Cited by 419 (15 self)
 Add to MetaCart
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity
PComplete Approximation Problems
, 1976
"... For Pcomplete problems such as traveling salesperson, cycle covers, 01 integer programming, multicommodity network flows, quadratic assignment, etc, it is shown that the approximation problem is also Pcomplete In contrast with these results, a linear time approximation algorithm for the clusterin ..."
Abstract

Cited by 376 (0 self)
 Add to MetaCart
For Pcomplete problems such as traveling salesperson, cycle covers, 01 integer programming, multicommodity network flows, quadratic assignment, etc, it is shown that the approximation problem is also Pcomplete In contrast with these results, a linear time approximation algorithm
Lifting for conic mixedinteger programming
, 2011
"... Lifting is a procedure for deriving valid inequalities for mixedinteger sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very effective in developing strong valid inequalities for linear integer programming and it has been successfully used to sol ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Lifting is a procedure for deriving valid inequalities for mixedinteger sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very effective in developing strong valid inequalities for linear integer programming and it has been successfully used
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 376 (3 self)
 Add to MetaCart
solution to the problem of pipelining combinational circuitry with minimum register cost. We also give a characterization of optimal retiming based on an efficiently solvable mixedinteger linearprogramming problem.
Results 1  10
of
3,594