The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...