Locating an Undesirable Facility by Generalized Cutting Planes
نویسندگان
چکیده
منابع مشابه
Cutting planes algorithm for convex Generalized Disjunctive Programs
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملSolving Standard Quadratic Programming by Cutting Planes
Standard quadratic programs are non-convex quadratic programs with the only constraint that variables must belong to a simplex. By a famous result of Motzkin and Straus, those problems are connected to the clique number of a graph. In this paper, we study cutting plane techniques to obtain strong bounds for standard quadratic programs. Our cuts are derived in the context of a Spatial Branch & B...
متن کاملStraightest Paths on Meshes by Cutting Planes
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to compute shortest geodesic paths have been published. In this paper, we present a new approach to compute the straightest path from a source to one or more vertices on a manifold mesh with a boundary. A cutting plane wi...
متن کاملSAT4JPseudo: replacing resolution by cutting planes
SAT4J [1] is an open-source library of conflict-driven clause learning SAT solvers in the spirit of GRASP, zChaff and MiniSAT in Java. Its extension to pseudoboolean optimization is done by replacing the resolution performed between clauses by cutting planes, in the spirit of PBChaff [5] or Galena [4]. Compared to the version submitted to the PB05 evaluation, the solver is representing each kin...
متن کاملRouting in grid graphs by cutting planes
In this paper we study the following problem, which we call the weighted routing problem. Let be given a graph G = (V, E) with non-negative edge weights we € R+ and integer edge capacities ce 6 IN and let M = {Ti,.. .,Tjv}, N > 1, be a list of node sets. The weighted routing problem consists in finding edge sets S\,...,Sjq such that, for each A € { 1 , . . . , N}, the subgraph (V(Sk),Sk) contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1998
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.23.3.680