scientific article; zbMATH DE number 1489805
From MaRDI portal
Publication:4496022
zbMath0965.90057MaRDI QIDQ4496022
Brian Borchers, John E. Mitchell
Publication date: 5 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean programminglinear ordering problemzero-one linear programminginterior point cutting plane methodsimplex cutting plane method
Related Items (18)
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 ⋮ Semidefinite relaxations of ordering problems ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ On VLSI interconnect optimization and linear ordering problem ⋮ A branch-and-cut algorithm for a resource-constrained scheduling problem ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A constraint generation algorithm for large scale linear programs using multiple-points separation ⋮ Variable neighborhood search for the linear ordering problem ⋮ Using selective orthonormalization to update the analytic center after addition of multiple cuts ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Cuts for mixed 0-1 conic programming ⋮ Unnamed Item
This page was built for publication:
