Models and Tools for Improving Efficiency in Constraint Logic Programming
Journal Title: Decision Making in Manufacturing and Services - Year 2011, Vol 5, Issue 1
Abstract
Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach.
Authors and Affiliations
Antoni Ligęza
Balancing Bilinearly Interfering Elements
Many decisions in various fields of application have to take into account the joined effects of two elements that can interfere with each other. This happens for example in Medicine (synergic or antagonistic drugs ), in...
Editorial
Welcome to the premier issue of the new international journal Decision Making in Manufacturing and Services. The launching of a new journal is a unique opportunity to introduce its mission, scope, and coverage areas.
Maximization of an Asymmetric Utility Function by the Least Squares
This note points out that a utility maximization procedure proposed in an earlier paper may be reduced to the least squares.The utility function is asymmetric in the sense that for each cue an ideal value and a permissib...
A Bi-Objective Portfolio Optimization with Conditional Value-at-Risk
This paper presents a bi-objective portfolio model with the expected return as a performance measure and the expected worst-case return as a risk measure. The problems are formulated as a bi-objective linear program. Num...
Elevator Trip Distribution for Inconsistent Passenger Input-Output Data
Accurate traffic data are the basis for group control of elevators and its performance evaluation by trace driven simulation. The present practice estimates a time series of inter-floor passenger traffic based on commonl...