Results 261 to 270 of about 979,870 (292)

Multivalued Functions, Branch Points, and Cuts

2007
Because ei2π = 1, it is straightforward to see that if the argument of a complex variable z is increased by 2π, one obtains the same value of the complex variable. That is, for a given r and θ, we write $$ z(r,\theta ) = re^{i\theta } $$ (6.1a) Then $$ z(r,\theta + 2\pi ) = re^{i\theta } e^{2i\pi } = re^{i\theta } = z(r,\theta ) $$ (6 ...
openaire   +1 more source

Branch-and-Cut algorithm for the connected-cut problem

2014
Let 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, Fouilhoux, Pierre, Grappe, Roland, Lacroix, Mathieu, Pesneau, Pierre   +4 more
openaire   +1 more source

Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows

International Journal of Production Research, 2022
Ece Duman, Duygu TaŞ, BÜlent Çatay
exaly  

Machine Learning Techniques for Branch-and-Cut Methods: The Selection of Cutting Planes

The selection of cuts to be added to the current LP relaxation is one of the most critical task in Branch-and-Cut methods, since it strongly affects the performances of the algorithm. Recently, machine learning techniques have become popular to define effective cut selection strategies.
Giovanni Giallombardo, Giovanna Miglionico, Marcello Sammarra   +2 more
openaire   +4 more sources

Branch-and-Cut for the LOP

2022
Rafael Martí, Gerhard Reinelt
openaire   +1 more source

Integer Programming: Branch and Cut Algorithms, Branch and Cut

2012
openaire   +1 more source

Exact Branch-Price-and-Cut Algorithms for Vehicle Routing

Transportation Science, 2019
Luciano Costa, Claudio Contardo, Guy Desaulniers   +2 more
exaly  

Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

Management Science, 1996
Gerard Cornuejols
exaly  

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

INFORMS Journal on Computing, 2020
Lijun Wei, Zhi-Xing Luo, Roberto Baldacci   +2 more
exaly  

A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem

International Journal of Production Research, 2013
Leandro C Coelho, Gilbert Laporte
exaly