Results 11 to 20 of about 143,487 (265)
Solving the Traveling Salesman Problem with release dates via branch and cut
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
BDDs in a Branch and Cut Framework [PDF]
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
openaire +4 more sources
Learning to Configure Separators in Branch-and-Cut
Cutting planes are crucial in solving mixed integer linear programs (MILP) as they facilitate bound improvements on the optimal solution. Modern MILP solvers rely on a variety of separators to generate a diverse set of cutting planes by invoking the separators frequently during the solving process.
Sirui Li +3 more
openaire +3 more sources
An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
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
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
The study focuses on the strategic decisions including on the location and capacity of stations and the fleet size for designing the one-way station-based carsharing systems. Under demand uncertainty, we introduce a two-stage risk-averse stochastic model
Kai Zhang +3 more
doaj +1 more source
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) consists of minimizing the assignment cost of a set of jobs to machines, each having associated therewith a capacity constraint.
Pasquale Avella +2 more
doaj +1 more source
The Coon amplitude is a q-deformed generalization of the Veneziano amplitude exhibiting a semi-infinite sequence of poles that converge on an accumulation point, from which a branch cut emerges. A number of recent papers have provided compelling evidence
Christian Baadsgaard Jepsen
doaj +1 more source
ObjectiveTo determine the optimal ultrasound (US) cut-off values for cranial and extracranial arteries intima media thickness (IMT) to discriminate between patients with and without giant cell arteritis (GCA).MethodsRetrospective observational study ...
Katerine López-Gloria +19 more
doaj +1 more source
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

