Results 251 to 260 of about 979,870 (292)

Small covering designs by branch-and-cut

Mathematical Programming, 2003
A Branch-and-Cut algorithm for finding covering designs is presented. Its originality resides in the use of isomorphism pruning of the enumeration tree. A proof that no 4-(10, 5, 1)-covering design with less than 51 sets exists is obtained together with all non isomorphic 4-(10, 5, 1)-covering designs with 51 ...
openaire   +2 more sources

Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

Networks, 2015
The quadratic minimum spanning tree problem (QMSTP) consists of finding a spanning tree of a graph G such that a quadratic cost function is minimized. In its adjacent only version (AQMSTP), interaction costs only apply for edges that share an endpoint.
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha   +2 more
openaire   +2 more sources

Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression

2010
This paper discusses several techniques to apply Cell Suppression Methodology to protect private information when publishing tabular data. All techniques are exact algorithms to find optimal suppression patterns, but they can also be used as heuristic approaches to find good suppression patterns.
openaire   +1 more source

Assembly System Design: A Branch and Cut Approach

Management Science, 1998
This paper addresses the single-product assembly system design problem (ASDP), which seeks to minimize total cost by optimally integrating design (selecting the machine type to locate at each activated station) and operating issues (assigning tasks to observe precedence relationships and cycle time restrictions). We propose an effective branch-and-cut
Anulark Pinnoi, Wilbert E. Wilhelm
openaire   +2 more sources

Regge Poles and Branch Cuts for Potential Scattering

Journal of Mathematical Physics, 1963
The analytic properties of partial wave amplitudes are studied for complex energy and angular momentum. The properties of the wavefunctions are first obtained by standard methods in the theory of differential equations for general classes of potentials, and the effects of the dominant singular term in the potential near the origin are investigated ...
Challifour, J., Eden, R. J.
openaire   +2 more sources

A Branch-and-Cut Algorithm

2000
In this chapter, we describe the details of the implementation of a Branch-and-Cut algorithm for the 2CNBR problem. In Section 6.1, we address the problem of determining if a network is feasible. In Sections 6.2 to 6.8, we study the Separation problems for all the valid inequalities described in the previous chapters.
openaire   +1 more source

A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

ACM Journal of Experimental Algorithmics, 2014
The cut packing problem in an undirected graph is to find a largest cardinality collection of pairwise edge-disjoint cuts. We provide the first experimental study of this NP-hard problem that is interesting from a pure theorist’s viewpoint as well as from the standpoint of scientific applications (e.g., in bioinformatics and network reliability).
Bergner, Martin, Lübbecke, Marco E., Witt, Jonas T.   +2 more
openaire   +1 more source

Monotonic Optimization: Branch and Cut Methods

2005
Monotonic optimization is concerned with optimization problems dealing with multivariate monotonic functions and differences of monotonic functions. For the study of this class of problems a general framework (Tuy, 2000a) has been earlier developed where a key role was given to a separation property of solution sets of monotonic inequalities similar to
Hoang Tuy, Faiz Al-Khayyal, Phan Thien Thach   +2 more
openaire   +1 more source

Isolation branching: a branch and bound algorithm for the k-terminal cut problem

Journal of Combinatorial Optimization, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mark Velednitsky, Dorit S. Hochbaum
openaire   +2 more sources

Branch, Cut, and Price: Sequential and Parallel

2001
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generated dynamically throughout the search tree. The ability to handle constantly changing sets of cuts and variables allows these algorithms to undertake the solution of very ...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter   +2 more
openaire   +1 more source