Results 121 to 130 of about 140,088 (167)

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

A note on branch-and-cut-and-price

Operations Research Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feillet, Dominique, Gendreau, Michel, Medaglia, Andrés, Walteros, José Luis   +3 more
openaire   +3 more sources

Declawing a graph: polyhedra and Branch-and-Cut algorithms

Journal of Combinatorial Optimization, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felipe C. Fragoso, Gilberto F. de Sousa Filho, Fábio Protti   +2 more
openaire   +1 more source

Assembly System Design: A Branch and Cut Approach

Management Science, 1998
This paper addresses the single-product assembly system design problem (ASDP), which seeks to minimize total cost by optimally integrating design (selecting the machine type to locate at each activated station) and operating issues (assigning tasks to observe precedence relationships and cycle time restrictions). We propose an effective branch-and-cut
Anulark Pinnoi, Wilbert E. Wilhelm
openaire   +2 more sources

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

Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

Networks, 2015
The quadratic minimum spanning tree problem (QMSTP) consists of finding a spanning tree of a graph G such that a quadratic cost function is minimized. In its adjacent only version (AQMSTP), interaction costs only apply for edges that share an endpoint.
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha   +2 more
openaire   +2 more sources

Branch-and-cut for complementarity-constrained optimization

Mathematical Programming Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Farias, I. R. jun., Kozyreff, E., Zhao, M.   +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

Monotonic Optimization: Branch and Cut Methods

2005
Monotonic optimization is concerned with optimization problems dealing with multivariate monotonic functions and differences of monotonic functions. For the study of this class of problems a general framework (Tuy, 2000a) has been earlier developed where a key role was given to a separation property of solution sets of monotonic inequalities similar to
Hoang Tuy, Faiz Al-Khayyal, Phan Thien Thach   +2 more
openaire   +1 more source

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audet, C., Savard, G., Zghal, W.
openaire   +1 more source