WELCOME TO THE LIBRARY!!!
What are you looking for Book "The Linear Ordering Problem" ? Click "Read Now PDF" / "Download", Get it for FREE, Register 100% Easily. You can read all your books for as long as a month for FREE and will get the latest Books Notifications. SIGN UP NOW!
eBook Download
BOOK EXCERPT:
Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.
Product Details :
Genre |
: Computers |
Author |
: Rafael Martí |
Publisher |
: Springer Science & Business Media |
Release |
: 2011-01-03 |
File |
: 181 Pages |
ISBN-13 |
: 9783642167294 |
eBook Download
BOOK EXCERPT:
Product Details :
Genre |
: Mathematics |
Author |
: Gerhard Reinelt |
Publisher |
: |
Release |
: 1985 |
File |
: 180 Pages |
ISBN-13 |
: UOM:39015015631123 |
eBook Download
BOOK EXCERPT:
Product Details :
Genre |
: Algorithms |
Author |
: Allen R. Mushi |
Publisher |
: |
Release |
: 1994 |
File |
: 98 Pages |
ISBN-13 |
: OCLC:605375514 |
eBook Download
BOOK EXCERPT:
The linear ordering problem (LOP), which consists in ordering M objects from their pairwise comparisons, is commonly applied in many areas of research. While efforts have been made to devise efficient LOP algorithms, little was done to verify if the obtained solutions are valid and thus if they have a meaningful interpretation. To remedy this problem, we propose to characterize the reliability of the LOP solutions by adopting a probabilistic perspective where the results of pairwise comparisons are modeled as Bernoulli variables with a common parameter which we estimate from the observed data. Estimation by brute-force enumeration has a prohibitive complexity of O(M!) we thus reformulate the problem and introduce a concept of Slater's spectrum which generalizes Slater's index, and next, devising an efficient algorithm to find the spectrum, we lower the complexity to O(M22 M ) which is manageable for moderate-size LOPs. Furthermore, with a minor modification of the algorithm, we are able to find all solutions of the LOP. Numerical examples on synthetic and real-world data are shown and the Python-implemented algorithms are publicly available.
Product Details :
Genre |
: |
Author |
: Leszek Szczecinski |
Publisher |
: |
Release |
: 2023 |
File |
: 0 Pages |
ISBN-13 |
: OCLC:1378826676 |
eBook Download
BOOK EXCERPT:
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
Product Details :
Genre |
: |
Author |
: Rahimeh Neamatian Monemi |
Publisher |
: |
Release |
: 2014 |
File |
: 0 Pages |
ISBN-13 |
: OCLC:911291108 |
eBook Download
BOOK EXCERPT:
Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.
Product Details :
Genre |
: Computers |
Author |
: Rafael Martí |
Publisher |
: Springer |
Release |
: 2011-01-05 |
File |
: 172 Pages |
ISBN-13 |
: 3642167284 |
eBook Download
BOOK EXCERPT:
Linear Orderings
Product Details :
Genre |
: Mathematics |
Author |
: |
Publisher |
: Academic Press |
Release |
: 1982-06-01 |
File |
: 507 Pages |
ISBN-13 |
: 9780080874142 |
eBook Download
BOOK EXCERPT:
Product Details :
Genre |
: |
Author |
: John Milton Roberts |
Publisher |
: |
Release |
: 1990 |
File |
: 80 Pages |
ISBN-13 |
: OCLC:64017811 |
eBook Download
BOOK EXCERPT:
Product Details :
Genre |
: |
Author |
: Antoon Kolen |
Publisher |
: |
Release |
: 1986 |
File |
: 8 Pages |
ISBN-13 |
: OCLC:64264220 |
eBook Download
BOOK EXCERPT:
Product Details :
Genre |
: |
Author |
: Eberhard Girlich |
Publisher |
: |
Release |
: 1998 |
File |
: 8 Pages |
ISBN-13 |
: OCLC:75928857 |