scientific article; zbMATH DE number 3902051
From MaRDI portal
Publication:3680289
acyclic subgraph problemarcheologybranch and boundcomplete directed graphconvex hullcutting planeeconomicsfacetsfeedback arc set problemlinear programmingpolyhedral approachschedulingsocial sciencesspanning acyclic tournament of maximum total arc weight
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68Rxx) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Linear programming (90C05)
Recommendations
Cited in
(78)- Parameterized algorithmics for linear arrangement problems
- A cutting plane algorithm for a clustering problem
- 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
- The order of Appel's algorithm
- Generalized transitive tournaments and doubly stochastic matrices
- Ordering algorithms for irreducible sparse linear systems
- A cutting-plane approach to the edge-weighted maximal clique problem
- Facets of linear signed order polytopes.
- Signed orders, choice probabilities, and linear polytopes
- The biorder polytope
- Combinatorial optimization and small polytopes
- A new heuristic algorithm solving the linear ordering problem
- An ordering linear unification algorithm
- On the combinatorial structure of the approval-voting polytope
- Independent random utility representations
- The median procedure in the semilattice of orders
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
- On the integral dicycle packings and covers and the linear ordering polytope
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
- On the partial order polytope of a digraph
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Analysis of a generalized linear ordering problem via integer programming
- The rankability of weighted data from pairwise comparisons
- Fairness and the set of optimal rankings for the linear ordering problem
- NP-hardness results for the aggregation of linear orders into median orders
- A branch-and-cut algorithm for the target visitation problem
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- On VLSI interconnect optimization and linear ordering problem
- Exact solution procedures for the balanced unidirectional cyclic layout problem
- The linear ordering problem with cumulative costs
- Variable neighborhood search for the linear ordering problem
- How to recycle your facets
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Computational approaches to MAX-cut
- Global approaches for facility layout and VLSI floorplanning
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
- New results of ant algorithms for the linear ordering problem
- Exact algorithms for the quadratic linear ordering problem
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- scientific article; zbMATH DE number 4133831 (Why is no real title available?)
- Lagrangian relaxation and pegging test for linear ordering problems
- Approximating Minimum Linear Ordering Problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- scientific article; zbMATH DE number 4152147 (Why is no real title available?)
- The examples of non-integer vertices of the relaxation polytope of the linear ordering problem and their structure
- On discrete optimization with ordering
- scientific article; zbMATH DE number 3902393 (Why is no real title available?)
- A minimum violations ranking method
- Revised GRASP with path-relinking for the linear ordering problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- A branch and bound algorithm for the minimum storage-time sequencing problem
- scientific article; zbMATH DE number 1489805 (Why is no real title available?)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- scientific article; zbMATH DE number 1757965 (Why is no real title available?)
- The strongest facets of the acyclic subgraph polytope are unknown
- scientific article; zbMATH DE number 4116248 (Why is no real title available?)
- Parameterized constraint satisfaction problems: a survey
- The rankability of data
- Voting procedures, complexity of
- Rank aggregation in cyclic sequences
- Determining the automorphism group of the linear ordering polytope
- SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- The class of non-integer vertices for the initial relaxation polytope of the linear ordering problem
- On the feedback vertex set problem for a planar graph
- Ordered median traveling salesman problem
- Primary facets of order polytopes
- Branch distance optimization of structured programs
- The linear ordering problem with clusters: a new partial ranking
- Applying mod-\(k\)-cuts for solving linear ordering problems
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680289)
