FRINK Linked Data Fragments server

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

• W1522532613 abstract "This thesis examines the Orthogonal Latin Squares (OLS) problem from the viewpoint of Integer and Constraint programming. An Integer Programming (IP) model is proposed and the associated polytope is analysed. We identify several families of strong valid inequalities, namely inequalities arising from cliques, odd holes, antiwebs and wheels of the associated intersection graph. The dimension of the OLS polytope is established and it is proved that certain valid inequalities are facet-inducing. This analysis reveals also a new family of facet-defining inequalities for the polytope associated with the Latin square problem. Separation algorithms of the lowest complexity are presented for particular families of valid inequalities. We illustrate a method for reducing problem's symmetry, which extends previously known results. This allows us to devise an alternative proof for the non-existence of an OLS structure for n = 6, based solely on Linear Programming. Moreover, we present a more general Branch & Cut algorithm for the OLS problem. The algorithm exploits problem structure via integer preprocessing and a specialised branching mechanism. It also incorporates families of strong valid inequalities. Computational analysis is conducted in order to illustrate the significant improvements over simple Branch & Bound. Next, the Constraint Programming (CP) paradigm is examined. Important aspects of designing an efficient CP solver, such as branching strategies and constraint propagation procedures, are evaluated by comprehensive, problem-specific, experiments. The CP algorithms lead to computationally favourable results. In particular, the infeasible case of n = 6, which requires enumerating the entire solution space, is solved in a few seconds. A broader aim of our research is to successfully integrate IP and CP. Hence, we present ideas concerning the unification of IP and CP methods in the form of hybrid algorithms. Two such algorithms are presented and their behaviour is analysed via experimentation. The main finding is that hybrid algorithms are clearly more efficient, as problem size grows, and exhibit a more robust performance than traditional IP and CP algorithms. A hybrid algorithm is also designed for the problem of finding triples of Mutually Orthogonal Latin Squares (MOLS). Given that the OLS problem is a special form of an assignment problem, the last part of the thesis considers multidimensional assignment problems. It introduces a model encompassing all assignment structures, including the case of MOLS. A necessary condition for the existence of an assignment structure is revealed. Relations among assignment problems are also examined, leading to a proposed hierarchy. Further, the polyhedral analysis presented unifies and generalises previous results." @default.
• W1522532613 created "2016-06-24" @default.
• W1522532613 creator A5063820346 @default.
• W1522532613 date "2003-01-01" @default.
• W1522532613 modified "2023-09-24" @default.
• W1522532613 title "Integer and Constraint programming methods for mutually Orthogonal Latin Squares" @default.
• W1522532613 hasPublicationYear "2003" @default.
• W1522532613 type Work @default.
• W1522532613 sameAs 1522532613 @default.
• W1522532613 citedByCount "3" @default.
• W1522532613 countsByYear W15225326132012 @default.
• W1522532613 countsByYear W15225326132021 @default.
• W1522532613 crossrefType "dissertation" @default.
• W1522532613 hasAuthorship W1522532613A5063820346 @default.
• W1522532613 hasConcept C114614502 @default.
• W1522532613 hasConcept C126255220 @default.
• W1522532613 hasConcept C137631369 @default.
• W1522532613 hasConcept C145691206 @default.
• W1522532613 hasConcept C173404611 @default.
• W1522532613 hasConcept C199360897 @default.
• W1522532613 hasConcept C2778770139 @default.
• W1522532613 hasConcept C33923547 @default.
• W1522532613 hasConcept C41008148 @default.
• W1522532613 hasConcept C41045048 @default.
• W1522532613 hasConcept C50797617 @default.
• W1522532613 hasConcept C56086750 @default.
• W1522532613 hasConcept C97137487 @default.
• W1522532613 hasConceptScore W1522532613C114614502 @default.
• W1522532613 hasConceptScore W1522532613C126255220 @default.
• W1522532613 hasConceptScore W1522532613C137631369 @default.
• W1522532613 hasConceptScore W1522532613C145691206 @default.
• W1522532613 hasConceptScore W1522532613C173404611 @default.
• W1522532613 hasConceptScore W1522532613C199360897 @default.
• W1522532613 hasConceptScore W1522532613C2778770139 @default.
• W1522532613 hasConceptScore W1522532613C33923547 @default.
• W1522532613 hasConceptScore W1522532613C41008148 @default.
• W1522532613 hasConceptScore W1522532613C41045048 @default.
• W1522532613 hasConceptScore W1522532613C50797617 @default.
• W1522532613 hasConceptScore W1522532613C56086750 @default.
• W1522532613 hasConceptScore W1522532613C97137487 @default.
• W1522532613 hasLocation W15225326131 @default.
• W1522532613 hasOpenAccess W1522532613 @default.
• W1522532613 hasPrimaryLocation W15225326131 @default.
• W1522532613 hasRelatedWork W128369835 @default.
• W1522532613 hasRelatedWork W136910234 @default.
• W1522532613 hasRelatedWork W137285713 @default.
• W1522532613 hasRelatedWork W153288811 @default.
• W1522532613 hasRelatedWork W1729276322 @default.
• W1522532613 hasRelatedWork W173023041 @default.
• W1522532613 hasRelatedWork W1999419587 @default.
• W1522532613 hasRelatedWork W2005167978 @default.
• W1522532613 hasRelatedWork W2104146946 @default.
• W1522532613 hasRelatedWork W2151140685 @default.
• W1522532613 hasRelatedWork W2521426814 @default.
• W1522532613 hasRelatedWork W2561818523 @default.
• W1522532613 hasRelatedWork W2565581500 @default.
• W1522532613 hasRelatedWork W2785532996 @default.
• W1522532613 hasRelatedWork W2789120054 @default.
• W1522532613 hasRelatedWork W2922211062 @default.
• W1522532613 hasRelatedWork W3023611021 @default.
• W1522532613 hasRelatedWork W333055030 @default.
• W1522532613 hasRelatedWork W631389544 @default.
• W1522532613 hasRelatedWork W75447996 @default.
• W1522532613 isParatext "false" @default.
• W1522532613 isRetracted "false" @default.
• W1522532613 magId "1522532613" @default.
• W1522532613 workType "dissertation" @default.