An efficient solver for weighted Max-SAT

We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence that our solver is very competitive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers on a wide range of instances.     

Urban rapid transit network capacity expansion

This paper examines a multi-period capacity expansion problem for rapid transit network design. The capacity expansion is realized through the location of train alignments and stations in an urban traffic context by selecting the time periods. The model maximizes the public transportation demand using a limited budget and designing lines for each period. The location problem incorporates the user decisions about mode and route. The network capacity expansion is a long-term planning problem because the network is built over several periods, in which the data (demand, resource price, etc.) are changing like the real problem changes. This complex problem cannot be solved by branch and bound, and for this reason, a heuristic approach has been defined in order to solve it. Both methods have been experimented in test networks.     

Packing Steiner trees: a cutting plane algorithm and computational results

In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational experience. This includes a brief discussion of separation algorithms, a new LP-based primal heuristic and implementation details. The paper is based on the polyhedral theory for the Steiner tree packing polyhedron developed in our companion paper (this issue) and meant to turn this theory into an algorithmic tool for the solution of practical problems.     

Special ordered sets and an application to gas supply operations planning

Special Ordered Sets provide a powerful means of modeling nonconvex functions and discrete requirements, though there has been a tendency to think of them only in terms of multiple-choice zero-one programming. This paper emphasizes the origins and generality of the special ordered set concept, and describes an application in which type 2 sets are used in several forms to model both logical conditions and nonlinear functions.Now at IBM Almaden Research Center, San Jose, CA 95120.     

A branch and cut algorithm for hub location problems with single assignment

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.Acknowledgement The research of the first author was partially supported by the Banque Nationale de Belgique. The research of the second author was supported by France Telecom R&D under contract no. 99 1B 774. Their support is gratefully acknowledged.     

A restricted Lagrangean approach to the traveling salesman problem

We describe an algorithm for the asymmetric traveling salesman problem (TSP) using a new, restricted Lagrangean relaxation based on the assignment problem (AP). The Lagrange multipliers are constrained so as to guarantee the continued optimality of the initial AP solution, thus eliminating the need for repeatedly solving AP in the process of computing multipliers. We give several polynomially bounded procedures for generating valid inequalities and taking them into the Lagrangean function with a positive multiplier without violating the constraints, so as to strengthen the current lower bound. Upper bounds are generated by a fast tour-building heuristic. When the bound-strengthening techniques are exhausted without matching the upper with the lower bound, we branch by using two different rules, according to the situation: the usual subtour breaking disjunction, and a new disjunction based on conditional bounds. We discuss computational experience on 120 randomly generated asymmetric TSP's with up to 325 cities, the maximum time used for any single problem being 82 seconds. This is a considerable improvement upon earlier methods. Though the algorithm discussed here is for the asymmetric TSP, the approach can be adapted to the symmetric TSP by using the 2-matching problem instead of AP.Research supported by the National Science Foundation through grant no. MCS76-12026 A02 and the U.S. Office of Naval Research through contract no. N0014-75-C-0621 NR 047-048.     

Management of branch-duct intraductal papillary mucinous neoplasms of the pancreas: observation with MR imaging

Purpose

To evaluate the clinical outcomes of conservative management by observation with MRI of patients with branch-duct intraductal papillary mucinous neoplasms (BD-IPMNs).

Materials and Methods

Twenty-three consecutive patients, who were followed up by MRI with magnetic resonance cholangiopancreatography (MRCP) over a period of more than 9 months after initial MRI examinations, were enrolled in this study. On MRI, number of lesions, the maximum diameter of BD-IPMNs, lesion location, the presence of associated dilatation of main pancreatic duct (MPD), the presence of enhancing mural nodules within the lesion and the presence of interval change were retrospectively reviewed on initial and follow-up MR images in consensus by two radiologists. All patients were evaluated to search for evidence of malignant progression of disease.

Results

The follow-up period ranged from 10 to 96 months (mean, 37 months). On initial MRI with MRCP, a total of 39 lesions were found in 23 patients. The maximum diameter of BD-IPMNs ranged between 6 and 32 mm, with a mean of 12 mm. Thirty-four lesions (87%) of 19 patients remained unchanged in the maximum diameter. Five lesions (13%) of four patients showed an increase in the maximum diameter. Enhancing mural nodules were not found in any individual, neither on the initial MRI study nor on the follow-up studies. There was no patient who had evidence of local aggressive growth of tumor or evidence of metastases to distant sites.

Conclusion

Our study suggests that branch-duct IPMNs without enhancing mural nodules are essentially benign and should be managed nonoperatively through observation by MRI.     

线性比式和规划问题的输出空间分支定界算法

本文旨在针对线性比式和规划这一NP-Hard非线性规划问题提出新的全局优化算法.首先,通过引入p个辅助变量把原问题等价的转化为一个非线性规划问题,这个非线性规划问题的目标函数是乘积和的形式并给原问题增加了p个新的非线性约束,再通过构造凸凹包络的技巧对等价问题的目标函数和约束条件进行相应的线性放缩,构成等价问题的一个下界线性松弛规划问题,从而提出了一个求解原问题的分支定界算法,并证明了算法的收敛性.最后,通过数值结果比较表明所提出的算法是可行有效的.     

On diagonal actions of branch groups and the corresponding characters

We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acting on a regular rooted tree acts absolutely non-freely on the boundary of the tree. Using this result and the symmetrized diagonal actions we construct for every countable branch group infinitely many different ergodic perfectly non-free actions, infinitely many II₁-factor representations, and infinitely many continuous ergodic invariant random subgroups.