Results 111 to 120 of about 16,265 (145)
Some of the next articles are maybe not open access.
A branch-and-cut algorithm for the equicut problem
Mathematical Programming, 1997We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane procedure that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge sets that define an equicut. The cuts are generated by several separation procedures that will be described in
Brunetta, L. +2 more
openaire +4 more sources
A branch-and-cut algorithm for multiple sequence alignment
Mathematical Programming, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Althaus +3 more
openaire +2 more sources
A branch-and-cut algorithm for vehicle routing problems
Annals of Operations Research, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araque G., J. R. +3 more
openaire +2 more sources
A Branch and Cut Algorithm for a Steiner Tree-Star Problem
INFORMS Journal on Computing, 1996This paper deals with a Steiner tree-star problem that is a special case of the degree constrained node-weighted Steiner tree problem. This problem arises in the context of designing telecommunications networks for digital data service, provided by regional telephone companies.
Lee, Youngho +2 more
openaire +1 more source
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023Patrick Møller Jensen +2 more
exaly
Electric Vehicle Charging Scheduling using Branch and Cut Algorithm
2023 3rd International Conference on Advanced Research in Computing (ICARC), 2023Adhyan Vijeta Mittal +4 more
openaire +1 more source
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
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
Operations Research, 2021Artur Alves Pessoa +2 more
exaly
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004Vladimir Kolmogorov
exaly