Results 221 to 230 of about 41,581 (262)

Classical cuts for mixed-integer programming and branch-and-cut

Mathematical Methods of Operations Research (ZOR), 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Branch and cut algorithms

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

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

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).
Martin Bergner, Marco E. Lübbecke, Jonas T. Witt   +2 more
openaire   +1 more source

A branch-and-cut algorithm for the equicut problem

Mathematical Programming, 1997
We 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., CONFORTI, MICHELANGELO, Rinaldi, G.   +2 more
openaire   +4 more sources

Branch-and-cut for complementarity-constrained optimization

Mathematical Programming Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael R. de Farias Jr., Ernee Kozyreff, Ming Zhao   +2 more
openaire   +2 more sources

Supervised learning in Branch-and-cut strategies

Proceedings of the 2nd international Conference on Big Data, Cloud and Applications, 2017
Branch-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, Mohamed Mustapha Kabbaj   +1 more
openaire   +1 more source

A branch‐and‐cut algorithm for the preemptive swapping problem

Networks, 2009
AbstractIn 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, Michel Gendreau, Gilbert Laporte   +2 more
openaire   +2 more sources

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 Jr.   +2 more
openaire   +1 more source