3 documentos corresponden a la consulta.
Palabras contadas: programming: 38, dynamic: 53
Méndez-Díaz, I. - Zabala, P.
Discrete Appl Math 2010;158(4):349-354
2010
Temas: Branch-and-Cut - Graph multicoloring - Integer programming - Branch-and-cut - Branch-and-cut algorithms - Graph multicoloring - Integer programming formulations - Multicoloring - Polytopes - Random instance
Descripción: This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify to the polytope associated with the model. The Branch-and-Cut system includes separation heuristics for the valid inequalities, specific initial and primal heuristics, branching and pruning rules. We report on computational experience with random instances. © 2009 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Méndez-Díaz, I. - Zabala, P. - Lucena, A.
Discrete Appl Math 2008;156(17):3223-3237
2008
Temas: Branch-and-cut algorithms - Integer programming - Traveling deliveryman problem - Dynamic programming - Hamiltonians - Integer programming - Linearization - Meats - Particle size analysis - Branch-and-Bound
Descripción: The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamiltonian path equals the sum of the costs for the layers of paths (along the Hamiltonian path) going from the depot vertex to each of the remaining vertices. In this paper, we propose a new Integer Programming formulation for the problem and computationally evaluate the strength of its Linear Programming relaxation. Computational results are also presented for a cutting plane algorithm that uses a number of valid inequalities associated with the proposed formulation. Some of these inequalities are shown to be facet defining for the convex hull of feasible solutions to that formulation. These inequalities proved very effective when used to reinforce Linear Programming relaxation bounds, at the nodes of a Branch and Bound enumeration tree. © 2008 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Garbervetsky, D. - Gorín, D. - Neisen, A.
Lect. Notes Comput. Sci. 2011;6605 LNCS:65-80
2011
Temas: Abstract data types - Dynamic frame - Non-circular - Non-trivial - Programming language - Structural invariants - Theory of dynamics - Algorithms - Machinery - Trees (mathematics)
Descripción: The theory of dynamic frames is a promising approach to handle the so-called framing problem, that is, giving a precise characterizations of the locations in the heap that a procedure may modify. In this paper, we show that the machinery used for dynamic frames may be exploited even further. In particular, we use it to check that implementations of abstract data types maintain certain structural invariants that are very hard to express with usual means, including being acyclic (like non-circular linked lists and trees) and having a unique path between nodes (like in a tree). The idea is that regions in this formalism over-approximate the set of reachable objects. We can then maintain this structural invariants by including special preconditions in assignments, of the kind that can be verified by state-of-the-art SMT-based tools. To test this approach we modified the verifier for the Dafny programming language in a suitable way and were able to enforce these invariants in non-trivial examples. © 2011 Springer-Verlag.
...ver más Tipo de documento: info:ar-repo/semantics/artículo