Results 231 to 240 of about 41,581 (262)
Some of the next articles are maybe not open access.
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
Function evaluation on branch cuts
ACM SIGSAM Bulletin, 1996Albert D. Rich, David J. Jeffrey
openaire +1 more source
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
INFORMS Journal on Computing, 2023Claudio Contardo, Andrea Lodi
exaly
Branch-and-Cut algorithm for the connected-cut problem
2014Let G=(V,E) be an undirected connected graph. Let W be a subset of V, distinct from V. The set W is said proper when it is non-empty. We denote by δ(W), the set of edges of E having exactly one endnode in W. A set F is called a cut of G, if there exists a proper subset W of V such that F=δ(W).
Borne, Sylvie +4 more
openaire +1 more source
A branch-and-price algorithm for the two-stage guillotine cutting stock problem
Journal of the Operational Research Society, 2013Mehdi Mrad, Mohamed Haouari
exaly