Results 251 to 260 of about 445,381 (296)
Some of the next articles are maybe not open access.
Classical cuts for mixed-integer programming and branch-and-cut
Mathematical Methods of Operations Research (ZOR), 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
CUTTING THE BRANCHES FOR AKIBA:
2005This article appears in an anthology of essays that consider the political thought of one of Europe's leading contemporary philosophers, Giorgio Agamben. Agamben is not yet well-known in the Anglo-American legal academy, but this has been changing recently with the publication of a series of books (collectively titled Homo Sacer) that address, at a ...
openaire +1 more source
Cutting Part Research of Machine for Cutting Mulberry Branch
Advanced Materials Research, 2011Cutting part is a key part of machine for cutting mulberry branch. The cutting part structure could influence quality and efficiency of machine for cutting mulberry branch, directly. To obtain a suitable cutting part structure, research of cutting part of machine for cutting mulberry branch is implemented in this paper. Firstly, the stress situation of
Yong Hou Sun, Ren Sheng Lai, Guo Cai Jin
openaire +1 more source
Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression
2010This 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
Degeneracy of Resonances: Branch Point and Branch Cuts in Parameter Space
International Journal of Theoretical Physics, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hernández, E. +3 more
openaire +2 more sources
Solving the Orienteering Problem through Branch-and-Cut
INFORMS Journal on Computing, 1998In the Orienteering Problem (OP), we are given an undirected graph with edge weights and node prizes. The problem calls for a simple cycle whose total edge weight does not exceed a given threshold, while visiting a subset of nodes with maximum total prize. This NP-hard problem arises in routing and scheduling applications. We describe a branch-and-cut
FISCHETTI, MATTEO +2 more
openaire +3 more sources
Small covering designs by branch-and-cut
Mathematical Programming, 2003A 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
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
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
Producing Elm Seeds on Cut Branches
Journal of Forestry, 1949Abstract Indoor pollination is now used regularly in breeding poplars, and it can be used in breeding other genera. Indoor pollination not only lengthens the breeding season by 2 to 8 weeks; it also enables the tree breeder to pollinate early-blooming trees by late-blooming trees, to work trees from several localities at the same time ...
openaire +1 more source