195 search results - page 15 / 39 » cor 2008 |
COR
2006
13 years 7 months ago
2006
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
COR
2006
13 years 7 months ago
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
COR
2004
13 years 7 months ago
2004
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
COR
2004
13 years 7 months ago
2004
Data mining (DM) techniques are being increasingly used in many modern organizations to retrieve valuable knowledge structures from organizational databases, including data wareho...
COR
2002
13 years 7 months ago
2002
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...