scientific article; zbMATH DE number 1489805
From MaRDI portal
Publication:4496022
Recommendations
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- scientific article; zbMATH DE number 3902051
- Applying mod-\(k\)-cuts for solving linear ordering problems
- scientific article; zbMATH DE number 1302172
Cited in
(24)- Using selective orthonormalization to update the analytic center after addition of multiple cuts
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Design and implementation of a modular interior-point solver for linear optimization
- Block-insertion-based algorithms for the linear ordering problem
- On VLSI interconnect optimization and linear ordering problem
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Variable neighborhood search for the linear ordering problem
- Cuts for mixed 0-1 conic programming
- The linear ordering problem revisited
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Semidefinite relaxations of ordering problems
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- Revised GRASP with path-relinking for the linear ordering problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Bayesian network learning via topological order
- An exact method for the minimum feedback arc set problem
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- Robust multi-label classification via preference learning
- Applying mod-\(k\)-cuts for solving linear ordering problems
- 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 Q4496022)
