Results 1  10
of
4,053
An Algorithm for Mixed Integer Optimization
 Mathematical Programming
, 2002
"... This paper introduces a new algorithm for solving mixed integer programs. The core of the method is an iterative technique for changing the representation of the original mixed integer optimization problem. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper introduces a new algorithm for solving mixed integer programs. The core of the method is an iterative technique for changing the representation of the original mixed integer optimization problem.
mixedinteger programming
, 2012
"... Dippy – a simplified interface for advanced mixedinteger programming ..."
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 25 (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
Mixedinteger quadrangulation
 ACM TRANS. GRAPH
, 2009
"... We present a novel method for quadrangulating a given triangle mesh. After constructing an as smooth as possible symmetric cross field satisfying a sparse set of directional constraints (to capture the geometric structure of the surface), the mesh is cut open in order to enable a low distortion un ..."
Abstract

Cited by 100 (11 self)
 Add to MetaCart
of singularities in the quadrangulation. Both steps of the algorithm (cross field and parametrization) can be formulated as a mixedinteger problem which we solve very efficiently by an adaptive greedy solver. We show several complex examples where high quality quad meshes are generated in a fully automatic manner.
MixedInteger NK Landscapes
"... Abstract. NK landscapes (NKL) are stochastically generated pseudoboolean functions with N bits (genes) and K interactions between genes. By means of the parameter K ruggedness as well as the epistasis can be controlled. NKL are particularly useful to understand the dynamics of evolutionary search. W ..."
Abstract
 Add to MetaCart
. We extend NKL from the traditional binary case to a mixed variable case with continuous, nominal discrete, and integer variables. The resulting test function generator is a suitable test model for mixedinteger evolutionary algorithms (MIEA) i. e. instantiations of evolution algorithms that can
on mixed integer programming methodology
, 2008
"... In this paper, an effective optimization method is proposed with the aim of minimizing the active part cost of wound core distribution transformers, taking into account constraints imposed both by international specifications and customer needs. In order to achieve so, Mixed Integer Programming in c ..."
Abstract
 Add to MetaCart
In this paper, an effective optimization method is proposed with the aim of minimizing the active part cost of wound core distribution transformers, taking into account constraints imposed both by international specifications and customer needs. In order to achieve so, Mixed Integer Programming
On the facets of the mixed–integer knapsack polyhedron
 MATH. PROGRAM., SER. B 98: 145–175 (2003)
, 2003
"... We study the mixed–integer knapsack polyhedron, that is, the convex hull of the mixed–integer set defined by an arbitrary linear inequality and the bounds on the variables. We describe facet–defining inequalities of this polyhedron that can be obtained through sequential lifting of inequalities cont ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
We study the mixed–integer knapsack polyhedron, that is, the convex hull of the mixed–integer set defined by an arbitrary linear inequality and the bounds on the variables. We describe facet–defining inequalities of this polyhedron that can be obtained through sequential lifting of inequalities
Conic mixedinteger rounding cuts
 University of CaliforniaBerkeley
, 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 mixedinteger sets defined by secondorder 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 mixedinteger sets defined by secondorder conic
Mixedinteger Quadratic Programming is in NP
, 2014
"... Mixedinteger quadratic programming (MIQP) is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixedinteger quadratic programming is in NP, thereby showing ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Mixedinteger quadratic programming (MIQP) is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixedinteger quadratic programming is in NP, thereby showing
Results 1  10
of
4,053