Cited in
(95)- Scatter Search and Path Relinking: Advances and Applications
- scientific article; zbMATH DE number 4204191 (Why is no real title available?)
- On the feedback vertex set problem for a planar graph
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- A minimum violations ranking method
- Applying mod-\(k\)-cuts for solving linear ordering problems
- The linear ordering problem with clusters: a new partial ranking
- scientific article; zbMATH DE number 2013555 (Why is no real title available?)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- The linear ordering problem: instances, search space analysis and algorithms
- Determining the automorphism group of the linear ordering polytope
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- The generalized assignment problem: Valid inequalities and facets
- Fifty-plus years of combinatorial integer programming
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
- Signed orders, choice probabilities, and linear polytopes
- Facets of linear signed order polytopes.
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- Computational results of an interior point algorithm for large scale linear programming
- Exact algorithms for the quadratic linear ordering problem
- The quadratic assignment problem. Theory and algorithms
- NP-hardness results for the aggregation of linear orders into median orders
- The strongest facets of the acyclic subgraph polytope are unknown
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Rank aggregation in cyclic sequences
- Lagrangian relaxation and pegging test for linear ordering problems
- Primary facets of order polytopes
- Computational approaches to MAX-cut
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- The median procedure in the semilattice of orders
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- An experimental evaluation of a scatter search for the linear ordering problem
- scientific article; zbMATH DE number 5117490 (Why is no real title available?)
- The complexity of computing medians of relations.
- A cutting-plane approach to the edge-weighted maximal clique problem
- GraphBase
- xQx
- RAMP
- ABACUS
- PORTA
- Scatter Search
- OpenSolver
- HUHFA
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Induced binary probabilities and the linear ordering polytope: A status report
- On the integral dicycle packings and covers and the linear ordering polytope
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- A cutting plane algorithm for a clustering problem
- Generalized transitive tournaments and doubly stochastic matrices
- A note on small linear-ordering polytopes
- On VLSI interconnect optimization and linear ordering problem
- Revised GRASP with path-relinking for the linear ordering problem
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Parameterized algorithmics for linear arrangement problems
- Independent random utility representations
- scientific article; zbMATH DE number 3902393 (Why is no real title available?)
- Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures
- scientific article; zbMATH DE number 6006014 (Why is no real title available?)
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
- The biorder polytope
- Exact solution procedures for the balanced unidirectional cyclic layout problem
- Context-independent scatter and tabu search for permutation problems
- Probabilistic asymptotic properties of some combinatorial optimization problems
- RPLIB
- The rankability of weighted data from pairwise comparisons
- Variable neighborhood search for the linear ordering problem
- A branch-and-cut algorithm for the target visitation problem
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Global approaches for facility layout and VLSI floorplanning
- An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- How to recycle your facets
- A general meta-heuristic based solver for combinatorial optimisation problems
- On discrete optimization with ordering
- The rankability of data
- Branch distance optimization of structured programs
- Combinatorial optimization and small polytopes
- Distance and consensus for preference relations corresponding to ordered partitions
- Set packing relaxations of some integer programs
- On the partial order polytope of a digraph
- MDPLIB
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
- The linear ordering problem with cumulative costs
- scientific article; zbMATH DE number 1962001 (Why is no real title available?)
- Parameterized constraint satisfaction problems: a survey
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- New Facets of the Linear Ordering Polytope
- On the combinatorial structure of the approval-voting polytope
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs
This page was built for software: LOLIB
