Results 201 to 210 of about 14,097 (243)
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
Branch-and-cut for complementarity-constrained optimization
Mathematical Programming Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael R. de Farias Jr. +2 more
openaire +3 more sources
Supervised learning in Branch-and-cut strategies
Proceedings of the 2nd international Conference on Big Data, Cloud and Applications, 2017Branch-and-Cut is a powerful algorithm used for solving MILP problems. It involves two main sub-algorithms: branch-and-bound and cutting plane. On the one hand, the branch-and-bound algorithm comprises two strategies that are node selection strategy and branching strategy.
Abdellatif El Afia +1 more
openaire +1 more source
A branch‐and‐cut algorithm for the preemptive swapping problem
Networks, 2009AbstractIn the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices.
Charles Bordenave +2 more
openaire +2 more sources
1996
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
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 +4 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 +3 more sources
Branch‐and‐cut algorithms for the ‐arborescence star problem
International Transactions in Operational Research, 2020AbstractGiven a connected digraph, a vertex designated as the root, and an integer , the ‐arborescence star problem is to choose vertices besides the root and define a reverse arborescence spanning them. Each vertex outside the arborescence must be assigned to one vertex inside it.
Armando Honorio Pereira +2 more
openaire +2 more sources
A Branch-and-Cut Algorithm for the Median-Path Problem
Computational Optimization and Applications, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pasquale Avella +3 more
openaire +3 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