Publication:4496022
From MaRDI portal
zbMath0965.90057MaRDI QIDQ4496022
John E. Mitchell, Brian Borchers
Publication date: 5 August 2001
Boolean programming; linear ordering problem; zero-one linear programming; interior point cutting plane method; simplex cutting plane method
Related Items
Revised GRASP with path-relinking for the linear ordering problem, A benchmark library and a comparison of heuristic methods for the linear ordering problem, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Using selective orthonormalization to update the analytic center after addition of multiple cuts, 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, A survey on the linear ordering problem for weighted or unweighted tournaments, A branch-and-cut algorithm for a resource-constrained scheduling problem