共查询到20条相似文献,搜索用时 31 毫秒
1.
S. J. Chung 《Journal of Optimization Theory and Applications》1989,60(3):393-399
We consider the linear complementarity problem (q, M) for which the data are the integer column vectorq εR n and the integer square matrixM of ordern. GLCP is the decision problem: Does (q, M) have a solution? We show that GLCP is NP-complete in the strong sense. 相似文献
2.
We present branching-on-hyperplane methods for solving mixed integer linear and mixed integer convex programs. In particular,
we formulate the problem of finding a good branching hyperplane using a novel concept of adjoint lattice. We also reformulate
the problem of rounding a continuous solution to a mixed integer solution. A worst case complexity of a Lenstra-type algorithm
is established using an approximate log-barrier center to obtain an ellipsoidal rounding of the feasible set. The results
for the mixed integer convex programming also establish a complexity result for the mixed integer second order cone programming
and mixed integer semidefinite programming feasibility problems as a special case. Our results motivate an alternative reformulation
technique and a branching heuristic using a generalized (e.g., ellipsoidal) norm reduced basis available at the root node. 相似文献
3.
《European Journal of Operational Research》2001,128(2):447-458
In this paper we present an efficient approach for solving single allocation p-hub problems with two or three hubs. Two different variants of the problem are considered: the uncapacitated single allocation p-hub median problem and the p-hub allocation problem. We solve these problems using new mixed integer linear programming formulations that require fewer variables than those formerly used in the literature. The problems that we solve here are the largest single allocation problems ever solved. The numerical results presented here will demonstrate the superior performance of our mixed integer linear programs over traditional approaches for large problems. Finally we present the first mixed integer linear program for solving single allocation hub location problems that requires only O(n2) variables and O(n2) constraints that is valid for any number of hubs. 相似文献
4.
《Operations Research Letters》2023,51(5):521-527
A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub. 相似文献
5.
Petr Lisoněk 《Journal of Combinatorial Theory, Series A》2007,114(4):619-630
We say that the sequence (an) is quasi-polynomial in n if there exist polynomials P0,…,Ps−1 and an integer n0 such that, for all n?n0, an=Pi(n) where . We present several families of combinatorial objects with the following properties: Each family of objects depends on two or more parameters, and the number of isomorphism types of objects is quasi-polynomial in one of the parameters whenever the values of the remaining parameters are fixed to arbitrary constants. For each family we are able to translate the problem of counting isomorphism types of objects into the problem of counting integer points in a union of parametrized rational polytopes. The families of objects to which this approach is applicable include combinatorial designs, linear and unrestricted codes, and dissections of regular polygons. 相似文献
6.
Manoj Kumar Hradyesh Kumar Mishra P. Singh 《Journal of Applied Mathematics and Computing》2009,29(1-2):229-246
In this paper, we describe an initial-value method for linear and nonlinear singularly perturbed boundary value problems in the interval [p,q]. For linear problems, the required approximate solution is obtained by solving the reduced problem and one initial-value problems directly deduced from the given problem. For nonlinear problems the original second-order nonlinear problem is linearized by using quasilinearization method. Then this linear problem is solved as previous method. The present method has been implemented on several linear and non-linear examples which approximate the exact solution. We also present the approximate and exact solutions graphically. 相似文献
7.
We describe a polynomial approximation scheme for an m-constraint 0–1 integer programming problem (m fixed) based on the use of the dual simplex algorithm for linear programming.We also analyse the asymptotic properties of a particular random model. 相似文献
8.
《Operations Research Letters》2023,51(1):72-78
We introduce a knapsack intersection hierarchy for strengthening linear programming relaxations of packing integer programs. In level t of the hierarchy, all valid cuts are added for the integer hull of the intersection of all t-row relaxations. This model captures the maximum possible strength of t-row cuts, an approach often used by solvers for small t. We investigate the integrality gap of the strengthened formulations on the all-or-nothing flow problem in trees (also called unsplittable flow on trees). 相似文献
9.
《European Journal of Operational Research》2002,140(2):291-321
We define a class of monotone integer programs with constraints that involve up to three variables each. A generic constraint in such integer program is of the form ax−by⩽z+c, where a and b are nonnegative and the variable z appears only in that constraint. We devise an algorithm solving such problems in time polynomial in the length of the input and the range of variables U. The solution is obtained from a minimum cut on a graph with O(nU) nodes and O(mU) arcs where n is the number of variables of the types x and y and m is the number of constraints. Our algorithm is also valid for nonlinear objective functions.Nonmonotone integer programs are optimization problems with constraints of the type ax+by⩽z+c without restriction on the signs of a and b. Such problems are in general NP-hard. We devise here an algorithm, relying on a transformation to the monotone case, that delivers half integral superoptimal solutions in polynomial time. Such solutions provide bounds on the optimum value that can only be superior to bounds provided by linear programming relaxation. When the half integral solution can be rounded to an integer feasible solution, this is a 2-approximate solution. In that the technique is a unified 2-approximation technique for a large class of problems. The results apply also for general integer programming problems with worse approximation factors that depend on a quantifier measuring how far the problem is from the class of problems we describe.The algorithm described here has a wide array of problem applications. An additional important consequence of our results is that nonmonotone problems in the framework are MAX SNP-hard and at least as hard to approximate as vertex cover.Problems that are amenable to the analysis provided here are easily recognized. The analysis itself is entirely technical and involves manipulating the constraints and transforming them to a totally unimodular system while losing no more than a factor of 2 in the integrality. 相似文献
10.
Alexander Barvinok 《Advances in Mathematics》2007,211(1):105-122
We establish approximate log-concavity for a wide family of combinatorially defined integer-valued functions. Examples include the number of non-negative integer matrices (contingency tables) with prescribed row and column sums (margins), as a function of the margins and the number of integer feasible flows in a network, as a function of the excesses at the vertices. As a corollary, we obtain approximate log-concavity for the Kostant partition function of type A. We also present an indirect evidence that at least some of the considered functions might be genuinely log-concave. 相似文献
11.
The master problem in Benders's partitioning method is an integer program with a very large number of constraints, each of which is usually generated by solving the integer program with the constraints generated earlier. Computational experience shows that the subset B of those constraints of the master problem that are satisfied with equality at the linear programming optimum often play a crucial role in determining the integer optimum, in the sense that only a few of the remaining inequalities are needed. We characterize this subset B of inequalities. If an optimal basic solution to the linear program is nondegenerate in the continuous variables and has p integer-constrained basic variables, then the corresponding set B contains at most 2p inequalities, none of which is implied by the others. We give an efficient procedure for generating an appropriate subset of the inequalities in B, which leads to a considerably improved version of Benders's method. 相似文献
12.
Akbar H. Borzabadi Hamed H. Mehne 《Journal of Applied Mathematics and Computing》2006,20(1-2):293-303
This paper describes a numerical scheme for optimal control of a time-dependent linear system to a moving final state. Discretization of the corresponding differential equations gives rise to a linear algebraic system. Defining some binary variables, we approximate the original problem by a mixed integer linear programming (MILP) problem. Numerical examples show that the resulting method is highly efficient. 相似文献
13.
《European Journal of Operational Research》2006,175(1):318-337
An m-objective tabu search algorithm for sequencing of n jobs on a single machine with sequence-dependent setup times is proposed. The algorithm produces a solution set that is reflective of the objectives’ weights and close to the best observed values of the objectives. We also formulate a mixed integer linear program to obtain the optimal solution of a three-objective problem. Numerical examples are used to study the behavior of the proposed m-objective tabu search algorithm and compare its solutions with those of the mixed integer linear program. 相似文献
14.
Peter J. Kolesar 《The Journal of the Operational Research Society》1968,19(1):73-75
The media scheduling problem of Ellis is transformed into an integer linear programming problem in zero-one variables. The transformed problem is recognized as the knapsack problem and exact and approximate algorithms are proposed. 相似文献
15.
《European Journal of Operational Research》2006,169(1):53-64
The economic significance of the average shadow price for integer and mixed integer linear programming (MILP) problems has been established by researchers [Kim and Cho, Eur. J. Operat. Res. 37 (1988) 328; Crema Eur. J. Operat. Res. 85 (1995) 625]. In this paper we introduce a valid shadow price (ASPIRA) for integer programs where the right-hand side resource availability can only be varied in discrete steps. We also introduce the concept of marginal unit shadow price (MUSP). We show that for integer programs, a sufficient condition for the marginal unit shadow price to equal the average shadow price is that the Law of Diminishing Returns should hold. The polyhedral structures that will guarantee this equivalence have been explored. Identification of the problem classes for which the equivalence holds complements the existing procedure for determining shadow price for such integer programs. The concepts of ASPIRA and MUSP introduced in this paper can play a vital role in resource acquisition plans and in defining efficient market clearing prices in the presence of indivisibilities. 相似文献
16.
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective integer programming problem. 相似文献
17.
It is well known that the linear knapsack problem with general integer variables (LKP) is NP-hard. In this paper we first introduce a special case of this problem and develop an O(n) algorithm to solve it. We then show how this algorithm can be used efficiently to obtain a lower bound for a general instance of LKP and prove that it is at least as good as the linear programming lower bound. We also present the results of a computational study that show that for certain classes of problems the proposed bound on average is tighter than other bounds proposed in the literature. 相似文献
18.
Víctor Blanco 《European Journal of Operational Research》2011,215(3):539-550
In this paper we present a mathematical programming formulation for the ω-invariant of a numerical semigroup for each of its minimal generators which is an useful index in commutative algebra (in particular in factorization theory) to analyze the primality of the elements in the semigroup. The model consists of solving a problem of optimizing a linear function over the efficient set of a multiobjective linear integer program. We offer a methodology to solve this problem and we provide some computational experiments to show the efficiency of the proposed algorithm. 相似文献
19.
We consider a type of covering problem in cellular networks. Given the locations of base stations, the problem amounts to determining cell coverage at minimum cost in terms of the power usage. Overlap between adjacent cells is required in order to support handover. The problem we consider is NP-hard. We present integer linear models and study the strengths of their continuous relaxations. Preprocessing is used to reduce problem size and tighten the models. Moreover, we design a tabu search algorithm for finding near-optimal solutions effectively and time-efficiently. We report computational results for both synthesized instances and networks originating from real planning scenarios. The results show that one of the integer models leads to tight bounds, and the tabu search algorithm generates high-quality solutions for large instances in short computing time. 相似文献
20.
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer: x ∈ {−1, 1}n. We achieve this by reformulating the problem as a linear program and deriving necessary and sufficient conditions for the integer solution to be the unique primal optimal solution. We show that as long as m is larger than n/2, then the linear programming reformulation succeeds for most instances, but if m is less than n/2, the reformulation fails on most instances. We also demonstrate that these predictions match the empirical performance of the linear programming formulation to very high accuracy. 相似文献