This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive ...

Dinkelbach's algorithm [2] solving the parametric equivalent of a fractional program is investigated. It is shown that the algorithm converges superlinearly and often (locally) quadratically.

Probabilistic Programming and Inference Algorithms Publication Trend The graph below shows the total number of publications each year in Probabilistic Programming and Inference Algorithms.