Outer-Approximation based Branch-and-Cut algorithm
A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
... Dinkelbach’s-like algorithm (Dinkelbach, 1967). This algorithm clustered exactly, for the first time, several data sets, including the famous Fisher’s 150 iris (Fisher, ...plane algorithm is halted ...
14
In this paper we present a branch-and-cut algorithm for
... the smallest cost. (The determination of the cost of an itinerary is discussed below.) The primary objectives of the TDS problem are to min- imize deadhead miles and equalize the loaded drive-time of the drivers. By ...
13
A branch-and-price-and-cut algorithm for the pattern minimization problem
... A BRANCH-AND-PRICE-AND-CUT ALGORITHM FOR THE PMP Belov [ 3 ] considered the combined trim loss and pattern minimization ...is based on the Gilmore and Gomory formulation [ 8 ] for the standard ...
19
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph
... In this paper, we contribute to the efficient solution of the k-MBS prob- lem. We provide an integer linear programming formulation to the problem strengthened by the introduction of families of valid inequalities of the ...
39
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
... inequalities based on the Benders decomposition and the set-packing structure embedded within the ...a branch-and-cut algorithm, they were able to solve instances with up to 50 ...devised ...
16
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
... The first set of instances generated by H`a et al. contains random instances based on directed graphs. Their characteristics are shown in Table 1. All these instances have 500 vertices and up to 1500 arcs, and the ...
20
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem
... a branch-price-and-cut algorithm is very successful (Desaulniers et ...a branch-price-and-cut algorithm based on a set partitioning formulation, which allows for instances ...
31
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm
... a branch-and-cut algorithm for the ...our branch-and-cut algorithm is capable to solve to optimality instances with up to 200 vertices in reasonable ...
14
A max-cut approximation using a graph based MBO scheme
... In recent years a new type of approach to approximating such graph problems has gained traction. Models from the world of partial differential equations and variational methods that exhibit behaviour of the kind that ...
49
An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
... Hamedan Branch, Islamic Azad University, Hamedan, ...new branch-and-cut algorithm for mixed integer bi-level programming is ...using branch and bound method based on them, and an ...
10
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
... a branch-cut-and-price algorithm for the two-echelon capaci- tated vehicle routing problem in which delivery of products from a depot to customers is performed using intermediate depots called ...Our ...
27
An Interactive Image Segmentation Algorithm Based on Graph Cut
... algorithms based on graph cut, users should often maker many foreground and background points [1], which is usually ...our algorithm, FG (foreground) is constituted by points in the inner one, and BG ...
5
Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
... Observe that in a given circuit with at least three nodes, one of the two nodes adjacent to the acting depot has a smaller index than the other. In order to break these symmetries, we enforce that the first node visited ...
36
A branch-and-bound based algorithm for nonconvex multiobjective optimization
... an approximation of the set of globally optimal solutions for the MOPs with predefined quality in finite ...new algorithm will be introduced after presenting a typical Branch-and-Bound ...
30
Bi objective branch and cut algorithms based on LP relaxation and bound sets
... set based branch–and–cut algorithm for solving general bi–objective combinatorial optimization ...The algorithm was tested using both an explicit and implicit representation of lower ...
27
A Linear Outer Approximation of Line Losses for DC-based Optimal Power Flow Problems
... First, on the one hand, the LLLF method is a top-down approach: total losses are estimated using a reference point, then distributed onto the lines and buses in order to account for thermal limits and power balance. In ...
15
A branch-and-cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variables
... BAC algorithm for SMIPs with mixed-binary variables in both stages derived by ...space based on the extensive form or deterministic equivalent problem (DEP) of problem ...a branch-and-bound method ...
18
The Team Orienteering Problem: Formulations and Branch-Cut and Price
... The literature on the Team Orienteering Problem - TOP is quite recent. It has been proposed by Butt and Cavalier(1994) [3] with the name Multiple Tour Maximum Collection Problem. Two years later, the paper by Chao et ...
14
A Novel Image Segmentation Algorithm Based on Graph Cut Optimization Problem
... Han et al. proposed a new model to deal with the image segmentation problem. This model was constructed through analysis of the characteristic of textile/fabric images. The main innovation in this work is its ...
6
An Efficient Approximation Algorithm for Max Cut
... the cut if θ i j is ...the approximation solution of the quadratic program y i is set to 1 if and only if a i ...randomized algorithm a certain number of times to improve the probability of getting a ...
5