The following pages link to LOLIB (Q24581):
Displaying 50 items.
- On discrete optimization with ordering (Q367635) (← links)
- A minimum violations ranking method (Q400018) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← links)
- On the feedback vertex set problem for a planar graph (Q678111) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Branch distance optimization of structured programs (Q805220) (← links)
- The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures (Q1184360) (← links)
- Induced binary probabilities and the linear ordering polytope: A status report (Q1184362) (← links)
- Geometric and combinatorial properties of the polytope of binary choice probabilities (Q1184363) (← links)
- Generalized transitive tournaments and doubly stochastic matrices (Q1194517) (← links)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem (Q1302560) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- The quadratic assignment problem. Theory and algorithms (Q1377989) (← links)
- Facets of linear signed order polytopes. (Q1414239) (← links)
- Set packing relaxations of some integer programs (Q1587935) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- The biorder polytope (Q1765958) (← links)
- The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- An experimental evaluation of a scatter search for the linear ordering problem (Q1850839) (← links)
- On the combinatorial structure of the approval-voting polytope (Q1867363) (← links)
- Independent random utility representations (Q1867819) (← links)
- The median procedure in the semilattice of orders (Q1874539) (← links)
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope (Q1893082) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope (Q1906776) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- The rankability of weighted data from pairwise comparisons (Q2069943) (← links)
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem (Q2122552) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
- Distance and consensus for preference relations corresponding to ordered partitions (Q2304078) (← links)
- A note on small linear-ordering polytopes (Q2368130) (← links)
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- On VLSI interconnect optimization and linear ordering problem (Q2443401) (← links)
- Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
