نتایج جستجو برای: branch and cut
تعداد نتایج: 16840165 فیلتر نتایج به سال:
Given a double round-robin tournament, the Traveling Umpire Problem (TUP) seeks to assign umpires to the games of the tournament while minimizing the total distance traveled by the umpires. The assignment must satisfy constraints that prevent umpires from seeing teams and venues too often, while making sure all games have umpires in every round, and all umpires visit all venues. We propose a ne...
The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP. We investigate three classes of valid inequalities for the CVRP, multistars, pathbin inequalities and hypotours and give computational results we obtained with a Branch and Cut...
abstract compound is a word-formation process that are made two free morpheme (independent) and forms a new word with a new meaning that consists of meaning of both two component of compound. avestan language is one of the ancient iranian languages that is one of the indo-iranian languages. indo-iranian languages is one branch of indo-european languages. structure of compound noun and adjectiv...
We propose a branch and cut algorithm for the Pallet Loading Problem. The 0-1 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maximum independent set problem to use the partial linear description of its associated polyhedron. F...
The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. We are interested in the exact solution of the problem: an improved version of a branch-and-cut algorithm is proposed. Extensive computational experiments are carried out on a set of instances from three applications previously dis...
We extend the theoretical foundations of the branch-and-cut method using lift-and-project cuts for a broader class of disjunctive constraints , and also present a new, substantially improved disjunctive cut generator. Employed together with an eecient commercial MIP solver, our code is a robust, general purpose method for solving mixed integer programs. We present extensive computational experi...
The Capacitated Facility Location Problem (CFLP) consists of locating a set of facilities with capacity constraints to satisfy the demands of a set of clients at the minimum cost. In this paper we propose a simple and effective heuristic for largescale instances of CFLP. The heuristic is based on a Lagrangean relaxation which is used to select a subset of “promising” variables forming the core ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید