FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W596146530> ?p ?o ?g. }

• W596146530 abstract "Linear Ordering Problem (LOP) has receive significant attention in different areas of application, ranging from transportation and scheduling to economics and even archeology and mathematical psychology. It is classified as a NP-hard problem. Assume a complete weighted directed graph on V n , |V n |= n. A permutation of the elements of this finite set of vertices is a linear order. Now let p be a given fixed integer number, 0 ≤ p ≤ n. The p-Fixed Cardinality Linear Ordering Problem (FCLOP) is looking for a subset of vertices containing p nodes and a linear order on the nodes in S. Graphically, there exists exactly one directed arc between every pair of vertices in an LOP feasible solution, which is also a complete cycle-free digraph and the objective is to maximize the sum of the weights of all the arcs in a feasible solution. In the FCLOP, we are looking for a subset S ⊆ V n such that |S|= p and an LOP on these S nodes. Hence the objective is to find the best subset of the nodes and an LOP over these p nodes that maximize the sum of the weights of all the arcs in the solution. Graphically, a feasible solution of the FCLOP is a complete cycle-free digraph on S plus a set of n − p vertices that are not connected to any of the other vertices. There are several studies available in the literature focused on polyhedral aspects of the linear ordering problem as well as various exact and heuristic solution methods. The fixed cardinality linear ordering problem is presented for the first time in this PhD study, so as far as we know, there is no other study in the literature that has studied this problem. The linear ordering problem is already known as a NP-hard problem. However one sees that there exist many instances in the literature that can be solved by CPLEX in less than 10 seconds (when p = n), but once the cardinality number is limited to p (p < n), the instance is not anymore solvable due to the memory issue. We have studied the polytope corresponding to the FCLOP for different cardinality values. We have identified dimension of the polytope, proposed several classes of valid inequalities and showed that among these sets of valid inequalities, some of them are defining facets for the FCLOP polytope for different cardinality values. We have then introduced a Relax-and-Cut algorithm based on these results to solve instances of the FCLOP. To solve the instances of the problem, in the beginning, we have applied the Lagrangian relaxation algorithm. We have studied different relaxation strategies and compared the dual bound obtained from each case to detect the most suitable subproblem. Numerical results show that some of the relaxation strategies result better dual bound and some other contribute more in reducing the computational time and provide a relatively good dual bound in a shorter time. We have also implemented a Lagrangian decomposition algorithm, decom-6 posing the FCLOP model to three subproblems (instead of only two subproblems). The interest of decomposing the FCLOP model to three subproblems comes mostly from the nature of the three subproblems, which are relatively quite easier to solve compared to the initial FCLOP model. Numerical results show a significant improvement in the quality of dual bounds for several instances. We could also obtain relatively quite better dual bounds in a shorter time comparing to the other relaxation strategies. We have proposed a cutting plane algorithm based on the pure relaxation strategy. In this algorithm, we firstly relax a subset of constraints that due to the problem structure, a very few number of them are active. Then in the course of the branch-and-bound tree we verify if there exist any violated constraint among the relaxed constraints or. Then the characterized violated constraints will be globally added to the model. (...)" @default.
• W596146530 created "2016-06-24" @default.
• W596146530 creator A5041040525 @default.
• W596146530 date "2014-12-02" @default.
• W596146530 modified "2023-09-23" @default.
• W596146530 title "Fixed cardinality linear ordering problem, polyhedral studies and solution methods" @default.
• W596146530 cites W1501922675 @default.
• W596146530 cites W1518179162 @default.
• W596146530 cites W1548885290 @default.
• W596146530 cites W1734243449 @default.
• W596146530 cites W1976786056 @default.
• W596146530 cites W2003755947 @default.
• W596146530 cites W2005173957 @default.
• W596146530 cites W2008276232 @default.
• W596146530 cites W2009803313 @default.
• W596146530 cites W2017697298 @default.
• W596146530 cites W2019710194 @default.
• W596146530 cites W2056182059 @default.
• W596146530 cites W2058748455 @default.
• W596146530 cites W2067309697 @default.
• W596146530 cites W2075716284 @default.
• W596146530 cites W2100760548 @default.
• W596146530 cites W2130469840 @default.
• W596146530 cites W2140447370 @default.
• W596146530 cites W2989242881 @default.
• W596146530 hasPublicationYear "2014" @default.
• W596146530 type Work @default.
• W596146530 sameAs 596146530 @default.
• W596146530 citedByCount "0" @default.
• W596146530 crossrefType "dissertation" @default.
• W596146530 hasAuthorship W596146530A5041040525 @default.
• W596146530 hasConcept C114614502 @default.
• W596146530 hasConcept C118615104 @default.
• W596146530 hasConcept C121332964 @default.
• W596146530 hasConcept C124101348 @default.
• W596146530 hasConcept C126255220 @default.
• W596146530 hasConcept C146380142 @default.
• W596146530 hasConcept C199360897 @default.
• W596146530 hasConcept C21308566 @default.
• W596146530 hasConcept C24890656 @default.
• W596146530 hasConcept C2779145032 @default.
• W596146530 hasConcept C33923547 @default.
• W596146530 hasConcept C41008148 @default.
• W596146530 hasConcept C41045048 @default.
• W596146530 hasConcept C87117476 @default.
• W596146530 hasConcept C97137487 @default.
• W596146530 hasConceptScore W596146530C114614502 @default.
• W596146530 hasConceptScore W596146530C118615104 @default.
• W596146530 hasConceptScore W596146530C121332964 @default.
• W596146530 hasConceptScore W596146530C124101348 @default.
• W596146530 hasConceptScore W596146530C126255220 @default.
• W596146530 hasConceptScore W596146530C146380142 @default.
• W596146530 hasConceptScore W596146530C199360897 @default.
• W596146530 hasConceptScore W596146530C21308566 @default.
• W596146530 hasConceptScore W596146530C24890656 @default.
• W596146530 hasConceptScore W596146530C2779145032 @default.
• W596146530 hasConceptScore W596146530C33923547 @default.
• W596146530 hasConceptScore W596146530C41008148 @default.
• W596146530 hasConceptScore W596146530C41045048 @default.
• W596146530 hasConceptScore W596146530C87117476 @default.
• W596146530 hasConceptScore W596146530C97137487 @default.
• W596146530 hasLocation W5961465301 @default.
• W596146530 hasOpenAccess W596146530 @default.
• W596146530 hasPrimaryLocation W5961465301 @default.
• W596146530 hasRelatedWork W1882229198 @default.
• W596146530 hasRelatedWork W2040958198 @default.
• W596146530 hasRelatedWork W2112227729 @default.
• W596146530 hasRelatedWork W2183312547 @default.
• W596146530 hasRelatedWork W2266147465 @default.
• W596146530 hasRelatedWork W2308014886 @default.
• W596146530 hasRelatedWork W2436424524 @default.
• W596146530 hasRelatedWork W2461829726 @default.
• W596146530 hasRelatedWork W2474846329 @default.
• W596146530 hasRelatedWork W2569746101 @default.
• W596146530 hasRelatedWork W2593041831 @default.
• W596146530 hasRelatedWork W2795074925 @default.
• W596146530 hasRelatedWork W2795976437 @default.
• W596146530 hasRelatedWork W2798325735 @default.
• W596146530 hasRelatedWork W2952881406 @default.
• W596146530 hasRelatedWork W2962820278 @default.
• W596146530 hasRelatedWork W3037538996 @default.
• W596146530 hasRelatedWork W2182195738 @default.
• W596146530 hasRelatedWork W2186198950 @default.
• W596146530 hasRelatedWork W3101279549 @default.
• W596146530 isParatext "false" @default.
• W596146530 isRetracted "false" @default.
• W596146530 magId "596146530" @default.
• W596146530 workType "dissertation" @default.