A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
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 Novel Branch and Bound Pure Integer Programming Phase Unwrapping Algorithm for Dual-Baseline InSAR
Frontiers in Environmental Science, 2022 Phase unwrapping (PU) is an important bottleneck restricting the practical application of the interferometric synthetic aperture radar (InSAR) technique.
Hui Liu +6 more
doaj +1 more source
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming [PDF]
European Journal of Operational Research, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fischetti, Matteo, Monaci, Michele
openaire +4 more sources
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
IEEE Access, 2013 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
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm [PDF]
European Journal of Operational Research, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tolga Bektaş +3 more
openaire +4 more sources
An exact algorithm for design of content delivery networks in MPLS environment
Journal of Telecommunications and Information Technology, 2004 Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques.
Krzysztof Walkowiak
doaj +1 more source
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
A branch‐and‐cut algorithm for the Team Orienteering Problem [PDF]
International Transactions in Operational Research, 2017 AbstractThe Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed.
Bianchessi, Nicola +2 more
openaire +4 more sources
Mean field approximation for solving QUBO problems.
PLoS ONE, 2022 The Quadratic Unconstrained Binary Optimization (QUBO) problem is NP-hard. Some exact methods like the Branch-and-Bound algorithm are suitable for small problems.
Máté Tibor Veszeli, Gábor Vattay
doaj +1 more source