The following pages link to LOLIB (Q24581):
Displaying 35 items.
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- How to recycle your facets (Q2506820) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department (Q2688892) (← links)
- The complexity of computing medians of relations. (Q2766482) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Context-independent scatter and tabu search for permutation problems (Q2890461) (← links)
- Exact algorithms for the quadratic linear ordering problem (Q2899047) (← links)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes (Q2901038) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
- (Q3116854) (← links)
- LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144756) (← links)
- A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947) (← links)
- (Q3352900) (← links)
- (Q3416557) (← links)
- Fifty-Plus Years of Combinatorial Integer Programming (Q3565241) (← links)
- (Q3680289) (← links)
- (Q3680606) (← links)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (Q4381060) (← links)
- (Q4418392) (← links)
- (Q4436933) (← links)
- Scatter Search and Path Relinking: Advances and Applications (Q4452890) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163) (← links)
- New Facets of the Linear Ordering Polytope (Q4699161) (← links)
- (Q4840772) (← links)
- (Q4993600) (← links)
- The Rankability of Data (Q5025777) (← links)
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (Q5940609) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)
- A general meta-heuristic based solver for combinatorial optimisation problems (Q5947150) (← links)
