Results 11 to 20 of about 14,097 (243)
BDDs in a Branch and Cut Framework [PDF]
, 2005 Branch & Cut is today's state-of-the-art method to solve 0/1-integer linear programs. Important for the success of this method is the generation of strong valid inequalities, which tighten the linear programming relaxation of 0/1-IPs and thus allow for early pruning of parts of the search tree.
Bernd Becker 0001 +3 more
core +7 more sources
Pruning by Isomorphism in Branch-and-Cut
Mathematical Programming, 2001 The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating cuts. The cuts are non-standard, cutting integer feasible solutions but leaving the optimal value of the problem unchanged.
Francois Margot (3885187) +1 more
openaire +4 more sources
Exploiting planarity in separation routines for the symmetric travelling salesman problem [PDF]
, 2008 At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Pearson, N, Letchford, A N
core +5 more sources
Exploiting sparsity in pricing routines for the capacitated arc routing problem [PDF]
, 2009 The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price.
Oukil, A, Letchford, A N
core +4 more sources
Revista Facultad de Ingeniería Universidad de Antioquia, 2016 This paper presents a hybrid algorithm for solving the Capacitated Vehicle Routing Problem with practical three-dimensional loading constraint. This problem is known as 3L-CVRP (Three-dimensional Loading Capacitated Vehicle Routing Problem).
Luis Miguel Escobar-Falcón +4 more
doaj +3 more sources
Solving the Traveling Salesman Problem with release dates via branch and cut
EURO Journal on Transportation and Logistics, 2023 In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over ...
Agustín Montero +2 more
doaj +1 more source
Science and Technology Indonesia, 2019 Capacitated Vehicle Routing Problem (CVRP) is a problem that discusses how to choose several routes that must be passed by a number of transport vehicles in the process of distributing goods that combine customer demand with regard to transport capacity.
Evi Yuliza, F.M Puspita
doaj +1 more source
An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
International Journal of Production Management and Engineering, 2017 In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. For achieving this purpose, a historical perspective of the development of enumeration methods in the field of bi-level linear programming is considered ...
Arsalan Rahmani, Majid Yousefikhoshbakht
doaj +1 more source
A Wheeler–DeWitt Non-Commutative Quantum Approach to the Branch-Cut Gravity
Universe, 2023 In this contribution, motivated by the quest to understand cosmic acceleration, based on the theory of Hořava–Lifshitz and on the branch-cut gravitation, we investigate the effects of non-commutativity of a mini-superspace of variables obeying the ...
Benno Bodmann +8 more
doaj +1 more source
EURO Journal on Computational Optimization, 2013 We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP.
Mounira Groiez +3 more
doaj +1 more source