共查询到20条相似文献,搜索用时 15 毫秒
1.
Mohand Ou Idir Khemmoudj Hachemi Bennaceur 《European Journal of Operational Research》2009,199(3):665-673
Few works on problems CSP, Max-CSP and weighted CSP was carried out in the field of Combinatorial Optimization, whereas this field contains many algorithmic tools which can be used for the resolution of these problems.In this paper, we introduce the binary clique concept: clique which expresses incompatibilities between values of two CSP variables. We propose a linear formulation for any binary clique and we present several ways to exploit it in order to compute lower bounds or to solve Max-CSP. We also show that the binary clique concept can be exploited in the weighted CSP framework.The obtained theoretical and experimental results are very interesting and they open new prospects to exploit the Combinatorial Optimization algorithmic tools for the resolution of CSP, Max-CSP and weighted CSP. 相似文献
2.
《International Journal of Approximate Reasoning》2014,55(2):739-761
Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets. 相似文献
3.
We tackle precedence-constrained sequencing on a single machine in order to minimize total weighted tardiness. Classic dynamic programming (DP) methods for this problem are limited in performance due to excessive memory requirements, particularly when the precedence network is not sufficiently dense. Over the last decades, a number of precedence theorems have been proposed, which distinguish dominant precedence constraints for a job pool that is initially without precedence relation. In this paper, we connect and extend the findings of the foregoing two strands of literature. We develop a framework for applying the precedence theorems to the precedence-constrained problem to tighten the search space, and we propose an exact DP algorithm that utilizes a new efficient memory management technique. Our procedure outperforms the state-of-the-art algorithm for instances with medium to high network density. We also empirically verify the computational gain of using different sets of precedence theorems. 相似文献
4.
We prove polynomial-time solvability of a large class of clustering problems where a weighted set of items has to be partitioned into clusters with respect to some balancing constraints. The data points are weighted with respect to different features and the clusters adhere to given lower and upper bounds on the total weight of their points with respect to each of these features. Further the weight-contribution of a vector to a cluster can depend on the cluster it is assigned to. Our interest in these types of clustering problems is motivated by an application in land consolidation where the ability to perform this kind of balancing is crucial.Our framework maximizes an objective function that is convex in the summed-up utility of the items in each cluster. Despite hardness of convex maximization and many related problems, for fixed dimension and number of clusters, we are able to show that our clustering model is solvable in time polynomial in the number of items if the weight-balancing restrictions are defined using vectors from a fixed, finite domain. We conclude our discussion with a new, efficient model and algorithm for land consolidation. 相似文献
5.
Fractional programming approach to fuzzy weighted average 总被引:15,自引:0,他引:15
This paper proposes a fractional programming approach to construct the membership function for fuzzy weighted average. Based on the -cut representation of fuzzy sets and the extension principle, a pair of fractional programs is formulated to find the -cut of fuzzy weighted average. Owing to the special structure of the fractional programs, in most cases, the optimal solution can be found analytically. Consequently, the exact form of the membership function can be derived by taking the inverse function of the -cut. For other cases, a discrete but exact solution to fuzzy weighted average is provided via an efficient solution method. Examples are given for illustration. 相似文献
6.
Ibolya Jankovits Chaomin Luo Miguel F. Anjos Anthony Vannelli 《European Journal of Operational Research》2011,214(2):199-215
The unequal-areas facility layout problem is concerned with finding the optimal arrangement of a given number of non-overlapping indivisible departments with unequal area requirements within a facility. We present a convex-optimisation-based framework for efficiently finding competitive solutions for this problem. The framework is based on the combination of two mathematical programming models. The first model is a convex relaxation of the layout problem that establishes the relative position of the departments within the facility, and the second model uses semidefinite optimisation to determine the final layout. Aspect ratio constraints, frequently used in facility layout methods to restrict the occurrence of overly long and narrow departments in the computed layouts, are taken into account by both models. We present computational results showing that the proposed framework consistently produces competitive, and often improved, layouts for well-known large instances when compared with other approaches in the literature. 相似文献
7.
Stefano Gualandi Federico Malucelli 《4OR: A Quarterly Journal of Operations Research》2009,7(2):113-137
This paper surveys recent applications and advances of the constraint programming-based column generation framework, where
the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by constraint programming
(CP). This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem
demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using CP are the
expressiveness of its modeling language and the flexibility of its solvers. Recently, the CP-based column generation framework
has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional
bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad hoc networks.
相似文献
8.
Jérôme Thai Alexandre M. Bayen 《Journal of Mathematical Analysis and Applications》2018,457(2):1675-1695
To impute the function of a variational inequality and the objective of a convex optimization problem from observations of (nearly) optimal decisions, previous approaches constructed inverse programming methods based on solving a convex optimization problem [17], [7]. However, we show that, in addition to requiring complete observations, these approaches are not robust to measurement errors, while in many applications, the outputs of decision processes are noisy and only partially observable from, e.g., limitations in the sensing infrastructure. To deal with noisy and missing data, we formulate our inverse problem as the minimization of a weighted sum of two objectives: 1) a duality gap or Karush–Kuhn–Tucker (KKT) residual, and 2) a distance from the observations robust to measurement errors. In addition, we show that our method encompasses previous ones by generating a sequence of Pareto optimal points (with respect to the two objectives) converging to an optimal solution of previous formulations. To compare duality gaps and KKT residuals, we also derive new sub-optimality results defined by KKT residuals. Finally, an implementation framework is proposed with applications to delay function inference on the road network of Los Angeles, and consumer utility estimation in oligopolies. 相似文献
9.
对于线性型多目标半定规划问题,引进加权中心路径的概念,并利用单目标半定规划的中心路径法,提出了求解多目标半定规划问题的加权中心路径法,先得型对一个叔向量的有效解,然后在此基础上,提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法. 相似文献
10.
E. Centeno B. Vitoriano A. Campos A. Muñoz J. Villar E.F. Sánchez-Úbeda 《Annals of Operations Research》2003,120(1-4):45-57
In deregulated electrical systems, production schedule for power plants is the result of an auction process. In the Spanish case, this schedule includes two main concepts: energy production (to be actually produced) and secondary reserve (to maintain available). The generation company faces the problem of converting energy schedule into a power schedule, respecting the reserve schedule as well as technical constraints, and trying to accomplish different goals: to minimise the production costs, to obtain smooth shapes for the power schedules and to optimise eventual compensation in schedules. A weighted goal mixed integer programming model with a real-size application to deal with this problem is presented. 相似文献
11.
Daniel Espinoza 《Operations Research Letters》2010,38(6):559-563
Lifting, tilting and fractional programming, though seemingly different, reduce to a common optimization problem. This connection allows us to revisit key properties of these three problems on mixed integer linear sets. We introduce a simple common framework for these problems, and extend known results from each to the other two. 相似文献
12.
Chek Beng Chua 《Mathematical Programming》2008,115(2):239-271
The purpose of this paper is two-fold. Firstly, we show that every Cholesky-based weighted central path for semidefinite programming
is analytic under strict complementarity. This result is applied to homogeneous cone programming to show that the central
paths defined by the known class of optimal self-concordant barriers are analytic in the presence of strictly complementary
solutions. Secondly, we consider a sequence of primal–dual solutions that lies within a prescribed neighborhood of the central
path of a pair of primal–dual semidefinite programming problems, and converges to the respective optimal faces. Under the
additional assumption of strict complementarity, we derive two necessary and sufficient conditions for the sequence of primal–dual
solutions to converge linearly with their duality gaps.
This research was supported by a grant from the Faculty of Mathematics, University of Waterloo and by a Discovery Grant from
NSERC. 相似文献
13.
A dual strategy for solving the linear programming relaxation of a driver scheduling system 总被引:1,自引:0,他引:1
A Mathematical Programming model of a driver scheduling system is described. This consists of set covering and partitioning constraints, possibly user-supplied side constraints, and two pre-emptively ordered objectives. The previous solution strategy addressed the two objectives using separate Primal Simplex optimisations; a new strategy uses a single weighted objective function and a Dual Simplex algorithm initiated by a specially developed heuristic. Computational results are reported. 相似文献
14.
带权值的模糊多目标线性规划 总被引:3,自引:0,他引:3
本文提出了求解一般多目标性规划问题 (MOL P)的带权值的模糊多目标线性规划方法 .证明了在权值都大于零的条件下 ,与 (MOLP)原问题对应的带权值的模糊多目标线性规划问题的最优解为模糊有效解 ,从而为原问题的有效解 ,并作了实例验证 . 相似文献
15.
In this paper we present a technique to compute the maximum of a weighted sum of the objective functions in multiple objective linear fractional programming (MOLFP). The basic idea of the technique is to divide (by the approximate ‘middle’) the non-dominated region in two sub-regions and to analyze each of them in order to discard one if it can be proved that the maximum of the weighted sum is in the other. The process is repeated with the remaining region. The process will end when the remaining regions are so little that the differences among their non-dominated solutions are lower than a pre-defined error. Through the discarded regions it is possible to extract conditions that establish weight indifference regions. These conditions define the variation range of the weights that necessarily leads to the same non-dominated solution. An example, illustrating the concept, is presented. Some computational results indicating the performance of the technique are also presented. 相似文献
16.
K. Sirlantzis J. D. Lamb W. B. Liu 《Journal of Optimization Theory and Applications》2006,129(2):325-340
The supervisor and searcher cooperation framework (SSC), introduced in Refs. 1 and 2, provides an effective way to design
efficient optimization algorithms combining the desirable features of the two existing ones. This work aims to develop efficient
algorithms for a wide range of noisy optimization problems including those posed by feedforward neural networks training.
It introduces two basic SSC algorithms. The first seems suited for generic problems. The second is motivated by neural networks
training problems. It introduces also inexact variants of the two algorithms, which seem to possess desirable properties.
It establishes general theoretical results about the convergence and speed of SSC algorithms and illustrates their appealing
attributes through numerical tests on deterministic, stochastic, and neural networks training problems. 相似文献
17.
Narasimhan incorporated fuzzy set theory within goal programming formulation in 1980. Since then numerous research has been carried out in this field. One of the well-known models for solving fuzzy goal programming problems was proposed by Hannan in 1981. In this paper the conventional MINMAX approach in goal programming is applied to solve fuzzy goal programming problems. It is proved that the proposed model is an extension to Hannan model that deals with unbalanced triangular linear membership functions. In addition, it is shown that the new model is equivalent to a model proposed in 1991 by Yang et al. Moreover, a weighted model of the new approach is introduced and is compared with Kim and Whang’s model presented in 1998. A numerical example is given to demonstrate the validity and strengths of the new models. 相似文献
18.
Jørgen Tind 《Journal of Global Optimization》1991,1(2):131-144
The purpose of this article is to propose a simple framework for the various decomposition schemes in mathematical programming.Special instances are discussed. Particular attention is devoted to the general mathematical programming problem with two sets of variables. An economic interpretation in the context of hierarchical planning is done for the suggested decomposition procedure.The framework is based on general duality theory in mathematical programming and thus focussing on approaches leading to global optimality. 相似文献
19.
In this paper, we introduce a general framework for situations with decision making under uncertainty and cooperation possibilities. This framework is based upon a two stage stochastic programming approach. We show that under relatively mild assumptions the associated cooperative games are totally balanced. Finally, we consider several example situations. 相似文献
20.
Tobias Achterberg 《Mathematical Programming Computation》2009,1(1):1-41
Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques. In this paper we discuss the software framework and solver SCIP (Solving Constraint
Integer Programs), which is free for academic and non-commercial use and can be downloaded in source code. This paper gives
an overview of the main design concepts of SCIP and how it can be used to solve constraint integer programs. To illustrate
the performance and flexibility of SCIP, we apply it to two different problem classes. First, we consider mixed integer programming
and show by computational experiments that SCIP is almost competitive to specialized commercial MIP solvers, even though SCIP
supports the more general constraint integer programming paradigm. We develop new ingredients that improve current MIP solving
technology. As a second application, we employ SCIP to solve chip design verification problems as they arise in the logic
design of integrated circuits. This application goes far beyond traditional MIP solving, as it includes several highly non-linear
constraints, which can be handled nicely within the constraint integer programming framework. We show anecdotally how the
different solving techniques from MIP, CP, and SAT work together inside SCIP to deal with such constraint classes. Finally,
experimental results show that our approach outperforms current state-of-the-art techniques for proving the validity of properties
on circuits containing arithmetic.
相似文献