We study a general class of multiagent optimization problems, together with a compact representation language of utilities based on weighted propositional formulas. We seek solutions maximizing utilitarian social welfare as well as fair solutions maximizing the utility of the least happy agent. We show that many problems can be expressed in this setting, such as fair division of indivisible goo...

The multifacility minimax location problem with rectilinear distances is considered. It is reduced to a parametric shortest path problem in a network with no negative length arcs. The reduction scheme contributes to this location problem and yields an efficient algorithm with time complexity 0 (n max(m log m, n3 )) where n and m denote the numbers of the new and existing facilitie,s in the plan...

In this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques ...

There is good evidence from experience reports and other literature that the lean flow concepts of on-demand, value-based scheduling and limited work-in-progress are highly effective in many instances of software development. The question remains, however, if they are equally applicable to the systems and enterprise engineering found in large or complex system environments. This paper builds on...