We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n-1 variables. the optimal values of both problems are identical. From...
详细信息
In this paper the symmetric traveling salesman problem (STSP) is modeled as a problem of discrete semidefinite programming. A class of semidefinite relaxations of STSP model is defined and two variants of a branch-and...
详细信息
In this paper we consider the general problem of optimizing over the intersection of a submodular base polyhedron and an affine space. An example is the following flow problem defined on a capacitated network: we wish...
详细信息
We introduce the framework of branched polyhedral systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other polyhedra. the framework, for instance,...
详细信息
ISBN:
(纸本)9783642130359
We introduce the framework of branched polyhedral systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other polyhedra. the framework, for instance, simultaneously generalizes extended formulations like the well-known ones (see Balas [1]) for the convex hulls of unions of polyhedra (disjunctive programming) and like those obtained from dynamic programming algorithms for combinatorialoptimization problems (due to Martin, Rardin, and Campbell [11]). Using the framework, we construct extended formulations for full orbitopes (the convex hulls of all 0/1-matrices with lexicographically sorted columns), we show for two special matching problems, how branched polyhedral systems can be exploited in order to construct formulations for certain nested combinatorial problems, and we indicate how one can build extended formulations for stable set polytopes using the framework of branched polyhedral systems.
We investigate network planning and design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible solutions and using this ch...
详细信息
In optimization problems such as integer programs or their relaxations, one encounters feasible regions of the form {x ∈ +n : Rx ∈ S} where R is a general real matrix and S ⊂ q is a specific closed set with 0 ∉ S. F...
详细信息
Branch-and-cut methods are among the more successful techniques for solving integerprogramming problems. they can also be used to prove that all solutions of an integer program satisfy a given linear inequality. We e...
详细信息
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a...
详细信息
this paper studies the passage from a linear to an integer program using tools provided by test sets and cutting planes. the first half of the paper examines the process by which the secondary polytope Σ(A) associate...
详细信息
this paper demonstrates the use of hidden network structure for the solution of set partitioning problems. By finding a hidden network row suhmatrix, the set partitioning problem is transformed to a network with side ...
详细信息
暂无评论