Facets of the linear ordering polytope
From MaRDI portal
Publication:3698819
DOI10.1007/BF01582010zbMath0577.05035OpenAlexW2048346525MaRDI QIDQ3698819
Martin Grötschel, Michael Jünger, Gerhard Reinelt
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582010
convex hullfacets of polyhedralinear orderingscomplete digraphpermutation problemtriangulation problemacyclic tournamentslinear ordering problems
Integer programming (90C10) Directed graphs (digraphs), tournaments (05C20) Polytopes and polyhedra (52Bxx)
Related Items
More facets from fences for linear ordering and acyclic subgraph polytopes, On the acyclic subgraph polytope, Acyclic Orientations with Path Constraints, A branch-and-cut algorithm for vehicle routing problems, Applying mod-\(k\)-cuts for solving linear ordering problems, A survey on the linear ordering problem for weighted or unweighted tournaments, The corridor allocation problem, An inexact algorithm for the sequential ordering problem, Probabilistic biclassification and random variable representations, On the partial order polytope of a digraph, An integer programming approach for the search of discretization orders in distance geometry problems, An exact algorithm for the edge coloring by total labeling problem, Commutative algebra of statistical ranking, Polyhedral Combinatorics in Combinatorial Optimization, A minimum violations ranking method, The interval order polytope of a digraph, Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, General transitivity conditions for fuzzy reciprocal preference matrices., Revised GRASP with path-relinking for the linear ordering problem, A linear ordering problem with weighted rank, Optimal solutions for the double row layout problem, A branch-and-bound algorithm for the linear ordering problem with cumulative costs, Crossing Minimization in Storyline Visualization, Facet Generating Techniques, Facets of linear signed order polytopes., A lexicographic semiorder polytope and probabilistic representations of choice, Weak order polytopes., Fence facets from non-regular graphs for the linear ordering polytope, Facets from gadgets, Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures, Induced binary probabilities and the linear ordering polytope: A status report, Geometric and combinatorial properties of the polytope of binary choice probabilities, A branch-and-cut algorithm for a resource-constrained scheduling problem, The strongest facets of the acyclic subgraph polytope are unknown, The linear extension polytope of a poset, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, An integer programming approach to optimal basic block instruction scheduling for single-issue processors, Rank aggregation in cyclic sequences, An analog of the Cook theorem for polytopes, The linear ordering problem with cumulative costs, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Analysis of a generalized linear ordering problem via integer programming, Multiprocessor scheduling under precedence constraints: polyhedral results, On the exact solution of a facility layout problem, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, On the combinatorial structure of chromatic scheduling polytopes, Median linear orders: Heuristics and a branch and bound algorithm, How to recycle your facets, Primary facets of order polytopes, Diffuse scattering on graphs, Computational Approaches to Max-Cut, Global Approaches for Facility Layout and VLSI Floorplanning, A new formulation for the traveling deliveryman problem, Facets of the dynamic monopoly polytope: linear ordering formulation, A branch-and-cut algorithm for the target visitation problem, New exact approaches to row layout problems, Spectra of Symmetrized Shuffling Operators, Weighted graphs defining facets: A connection between stable set and linear ordering polytopes, Cycle-based facets of chromatic scheduling polytopes, Valid inequalities and facets of the capacitated plant location problem, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Combinatorial optimization and small polytopes, Facets and algorithms for capacitated lot sizing, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, On the linear ordering problem and the rankability of data, Computing in combinatorial optimization, Analysis of multinomial models under inequality constraints: applications to measurement theory, Workload balancing and loop layout in the design of a flexible manufacturing system, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference, Recent trends in combinatorial optimization, Signed orders, choice probabilities, and linear polytopes, The Rankability of Data, A combinatorial study of partial order polytopes, Independent random utility representations
Cites Work
