We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a particular algorithm was designed to solve explicitly, however, we include problems that, with polynomial overhead, can be solved ‘implicitly’ during the algorithm’s execution. For example, we allow to solve a decision problem by suitably trans...

We consider convex optimization problems formulated using dynamic programming equations. Such problems can be solved using the Dual Dynamic Programming algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm,...

The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem. In the proposed algorithm, a binary array is considered as solution representation and the SA algorithm manages open and closed arcs. Several strategies for open...

Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorithms. We present a combinatorial algorithm for the problem that is not based on flows. Numerical tests suggest that this algorithm performs quite well in practice and is competitive with flow based algorithms especially in the ca...

In this paper, we present a novel computational modeling and simulation framework based on dynamic spherical volumetric simplex splines. The framework can handle the modeling and simulation of genus-zero objects with real physical properties. In this framework, we first develop an accurate and efficient algorithm to reconstruct the high-fidelity digital model of a real-world object with spheric...

honeypot is a security device the value of which lies mainly in discovering and inspecting, being attacked and being at risk. most of the present honeypots are configured and installed on the network statically. in some cases considerations have been made on dynamic configuration of honeypots at the time of installation but still no study have been carried out on how to instantaneously change t...

Production of highly viscous tar sand bitumen using Steam Assisted Gravity Drainage (SAGD) with a pair of horizontal wells has advantages over conventional steam flooding. This paper explores the use of Artificial Neural Networks (ANNs) as an alternative to the traditional SAGD simulation approach. Feed forward, multi-layered neural network meta-models are trained through the Back-...

Capacitated location-allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Fina...